Intrinsic bounds on complexity and definability at limit levels
DOI10.2178/JSL/1245158098zbMATH Open1201.03019OpenAlexW2137507690MaRDI QIDQ3399191FDOQ3399191
Authors: E. B. Fokina, S. Quinn, John Chisholm, S. S. Goncharov, Valentina Harizanov, J. F. Knight 
Publication date: 29 September 2009
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1245158098
Recommendations
- Preserving categoricity and complexity of relations
- Isomorphisms, definable relations, and Scott families for integral domains and commutative semigroups
- Enumerations in computable structure theory
- Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
- A directed graph of finite \(\Delta^0_{\alpha}\)-dimension
- On a question of Kalimullin
- The complexity of computable categoricity
- Isomorphisms and definable relations on rings and lattices
- Computability-theoretic categoricity and Scott families
- scientific article; zbMATH DE number 1873435
Categoricity and completeness of theories (03C35) Computable structure theory, computable model theory (03C57)
Cites Work
- Title not available (Why is that?)
- 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
Cited In (22)
- Isomorphisms, definable relations, and Scott families for integral domains and commutative semigroups
- Enumerations in computable structure theory
- Title not available (Why is that?)
- Computability-theoretic categoricity and Scott families
- Isomorphisms and definable relations on rings and lattices
- Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
- Categoricity spectra of computable structures
- Notes on the Jump of a Structure
- Logical Approaches to Computational Barriers
- Preserving categoricity and complexity of relations
- Limit complexities revisited
- Effective categoricity of abelian \(p\)-groups
- A Note on Effective Categoricity for Linear Orderings
- The complexity of computable categoricity
- A computably stable structure with no Scott family of finitary formulas
- Degrees of autostability relative to strong constructivizations
- Degrees of bi-embeddable categoricity
- 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
- Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism
- Categoricity and complexity of relations over algebraic structures
- A directed graph of finite \(\Delta^0_{\alpha}\)-dimension
- Degrees of categoricity for superatomic Boolean algebras
Uses Software
This page was built for publication: Intrinsic bounds on complexity and definability at limit levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399191)
