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



Notre Dame Journal of Formal Logic

Classifying the Branching Degrees in the Medvedev Lattice of $\Pi^0_1$ Classes

Christopher P. Alfeld

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

Abstract

A $\Pi^0_1$ 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 \leq_M Q$, if there is a computably continuous functional mapping $Q$ into $P$. Let $\mathcal{L}_M$ be the lattice of degrees formed by $\Pi^0_1$ subclasses of $2^\omega$ under the Medvedev reducibility. In "Non-branching degrees in the Medvedev lattice of $\Pi \sp{0}\sb{1} 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 \cap C \neq \emptyset \neq P \cap C^c$ and $P \cap C \perp_M P \cap 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 \cap C \perp_M P \cap C^c$ and totally separable if, for all $X,Y \in P$, $X \perp_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 $\Pi^0_1$ classes with priority arguments.

Primary Subjects: 03D30
Keywords: $\Pi^0_1$ classes; Medvedev lattice; branching degree

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Alternatively, the document is available for a cost of $20. Select the "buy article" button below to purchase this document from a secured VeriSign, Inc. site.
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1216152548
Digital Object Identifier: doi:10.1215/00294527-2008-009

References

[1] Alfeld, C. P., "Non-branching degrees in the Medvedev lattice of $\Pi \sp0\sb1$" classes, The Journal of Symbolic Logic, vol. 72 (2007), pp. 81--97.
Mathematical Reviews (MathSciNet): MR2298472
Zentralblatt MATH: 1122.03043
Digital Object Identifier: doi:10.2178/jsl/1174668385
Project Euclid: euclid.jsl/1174668385
[2] Binns, S., "A splitting theorem for the Medvedev and Muchnik lattices", Mathematical Logic Quarterly, vol. 49 (2003), pp. 327--35.
Mathematical Reviews (MathSciNet): MR1987431
Zentralblatt MATH: 1022.03021
Digital Object Identifier: doi:10.1002/malq.200310034
[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.
Mathematical Reviews (MathSciNet): MR2001061
Zentralblatt MATH: 1037.03040
Digital Object Identifier: doi:10.1007/s00153-002-0166-7
[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.
Mathematical Reviews (MathSciNet): MR1770733
Zentralblatt MATH: 0962.03040
[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.
Mathematical Reviews (MathSciNet): MR1673586
Zentralblatt MATH: 0941.03044
Digital Object Identifier: doi:10.1016/S0049-237X(98)80046-3
[6] Jockusch, C. G., Jr., and R. I. Soare, "$\Pi \sp0\sb1$" classes and degrees of theories", Transactions of the American Mathematical Society, vol. 173 (1972), pp. 33--56.
Mathematical Reviews (MathSciNet): MR0316227
Zentralblatt MATH: 0262.02041
Digital Object Identifier: doi:10.2307/1996261
[7] Rogers, H., Jr., Theory of recursive functions and effective computability, The MIT Press, Cambridge, 1987.
Mathematical Reviews (MathSciNet): MR886890
[8] Simpson, S. G., "Mass problems and randomness", The Bulletin of Symbolic Logic, vol. 11 (2005), pp. 1--27.
Mathematical Reviews (MathSciNet): MR2125147
Zentralblatt MATH: 1090.03015
Digital Object Identifier: doi:10.2178/bsl/1107959497
Project Euclid: euclid.bsl/1107959497
[9] Simpson, S. G., "$\Pi\sp 0\sb 1$" sets and models of $\textWKL_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.
Mathematical Reviews (MathSciNet): MR2186912
Zentralblatt MATH: 1106.03051
[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.
Mathematical Reviews (MathSciNet): MR2340228
Zentralblatt MATH: 1119.03037
Digital Object Identifier: doi:10.1112/jlms/jdl015
[11] Soare, R. I., Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987.
Mathematical Reviews (MathSciNet): MR882921
Zentralblatt MATH: 0667.03030

2008 © Duke University Press