Nonarithmetical ℵ0-categorical theories with recursive models

DOI10.2307/2275253MaRDI QIDQ4292596zbMATH OpenOpenAlexFDO

Authors J. F. Knight

Publication date 22 January 1995

Published in Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

\(\aleph_ 0\)-categorical first-order theoryapproximationsrecursive model

Mathematics Subject Classification ID

Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57)

Recommendations

• The degrees of categorical theories with recursive models
• scientific article; zbMATH DE number 1936725
• Complexity of categorical theories with computable models
• Complexity of Categorical Theories with Computable Models
• Complexity of categorical theories with computable models

Cited in

(11)

• Building models of strongly minimal theories
• Computing and dominating the Ryll-Nardzewski function
• The degrees of categorical theories with recursive models
• Complexity of Ehrenfeucht models
• A computable ℵ₀-categorical structure whose theory computes true arithmetic
• Recursive categoricity and persistence
• Autostability of prime models under strong constructivizations
• The property ``arithmetic-is-recursive on a cone
• Coinductive ℵ₀-categorical theories
• Recursive models and the divisibility poset
• A Bicategorical Model for Finite Nondeterminism

This page was built for publication: Nonarithmetical ℵ₀-categorical theories with recursive models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4292596)