Intrinsic bounds on complexity and definability at limit levels
From MaRDI portal
Publication:3399191
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
Cites work
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A construction for recursive linear orderings
- A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings
- Computable structures and the hyperarithmetical hierarchy
- Enumerations in computable structure theory
- Generic copies of countable structures
- Intrinsically Hyperarithmetical Sets
Cited in
(24)- Categoricity and complexity of relations over algebraic structures
- Isomorphisms, definable relations, and Scott families for integral domains and commutative semigroups
- Enumerations in computable structure theory
- scientific article; zbMATH DE number 2047487 (Why is no real title available?)
- Computability-theoretic categoricity and Scott families
- Isomorphisms and definable relations on rings and lattices
- Categoricity spectra of computable structures
- A note on effective categoricity for linear orderings
- Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
- Notes on the Jump of a Structure
- Categorical linearly ordered structures
- Preserving categoricity and complexity of relations
- Logical Approaches to Computational Barriers
- Limit complexities revisited
- Effective categoricity of abelian p-groups
- The complexity of computable categoricity
- On a question of Kalimullin
- A computably stable structure with no Scott family of finitary formulas
- Degrees of autostability relative to strong constructivizations
- Degrees of bi-embeddable categoricity
- Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism
- 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms
- A directed graph of finite \(\Delta^0_{\alpha}\)-dimension
- Degrees of categoricity for superatomic Boolean algebras
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)
