On the structure of the Medvedev lattice
Sebastiaan A. Terwijn
Source: J. Symbolic Logic Volume 73, Issue 2
(2008), 543-558.
Abstract
We investigate the structure of the Medvedev lattice as a partial order. We prove that every interval in the lattice is either finite, in which case it is isomorphic to a finite Boolean algebra, or contains an antichain of size 22ℵ0, the size of the lattice itself. We also prove that it is consistent with ZFC that the lattice has chains of size 22ℵ0, and in fact that these big chains occur in every infinite interval. We also study embeddings of lattices and algebras. We show that large Boolean algebras can be embedded into the Medvedev lattice as upper semilattices, but that a Boolean algebra can be embedded as a lattice only if it is countable. Finally we discuss which of these results hold for the closely related Muchnik lattice.
First Page:
Show
Hide
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
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1208359059
Digital Object Identifier: doi:10.2178/jsl/1208359059
Mathematical Reviews number (MathSciNet): MR2414464
Zentralblatt MATH identifier: 1140.03020
References
Stephen Binns and Stephen G. Simpson, Embeddings into the Medvedev and Muchnik lattices of $\Pi^0_1$ classes, Archive for Mathematical Logic, vol. 43 (2004), pp. 399--414.
Mathematical Reviews (MathSciNet): MR2052891
Digital Object Identifier: doi:10.1007/s00153-003-0195-x
Zentralblatt MATH: 1058.03041
Elena Z. Dyment, Certain properties of the Medvedev lattice, Mathematics of the USSR Sbornik, vol. 30 (1976), pp. 321--340, English translation.
Mathematical Reviews (MathSciNet): MR432433
Kenneth Kunen, Set theory: An introduction to independence proofs, North-Holland, 1983.
Mathematical Reviews (MathSciNet): MR756630
Zentralblatt MATH: 0534.03026
Yuri T. Medvedev, Degrees of difficulty of the mass problems, Doklady Akademii Nauk SSSR, vol. 104 (1955), no. 4, pp. 501--504.
Mathematical Reviews (MathSciNet): MR73542
Albert A. Muchnik, Negative answer to the problem of reducibility in the theory of algorithms, Doklady Akademii Nauk SSSR (N.S.), vol. 108 (1956), pp. 194--197.
--------, On strong and weak reducibility of algorithmic problems, Sibirskii Mathematicheskii Zhurnal, vol. 4 (1963), pp. 1328--1341, in Russian.
Mathematical Reviews (MathSciNet): MR200151
Piergiorgio G. Odifreddi, Classical recursion theory, I, Studies in logic and the foundations of mathematics, vol. 125, North-Holland, 1989.
Mathematical Reviews (MathSciNet): MR982269
Zentralblatt MATH: 0661.03029
--------, Classical recursion theory, II, Studies in logic and the foundations of mathematics, vol. 143, North-Holland, 1999.
Zentralblatt MATH: 0931.03057
Richard A. Platek, A note on the cardinality of the Medvedev lattice, Proceedings of the American Mathematical Society, vol. 25 (1970), p. 917.
Mathematical Reviews (MathSciNet): MR262080
Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill, 1967.
Mathematical Reviews (MathSciNet): MR224462
Zentralblatt MATH: 0183.01401
Gerald E. Sacks, On suborderings of degrees of recursive unsolvability, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 (1961), pp. 46--56.
Mathematical Reviews (MathSciNet): MR131973
Stephen Simpson, Mass problems and randomness, Bulletin of Symbolic Logic, vol. 11 (2005), no. 1, pp. 1--27.
Mathematical Reviews (MathSciNet): MR2125147
Digital Object Identifier: doi:10.2178/bsl/1107959497
Project Euclid: euclid.bsl/1107959497
Zentralblatt MATH: 1090.03015
Andrea Sorbi, Some remarks on the algebraic structure of the Medvedev lattice, Journal of Symbolic Logic, vol. 55 (1990), no. 2, pp. 831--853.
Mathematical Reviews (MathSciNet): MR1056392
Digital Object Identifier: doi:10.2307/2274668
Project Euclid: euclid.jsl/1183743335
Zentralblatt MATH: 0703.03022
--------, The Medvedev lattice of degrees of difficulty, Computability, enumerability, unsolvability: Directions in recursion theory (S. B. Cooper, T. A. Slaman, and S. S. Wainer, editors), London Mathematical Society Lecture Notes, vol. 224, Cambridge University Press, 1996, pp. 289--312.
Mathematical Reviews (MathSciNet): MR1395886
Andrea Sorbi and Sebastiaan A. Terwijn, Intermediate logics and factors of the Medvedev lattice, to appear in Annals of Pure and Applied Logic.
Mathematical Reviews (MathSciNet): MR2455558
Zentralblatt MATH: 1156.03026
Digital Object Identifier: doi:10.1016/j.apal.2008.03.002
Sebastiaan A. Terwijn, The finite intervals of the Muchnik lattice, posted on arXiv, June 28, 2006.
