Keywords
- Finite Number
- Distributive Lattice
- Initial Segment
- Empty Sequence
- Great Stage
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. H. Lachlan, Lower bounds for pairs of recursively enumerable degrees, Proc. London Math. Soc. 16 (1966) 537–569.
S. K. Thomason, Sublattices of the r.e. degrees, Amer. Math. Soc. Notices 16 (1969) 423.
S. K. Thomason, Sublattices of the recursively enumerable degrees, Z. Math. Logik Grundlagen Math., to appear.
C. E. M. Yates, A minimal pair of recursively enumerable degrees, J. Symbolic Logic 31 (1966) 159–168.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1972 Springer-Verlag
About this paper
Cite this paper
Lachlan, A.H. (1972). Embedding nondistributive lattices in the recursively enumerable degrees. In: Hodges, W. (eds) Conference in Mathematical Logic — London ’70. Lecture Notes in Mathematics, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059544
Download citation
DOI: https://doi.org/10.1007/BFb0059544
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05744-4
Online ISBN: 978-3-540-37162-5
eBook Packages: Springer Book Archive
