- 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 ranked finite partial lattices into the computably enumerable degrees
Annals of Pure and Applied Logic 94 (1-3):143-180 (1998)
Abstract
We define a class of finite partial lattices which admit a notion of rank compatible with embedding constructions, and present a necessary and sufficient condition for the embeddability of a finite ranked partial lattice into the computably enumerable degreesMy notes
Similar books and articles
Embedding finite lattices into the ideals of computably enumerable Turing degrees.William C. Calhoun & Manuel Lerman - 2001 - Journal of Symbolic Logic 66 (4):1791-1802.
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 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.
Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices.Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman - 1996 - Journal of Symbolic Logic 61 (3):880-905.
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
The computably enumerable degrees are locally non-cappable.Matthew B. Giorgi - 2004 - Archive for Mathematical Logic 43 (1):121-139.
On the filter of computably enumerable supersets of an r-maximal set.Steffen Lempp, André Nies & D. Reed Solomon - 2001 - Archive for Mathematical Logic 40 (6):415-423.
Differences of Computably Enumerable Sets.A. Nies & S. Lempp - 2000 - Mathematical Logic Quarterly 46 (4):555-562.
Bounding minimal degrees by computably enumerable degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent.Klaus Ambos-Spies, Philipp Bodewig, Yun Fan & Thorsten Kräling - 2013 - Annals of Pure and Applied Logic 164 (5):577-588.
Traces, traceability, and lattices of traces under the set theoretic inclusion.Gunther Mainhardt - 2013 - Archive for Mathematical Logic 52 (7-8):847-869.
On a problem of Cooper and Epstein.Shamil Ishmukhametov - 2003 - Journal of Symbolic Logic 68 (1):52-64.
Analytics
Added to PP
2014-01-16
Downloads
17 (#872,959)
6 months
1 (#1,478,781)
2014-01-16
Downloads
17 (#872,959)
6 months
1 (#1,478,781)
Historical graph of downloads
Citations of this work
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.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
Embedding finite lattices into the ideals of computably enumerable Turing degrees.William C. Calhoun & Manuel Lerman - 2001 - Journal of Symbolic Logic 66 (4):1791-1802.
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.
2000 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium 2000.Carol Wood - 2001 - Bulletin of Symbolic Logic 7 (1):82-163.
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.
Lattice nonembeddings and initial segments of the recursively enumerable degrees.Rod Downey - 1990 - Annals of Pure and Applied Logic 49 (2):97-119.
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.
Lattice embeddings into the recursively enumerable degrees.K. Ambos-Spies & M. Lerman - 1986 - Journal of Symbolic Logic 51 (2):257-272.
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-5ff6c685cb-pqwqt uwo