Categoricity of computable infinitary theories

DOI10.1007/S00153-008-0117-ZzbMath1161.03020OpenAlexW2031595317MaRDI 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

zbMATH Keywords

computable structurescategoricitystructural complexityScott rankcomputable infinitary theories

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (2)

Some new computable structures of high rank ⋮ Atomic models higher up

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
• Π₁¹ relations and paths through
• Computable trees of Scott rank ω₁^CK, and computable approximation
• Recursive Pseudo-Well-Orderings
• Intrinsically Hyperarithmetical Sets

This page was built for publication: Categoricity of computable infinitary theories