Categoricity of computable infinitary theories
From MaRDI portal
Publication:1005932
DOI10.1007/s00153-008-0117-zzbMath1161.03020MaRDI QIDQ1005932
Julia F. Knight, Jessica Millar, Sergei S. Goncharov, Wesley Calvert
Publication date: 17 March 2009
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-008-0117-z
computable structures; categoricity; structural complexity; Scott rank; computable infinitary theories
03C57: Computable structure theory, computable model theory
Related Items
Cites Work
- Unnamed Item
- Atomic models higher up
- Degree spectra and computable dimensions in algebraic structures
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- A Borel reductibility theory for classes of countable structures
- An example concerning Scott heights
- Scott sentences and admissible sets
- Model Theory
- Π11 relations and paths through
- Computable trees of Scott rank ω1CK, and computable approximation
- Recursive Pseudo-Well-Orderings
- Intrinsically Hyperarithmetical Sets