Preserving categoricity and complexity of relations
DOI10.1007/S10469-015-9333-XzbMath1337.03065OpenAlexW2288714259MaRDI QIDQ887644
S. VanDenDriessche, Jesse Johnson, Jamalbek Tussupov, Julia F. Knight, Victor A. Ocasio
Publication date: 27 October 2015
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-015-9333-x
field\(\Delta_0^\alpha\)-categorical structurecomputable limit ordinalnot relatively \(\Delta_0^\alpha\)-categorical structure
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Categoricity and completeness of theories (03C35)
Cites Work
- Unnamed Item
- Generic copies of countable structures
- Autostability of models and Abelian groups
- Autostability of models
- Enumerations of families of general recursive functions
- Computable enumerations of families of general recursive functions
- The quantity of nonautoequivalent constructivizations
- Degree spectra and computable dimensions in algebraic structures
- Undecidable fragments of elementary theories
- Enumerations in computable structure theory
- A Borel reductibility theory for classes of countable structures
- Intrinsic bounds on complexity and definability at limit levels
- Isomorphisms, definable relations, and Scott families of class 2 nilpotent groups
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- Model Theory
- Intrinsically II Relations
- Categoricity properties for computable algebraic fields
- Π11 relations and paths through
- Intrinsically Hyperarithmetical Sets
- Effective model theory vs. recursive model theory
This page was built for publication: Preserving categoricity and complexity of relations
