Persistently Finite, Persistently Arithmetic Theories

DOI10.2307/2045502zbMath0527.03014OpenAlexW4255224893MaRDI QIDQ3043120

C. J. Ash, Terrence Millar

Publication date: 1983

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

zbMATH Keywords

first-order logicdecidable theorycountable modelsarithmetical modelsarithmetical typespersistently finite theory

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15)

Related Items (1)

Autostability of prime models under strong constructivizations

Cites Work

• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Persistently Finite Theories with Hyperarithmetic Models
• Foundations of recursive model theory
• Remarks on countable models
• A note on a theorem of Vaught

This page was built for publication: Persistently Finite, Persistently Arithmetic Theories