Notre Dame Journal of Formal Logic

Classifying the Branching Degrees in the Medvedev Lattice of Π 1 0 Classes

Christopher P. Alfeld

Abstract

A Π 1 0 class can be defined as the set of infinite paths through a computable tree. For classes P and Q , say that P is Medvedev reducible to Q , P M Q , if there is a computably continuous functional mapping Q into P . Let M be the lattice of degrees formed by Π 1 0 subclasses of 2 ω under the Medvedev reducibility. In "Non-branching degrees in the Medvedev lattice of Π 1 0 classes," I provided a characterization of nonbranching/branching and a classification of the nonbranching degrees. In this paper, I present a similar classification of the branching degrees. In particular, P is separable if there is a clopen set C such that P C P C c and P C M P C c . By the results in the first paper, separability is an invariant of a Medvedev degree and a degree is branching if and only if it contains a separable member. Further define P to be hyperseparable if, for all such C , P C M P C c and totally separable if, for all X , Y P , X T Y . I will show that totally separable implies hyperseparable implies separable and that the reverse implications do not hold, that is, that these are three distinct types of branching degrees. Along the way I will show some related results and present a combinatorial framework for constructing Π 1 0 classes with priority arguments.

Article information

Source
Notre Dame J. Formal Logic, Volume 49, Number 3 (2008), 227-243.

Dates
First available in Project Euclid: 15 July 2008

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1216152548

Digital Object Identifier
doi:10.1215/00294527-2008-009

Mathematical Reviews number (MathSciNet)
MR2428552

Zentralblatt MATH identifier
1157.03021

Subjects
Primary: 03D30: Other degrees and reducibilities

Keywords
$\Pi^0_1$ classes Medvedev lattice branching degree

Citation

Alfeld, Christopher P. Classifying the Branching Degrees in the Medvedev Lattice of $\Pi^0_1$ Classes. Notre Dame J. Formal Logic 49 (2008), no. 3, 227--243. doi:10.1215/00294527-2008-009. https://projecteuclid.org/euclid.ndjfl/1216152548


Export citation

References

  • [1] Alfeld, C. P., "Non-branching degrees in the Medvedev lattice of $\Pi \sp{0}\sb{1}$" classes, The Journal of Symbolic Logic, vol. 72 (2007), pp. 81–97.
  • [2] Binns, S., "A splitting theorem for the Medvedev and Muchnik lattices", Mathematical Logic Quarterly, vol. 49 (2003), pp. 327–35.
  • [3] Cenzer, D., and P. G. Hinman, "Density of the Medvedev lattice of $\Pi\sp 0\sb 1$" classes, Archive for Mathematical Logic, vol. 42 (2003), pp. 583–600.
  • [4] Cenzer, D., and C. G. Jockusch, Jr., "$\Pi\sb 1\sp 0$" classes–-Structure and applications", pp. 39–59 in Computability Theory and Its Applications (Boulder, CO, 1999), vol. 257 of Contempory Mathematics, American Mathematics Society, Providence, 2000.
  • [5] Cenzer, D., and J. B. Remmel, "$\Pi\sp 0\sb 1$" classes in mathematics", pp. 623–821 in Handbook of Recursive Mathematics, Vol. 2, vol. 139 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1998.
  • [6] Jockusch, C. G., Jr., and R. I. Soare, "$\Pi \sp{0}\sb{1}$" classes and degrees of theories", Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33–56.
  • [7] Rogers, H., Jr., Theory of recursive functions and effective computability, The MIT Press, Cambridge, 1987.
  • [8] Simpson, S. G., "Mass problems and randomness", The Bulletin of Symbolic Logic, vol. 11 (2005), pp. 1–27.
  • [9] Simpson, S. G., "$\Pi\sp 0\sb 1$" sets and models of $\text{WKL}_0$", pp. 352–78 in Reverse Mathematics 2001, edited by S. G. Simpson, vol. 21 of Lecture Notes in Logic, A. K. Peters, Ltd., Wellesley, 2005.
  • [10] Simpson, S. G., "An extension of the recursively enumerable Turing degrees", Journal of London Mathematical Society, Second Series, vol. 75 (2007), pp. 287–97.
  • [11] Soare, R. I., Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.