Classifying model-theoretic properties

DOI10.2178/JSL/1230396753MaRDI QIDQ3617367zbMATH OpenOpenAlexFDO

Authors Chris J. Conidis

Publication date 23 March 2009

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

Full work available at URL https://doi.org/10.2178/jsl/1230396753

zbMATH Keywords

computable modelprime boundingprime model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Recommendations

• Bounding prime models
• Degree spectra of prime models
• Index sets of prime models
• Prime models of computably enumerable degree
• Effective prime uniqueness

Cites work

• A new spectrum of recursive models
• Computable models of theories with few models
• scientific article; zbMATH DE number 3861137 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)

Cited in

(12)

• Classification theory over a predicate. I
• Abstract complexity theory and the \(\Delta_{2}^{0}\) degrees
• Extending to a model structure is not a first-order property
• Dominating the Erdős-Moser theorem in reverse mathematics
• The atomic model theorem and type omitting
• Degrees bounding principles and universal instances in reverse mathematics
• Working with strong reducibilities above totally -c.e. and array computable degrees
• Thin set theorems and cone avoidance
• 2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
• Bounding prime models
• Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
• Array nonrecursiveness and relative recursive enumerability

This page was built for publication: Classifying model-theoretic properties

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