Categoricity spectra of computable structures
From MaRDI portal
Publication:2036466
DOI10.1007/s10958-021-05419-xzbMath1485.03105OpenAlexW3166711364MaRDI QIDQ2036466
Publication date: 29 June 2021
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-021-05419-x
Boolean algebraindex setcategoricity spectrumcomputable structuredegree of categoricitylinear orderautostabilitycomputable categoricityautostability relative to strong constructivizationsdecidable categoricity
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items
On categoricity spectra for locally finite graphs ⋮ Computable Heyting algebras with distinguished atoms and coatoms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
- Computable dimension for ordered fields
- Abelian \(p\)-groups and the halting problem
- Degrees that are not degrees of categoricity
- Isomorphisms and algorithmic properties of structures with two equivalences
- The complexity of computable categoricity
- The index set of Boolean algebras autostable relative to strong constructivizations
- Categoricity spectra for polymodal algebras
- Computable isomorphisms of Boolean algebras with operators
- Computably categorical Boolean algebras enriched by ideals and atoms
- Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes
- Pairs of recursive structures
- Effective categoricity of abelian \(p\)-groups
- Stability of recursive structures in arithmetical degrees
- Generic copies of countable structures
- Autostability of models and Abelian groups
- Autostability of models
- Strong and weak constructivization and computable families
- Autostability and computable families of constructivizations
- The quantity of nonautoequivalent constructivizations
- Model theory
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- Finite computable dimension and degrees of categoricity
- Computable torsion abelian groups
- Computability-theoretic categoricity and Scott families
- Categoricity in hyperarithmetical degrees
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- The computable dimension of ordered abelian groups
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of categoricity of rigid structures
- Computability-theoretic properties of injection structures
- Autostability spectra for Boolean algebras
- The index set of the groups autostable relative to strong constructivizations
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- Degrees of categoricity vs. strong degrees of categoricity
- Degrees of autostability for linear orders and linearly ordered abelian groups
- Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
- Effectively categorical abelian groups
- Freely generated projective planes with finite computable dimension
- Effective categoricity for distributive lattices and Heyting algebras
- Degrees of categoricity for superatomic Boolean algebras
- Effective categoricity of equivalence structures
- Degrees of autostability relative to strong constructivizations
- Enumerations in computable structure theory
- Degrees of categoricity of computable structures
- COMPUTABLE ABELIAN GROUPS
- Turing's Legacy
- Computably Categorical Fields via Fermat’s Last Theorem
- Turing Computability
- A Note on Effective Categoricity for Linear Orderings
- Computable completely decomposable groups
- Prime Model with No Degree of Autostability Relative to Strong Constructivizations
- Effective procedures in field theory
- Recursive isomorphism types of recursive Boolean algebras
- The computable dimension of trees of infinite height
- Computable categoricity of trees of finite height
- Intrinsic bounds on complexity and definability at limit levels
- Classification from a Computable Viewpoint
- d-computable categoricity for algebraic fields
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Effective content of field theory
- Recursively Categorical Linear Orderings
- Torsion-free abelian groups with optimal Scott families
- Lowness for isomorphism and degrees of genericity
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- Degree Spectra of Relations on a Cone
- Computable categoricity versus relative computable categoricity
- Degrees that Are Low for Isomorphism
- Computable categoricity for algebraic fields with splitting algorithms
- Categoricity properties for computable algebraic fields
- CONSTRUCTIVE ALGEBRAS I
- DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
- Effective model theory vs. recursive model theory
- Categoricity spectra for rigid structures
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
- Effective categoricity of computable linear orderings
