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
Noninterpretability of Infinite Linear Orders
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. 73 - 78Publisher: Cambridge University PressPrint publication year: 2017
References
Coding in the lattice of enumerable sets. Submitted.
Model Theory. Encyclopedia of mathematics and its applications 42, Cambridge University Press, 1993.
The interval of the lattice of r.e. sets determined by major subsets. Annals of Pure and applied Logic, 24 (1983), 189–212.Google Scholar
The last question on recursively enumerable many one degrees. Algebra Logika
33 (5), transl. July 1995
550–563.Google Scholar
Intervals of. To appear.
Flexible coding of standard models of arithmetic. To appear.
and Definability in the r.e. Turing degrees. To appear.
“R.c. sets and degrees”. Springer
1987.