Classifying model-theoretic properties

DOI10.2178/JSL/1230396753zbMATH Open1160.03012OpenAlexW2102442643MaRDI QIDQ3617367FDOQ3617367

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

Recommendations

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

zbMATH Keywords

computable modelprime modelprime bounding

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Cites Work

• Title not available (Why is that?)
• Computable models of theories with few models
• Title not available (Why is that?)
• A new spectrum of recursive models

Cited In (12)

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

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)