Classifying model-theoretic properties

DOI10.2178/jsl/1230396753zbMath1160.03012OpenAlexW2102442643MaRDI QIDQ3617367

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 modelprime bounding

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (8)

2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09 ⋮ Dominating the Erdős-Moser theorem in reverse mathematics ⋮ Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem ⋮ Array nonrecursiveness and relative recursive enumerability ⋮ Degrees bounding principles and universal instances in reverse mathematics ⋮ Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees ⋮ Thin set theorems and cone avoidance ⋮ The atomic model theorem and type omitting

Cites Work

• Unnamed Item
• Unnamed Item
• A new spectrum of recursive models
• Computable models of theories with few models

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