Skip to main content

Uniform almost everywhere domination

  • Peter Cholak (a1), Noam Greenberg (a2) and Joseph S. Miller (a3)

We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This answers a question of Dobrinen and Simpson, who showed that such functions are related to the proof-theoretic strength of the regularity of Lebesgue measure for Gδ sets. Our constructions essentially settle the reverse mathematical classification of this principle.

Hide All
[I]Ackermann, W., Zum Hilbertschen Aufbau der reellen Zahlen., Mathematische Annalen, vol. 99 (1928), pp. 118133.
[2]Binns, Stephen, Kjos-Hanssen, Bjο, Lerman, Manuel, and Solomon, Reed, On a conjecture of Dobrinen and Simpson concerning almost everywhere domination, 2005.
[3]Dobrinen, Natasha L. and Simpson, Stephen G., Almost everywhere domination, this Journal, vol. 69 (2004), no. 3, pp. 914922.
[4]Giusto, Mariagnese and Simpson, Stephen G., Located sets and reverse mathematics, this Journal, vol. 65 (2000), no. 3, pp. 14511480.
[5]Hausdorff, Felix, Die Graduierung nach dem Endverlauf, Abhandlungen der Königlichen sächsischen Gesellschaft der Wissenschaften (Mathematisch-physische Klasse), vol. 31 (1909), pp. 296334.
[6]Jockusch, Carl G. Jr., Degrees of functions with no fixed points, Logic, methodology and philosophy of science, VIII (Moscow, 1987), Studies in Logic and the Foundations of Mathematics, vol. 126, North-Holland, Amsterdam, 1989, pp. 191201.
[7]Jockusch, Carl G. Jr. and Shore, Richard A., Pseudojump operators. I. The r.e. case, Transactions of the American Mathematical Society, vol. 275 (1983), no. 2, pp. 599609.
[8]Jockusch, Carl G. Jr. and Soare, Robert I., Degrees of members of classes, Pacific Journal of Mathematics, vol. 40 (1972), pp. 605616.
[9]Jockusch, Carl G. Jr. and Soare, Robert I., classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173 (1972), pp. 3356.
[10]Kučera, Antonín, Measure, -classes and complete extensions of PA, Recursion theory week (Oberwolfach, 1984), Lecture Notes in Mathematics, vol. 1141, Springer, Berlin, 1985, pp. 245259.
[11]Kurtz, Stuart, Randomness and genericty in the degrees of unsolvability, Ph.D. thesis, University of Illinios at Urbana-Champaign, 1981.
[12]Martin, D. A., Classes of recursively enumerable sets and degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 295310.
[13]Nies, André, Lowness properties and randomness, Advances in Mathematics, vol. 197 (2005), pp. 274305.
[14]Posner, David B. and Robinson, Robert W., Degrees joining to 0', this Journal, vol. 46 (1981), no. 4, pp. 714722.
[15]Simpson, Stephen G., Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1999.
[16]Tennenbaum, S., Degree of unsolvability and the rate of growth of functions, Proceedings of the symposium on mathematical theory of automata (New York, 1962), Polytechnic Press of Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 7173.
[17]Yates, C. E. M., Three theorems on the degrees of recursively enumerable sets, Duke Mathematical Journal, vol. 32 (1965), pp. 461468.
[18]Yu, Xiaokang and Simpson, Stephen G., Measure theory and weak König's lemma, Archive for Mathematical Logic, vol. 30 (1990), no. 3, pp. 171180.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 5 *
Loading metrics...

Abstract views

Total abstract views: 123 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 21st September 2018. This data will be updated every 24 hours.