Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 73, Issue 2 (2008), 543-558.
On the structure of the Medvedev lattice
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.
J. Symbolic Logic, Volume 73, Issue 2 (2008), 543-558.
First available in Project Euclid: 16 April 2008
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Terwijn, Sebastiaan A. On the structure of the Medvedev lattice. J. Symbolic Logic 73 (2008), no. 2, 543--558. doi:10.2178/jsl/1208359059. https://projecteuclid.org/euclid.jsl/1208359059