Categoricity spectra of computable structures
From MaRDI portal
Recommendations
- Degrees of categoricity of computable structures
- On the complexity of categoricity in computable structures
- Computability and categoricity of ultrahomogeneous structures
- Computability and categoricity of weakly ultrahomogeneous structures
- Computably categorical structures and expansions by constants
- Computable categoricity and the Ershov hierarchy
- The complexity of computable categoricity
- Categoricity of computable infinitary theories
- Computability-theoretic categoricity and Scott families
- Categoricity properties for computable algebraic fields
Cites work
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- d-computable categoricity for algebraic fields
- A computable functor from graphs to fields
- A note on effective categoricity for linear orderings
- Abelian p-groups and the halting problem
- An autostable 1-decidable model without a computable Scott family of -formulas
- Autostability and computable families of constructivizations
- Autostability of models
- Autostability of models and Abelian groups
- Autostability spectra for Boolean algebras
- Categoricity in hyperarithmetical degrees
- Categoricity properties for computable algebraic fields
- Categoricity spectra for polymodal algebras
- Categoricity spectra for rigid structures
- Classification from a Computable Viewpoint
- Computability and computable models
- Computability theoretic classifications for classes of structures
- Computability-theoretic categoricity and Scott families
- Computability-theoretic properties of injection structures
- Computable abelian groups
- Computable categoricity for algebraic fields with splitting algorithms
- Computable categoricity of trees of finite height
- Computable categoricity versus relative computable categoricity
- Computable completely decomposable groups
- Computable dimension for ordered fields
- Computable isomorphisms of Boolean algebras with operators
- Computable structures and the hyperarithmetical hierarchy
- Computable torsion abelian groups
- Computably categorical Boolean algebras enriched by ideals and atoms
- Computably categorical fields via Fermat's last theorem
- CONSTRUCTIVE ALGEBRAS I
- Degree spectra and computable dimensions in algebraic structures
- Degree spectra of relations on a cone
- Degrees of autostability for linear orders and linearly ordered abelian groups
- Degrees of autostability relative to strong constructivizations
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of categoricity for superatomic Boolean algebras
- Degrees of categoricity of computable structures
- Degrees of categoricity of rigid structures
- Degrees of categoricity on a cone via -systems
- Degrees of categoricity vs. strong degrees of categoricity
- Degrees that Are Low for Isomorphism
- Degrees that are not degrees of categoricity
- Effective categoricity for distributive lattices and Heyting algebras
- Effective categoricity of abelian p-groups
- Effective categoricity of computable linear orderings
- Effective categoricity of equivalence structures
- Effective content of field theory
- Effective model theory vs. recursive model theory
- Effective procedures in field theory
- Effectively categorical abelian groups
- Enumerations in computable structure theory
- Finite computable dimension and degrees of categoricity
- Freely generated projective planes with finite computable dimension
- Generic copies of countable structures
- scientific article; zbMATH DE number 1002913 (Why is no real title available?)
- scientific article; zbMATH DE number 3863176 (Why is no real title available?)
- scientific article; zbMATH DE number 3767640 (Why is no real title available?)
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1302870 (Why is no real title available?)
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- scientific article; zbMATH DE number 1873435 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3214535 (Why is no real title available?)
- scientific article; zbMATH DE number 3250559 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes
- Index sets of constructive models of bounded signature that are autostable relative to strong constructivizations
- Index sets of constructive models of finite and graph signatures that are autostable relative to strong constructivizations
- Intrinsic bounds on complexity and definability at limit levels
- Isomorphisms and algorithmic properties of structures with two equivalences
- Lowness for isomorphism and degrees of genericity
- Model theory
- Pairs of recursive structures
- Prime model with no degree of autostability relative to strong constructivizations
- Recursive isomorphism types of recursive Boolean algebras
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Recursively Categorical Linear Orderings
- Stability of recursive structures in arithmetical degrees
- Strong and weak constructivization and computable families
- The complexity of computable categoricity
- The computable dimension of ordered abelian groups
- The computable dimension of trees of infinite height
- The index set of Boolean algebras autostable relative to strong constructivizations
- The index set of linear orderings that are autostable relative to strong constructivizations
- The index set of the groups autostable relative to strong constructivizations
- The quantity of nonautoequivalent constructivizations
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
- Torsion-free abelian groups with optimal Scott families
- Turing computability. Theory and applications
- Turing's legacy. Developments from Turing's ideas in logic
Cited in
(17)- Finite computable dimension and degrees of categoricity
- Computability-theoretic categoricity and Scott families
- Effective algebraicity
- Simple structures with complex symmetry
- The categoricity spectrum of large abstract elementary classes
- A Note on the Computable Categoricity of \ell ^p ℓ p Spaces
- Computable categoricity of trees of finite height
- scientific article; zbMATH DE number 1048041 (Why is no real title available?)
- Computability and categoricity of weakly ultrahomogeneous structures
- scientific article; zbMATH DE number 1873435 (Why is no real title available?)
- Coding in the automorphism group of a computably categorical structure
- Computability and categoricity of ultrahomogeneous structures
- Computable categoricity for algebraic fields with splitting algorithms
- Computable Heyting algebras with distinguished atoms and coatoms
- On a computability-theoretic approach to Boolean-valued models
- On computability-theoretic universality of Boolean-valued models
- On categoricity spectra for locally finite graphs
This page was built for publication: Categoricity spectra of computable structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2036466)
