Categoricity of computable infinitary theories
From MaRDI portal
(Redirected from Publication:1005932)
Recommendations
Cites work
- A Borel reductibility theory for classes of countable structures
- An example concerning Scott heights
- Atomic models higher up
- Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes
- Computable trees of Scott rank ω1CK, and computable approximation
- Degree spectra and computable dimensions in algebraic structures
- Intrinsically Hyperarithmetical Sets
- Model Theory
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Recursive Pseudo-Well-Orderings
- Scott sentences and admissible sets
- Π11 relations and paths through
Cited in
(14)- Categoricity and generalized model completeness
- Once more on countably categorical sentences
- Finite computable dimension and degrees of categoricity
- Theories categorical in power \(n+2\)
- Categoricity spectra of computable structures
- The degree of decidable categoricity of a model with infinite solutions for complete formulas
- A robuster Scott rank
- scientific article; zbMATH DE number 4004164 (Why is no real title available?)
- The index set of uncountably categorical theories
- Some new computable structures of high rank
- scientific article; zbMATH DE number 1834650 (Why is no real title available?)
- Relativizing computable categoricity
- Complexity of categorical theories with computable models
- Atomic models higher up
This page was built for publication: Categoricity of computable infinitary theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005932)