- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element
Annals of Pure and Applied Logic 112 (1):1-26 (2001)
Abstract
We present a necessary and sufficient condition for the embeddability of a finite principally decomposable lattice into the computably enumerable degrees preserving greatest elementOther Versions
No versions found
My notes
Similar books and articles
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees.M. Lerman - 2000 - Annals of Pure and Applied Logic 101 (2-3):275-297.
A necessary and sufficient condition for embedding ranked finite partial lattices into the computably enumerable degrees.M. Lerman - 1998 - Annals of Pure and Applied Logic 94 (1-3):143-180.
Embedding finite lattices into the ideals of computably enumerable Turing degrees.William Calhoun & Manuel Lerman - 2001 - Journal of Symbolic Logic 66 (4):1791-1802.
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees.Steffen Lempp & Manuel Lerman - 1997 - Annals of Pure and Applied Logic 87 (2):167-185.
Embeddings of N5 and the contiguous degrees.Klaus Ambos-Spies & Peter A. Fejer - 2001 - Annals of Pure and Applied Logic 112 (2-3):151-188.
On definable filters in computably enumerable degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.
The ibT degrees of computably enumerable sets are not dense.George Barmpalias & Andrew E. M. Lewis - 2006 - Annals of Pure and Applied Logic 141 (1):51-60.
Homomorphisms and quotients of degree structures.Burkhard Englert, Manuel Lerman & Kevin Wald - 2003 - Annals of Pure and Applied Logic 123 (1-3):193-233.
Undecidability and 1-types in intervals of the computably enumerable degrees.Klaus Ambos-Spies, Denis R. Hirschfeldt & Richard A. Shore - 2000 - Annals of Pure and Applied Logic 106 (1-3):1-47.
Analytics
Added to PP
2014-01-16
Downloads
27 (#831,416)
6 months
6 (#879,768)
2014-01-16
Downloads
27 (#831,416)
6 months
6 (#879,768)
Historical graph of downloads
Citations of this work
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element.Burkhard Englert - 2001 - Annals of Pure and Applied Logic 112 (1):1-26.
References found in this work
A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
A finite lattice without critical triple that cannot be embedded into the enumerable Turing degrees.Steffen Lempp & Manuel Lerman - 1997 - Annals of Pure and Applied Logic 87 (2):167-185.
Sublattices of the Recursively Enumerable Degrees.S. K. Thomason - 1971 - Mathematical Logic Quarterly 17 (1):273-280.
Lattice embeddings into the recursively enumerable degrees.K. Ambos-Spies & M. Lerman - 1986 - Journal of Symbolic Logic 51 (2):257-272.
Lattice embeddings into the recursively enumerable degrees. II.K. Ambos-Spies & M. Lerman - 1989 - Journal of Symbolic Logic 54 (3):735-760.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-9l5tj dc2