Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
Intervals without Critical Triples
Published online by Cambridge University Press: 24 March 2017
Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Logic Colloquium '95 , pp. 17 - 43Publisher: Cambridge University PressPrint publication year: 2017
References
[ASF96] ,
1996. Personal communication.
[ASL86] ,
1986. Lattice embeddings into the recursively enumerable degrees, J. Symbolic Logic
51: 257–272.Google Scholar
[ASL89] ,
1989. Lattice embeddings into the recursively enumerable degrees II,]. Symbolic Logic
54: 735–759.Google Scholar
[CDo93] ,
1993. Lattice nonembeddings and intervals of the recursively enumerable degrees, Ann. Pure Appl. Logic
61: 195–221.Google Scholar
[CYi] , n.d. Non-splitting and the high/low hierarchy. In preparation.
[Dow90]
1990. Lattice nonembedding and initial segments of the r. e. degrees, Ann. Pure Appl. Logic
49: 97–119.Google Scholar
[DLe] , n.d. Contiguity and distributivity in the computably enumerable turing degrees, J. Symbolic Logic. To appear.
[DSh95] ,
1995. Degree theoretic definitions of low2 recursively enumerable sets, J. Symbolic Logic
60(3): 727–756.Google Scholar
[DSh96] ,
1996. Lattice embedding below a nonlow2 recursively enumerable degree, Israel J. Math.
94: 221–246.Google Scholar
[JSh83] ,
1983. Pseudo-jump operators I: the r.e. case, Trans. Amer. Math. Soc.
275: 599–609.Google Scholar
[Lac72]
1972. Embedding nondistributive lattices in the recursively enumerable degrees, in (ed.), Conference in Mathematical Logic, London, 1970, Vol. 255 of Lecture Notes in Mathematics, Springer-Verlag, Heidelberg, pp. 149–177.
[LS08O] ,
1980. Not every finite lattice is embeddable in the recursively enumerable degrees, Adv. in Math.
37: 74–82.Google Scholar
[LLe] , n.d. A finite lattice without a critical triple that cannot be embedded into the enumerable turing degree, Ann. Pure Appl. Logic. To appear.
[Leoi 1994]
1994. Generalized Nonsplitting in the Recursively Enumerable Degrees, PhD thesis, University of Wisconsin.
[NSS] , , n.d. Definability in the recursively enumerable degrees. In preparation.
[Sho] n.d. The recursively enumerable degrees, in (ed.), The Handbook of Recursion Theory, North-Holland. To appear.
[SS191] ,
1991. Working below a low2 recursively enumerable degree, Ann. Pure Appl. Logic
52: 1–25.Google Scholar
[Soa87]
1987. Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Heidelberg.
[Wei88]
1988. On Embedding of the Lattice 1-3-1 into the Recursively Enumerable Degrees, PhD thesis, University of California, Berkeley.