Translator Disclaimer
June 2008 On the structure of the Medvedev lattice
Sebastiaan A. Terwijn
J. Symbolic Logic 73(2): 543-558 (June 2008). DOI: 10.2178/jsl/1208359059

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 220, the size of the lattice itself. We also prove that it is consistent with ZFC that the lattice has chains of size 220, 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.

Citation

Download Citation

Sebastiaan A. Terwijn. "On the structure of the Medvedev lattice." J. Symbolic Logic 73 (2) 543 - 558, June 2008. https://doi.org/10.2178/jsl/1208359059

Information

Published: June 2008
First available in Project Euclid: 16 April 2008

zbMATH: 1140.03020
MathSciNet: MR2414464
Digital Object Identifier: 10.2178/jsl/1208359059

Subjects:
Primary: 03D28, 03D30, 03G10

Rights: Copyright © 2008 Association for Symbolic Logic

JOURNAL ARTICLE
16 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.73 • No. 2 • June 2008
Back to Top