Degrees of Recursively Saturated Models

DOI10.2307/1999251zbMath0557.03046OpenAlexW4248176352MaRDI QIDQ3222194

David Marker, Angus J. Macintyre

Publication date: 1984

Full work available at URL: https://doi.org/10.2307/1999251

zbMATH Keywords

Scott setTuring degreerecursively saturated modelsdegrees of presentationseffectively perfect theories

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15) Models with special properties (saturated, rigid, etc.) (03C50) Theory of numerations, effectively presented structures (03D45)

Related Items (7)

Upper bounds for the arithmetical degrees ⋮ EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER ⋮ Representing Scott sets in algebraic settings ⋮ COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS ⋮ Solovay's theorem cannot be simplified ⋮ A construction of real closed fields ⋮ Theory spectra and classes of theories

Cites Work

• Unnamed Item
• Unnamed Item
• Model theory of algebra and arithmetic. Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1-7, 1979
• Decidable models
• The elementary theory of finite fields
• Expansions of models and turing degrees
• Additive structure in uncountable models for a fixed completion of P
• Models of arithmetic and closed ideals
• On a problem of MacDowell and Specker
• Two theorems on degrees of models of true arithmetic
• Foundations of recursive model theory
• Indicators, recursive saturation and expandability
• Recursively saturated nonstandard models of arithmetic
• A guide to the identification of admissible sets above structures
• Uniform upper bounds on ideals of turing degrees

This page was built for publication: Degrees of Recursively Saturated Models