Intrinsic bounds on complexity and definability at limit levels
From MaRDI portal
Publication:3399191
DOI10.2178/jsl/1245158098zbMath1201.03019OpenAlexW2137507690MaRDI QIDQ3399191
S. Quinn, Ekaterina B. Fokina, J. S. Roy Chisholm, Valentina S. Harizanov, Sergei S. Goncharov, Julia F. Knight
Publication date: 29 September 2009
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1245158098
Computable structure theory, computable model theory (03C57) Categoricity and completeness of theories (03C35)
Related Items
Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism ⋮ Preserving categoricity and complexity of relations ⋮ Degrees of categoricity for superatomic Boolean algebras ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ The complexity of computable categoricity ⋮ Computability-theoretic categoricity and Scott families ⋮ Notes on the Jump of a Structure ⋮ 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms ⋮ Degrees of autostability relative to strong constructivizations ⋮ Categoricity spectra of computable structures ⋮ Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension ⋮ Categoricity and complexity of relations over algebraic structures ⋮ Effective categoricity of abelian \(p\)-groups ⋮ Degrees of bi-embeddable categoricity
Uses Software
Cites Work
- Unnamed Item
- Generic copies of countable structures
- Computable structures and the hyperarithmetical hierarchy
- Enumerations in computable structure theory
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- A construction for recursive linear orderings
- Intrinsically Hyperarithmetical Sets
This page was built for publication: Intrinsic bounds on complexity and definability at limit levels
