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
Towards Recursive Model Theory
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. 325 - 338Publisher: Cambridge University PressPrint publication year: 2017
References
[BDLW96]
and
Relational expressive power of constraint query languages. In Proc. 15th ACM Symp. on Principles of Database Systems, pages 5–16, 1996.Google Scholar
[Dou87]
Monotone but not positive subsets of the Cantor space. Journal of Symbolic Logic, 52(3):817–818, 1987.Google Scholar
[GS86] and
Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265–280, 1986.Google Scholar
[HH96] and
More about recursive structures: Descriptive complexity and zero-one laws. In editor, Proc. 11th IEEE Symp. on Logic in Computer Science.
IEEE Computer Society Press, Los Alamitos, CA, 1996. to appear.
[Kay91]
Models of Peano Arithmetic.
Clarendon Press, Oxford, England, 1991.
[Lyn59]
Properties preserved under homomorphism. Pacific J. of Mathematics, 9(1):143–154, 1959.Google Scholar
[McA82]
On the complexity of models of arithmetic. Journal of Symbolic Logic, 47:403–415, 1982.Google Scholar
[McC95]
The dimension of the negation of transitive closure. Journal of Symbolic Logic, 60(2):392–414, 1995.Google Scholar
[PVV95]
and
First-order queries on finite structures over reals. In Proc. 10th IEEE Symp. on Logic in Computer Science, pages 79–87. IEEE Computer Society Press, 1995.
[Rog67]
Theory of recursive functions and effective computability.
McGraw-Hill, 1967
[ST96] and
Linear vs. order constraint queries over rational databases. In Proc. 15th ACM Symp. on Principles of Database Systems, pages 17-27, 1996.Google Scholar
[Sto95]
Finitely monotone properties. In Proc. 10th IEEE Symp. on Logic in Computer Science, pages 324–330, Los Alamitos, CA, 1995. IEEE Computer Society Press.