Problem of the number of non-self-equivalent constructivizations
From MaRDI portal
Partial orders, general (06A06) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Special categories (18B99) Model theory of denumerable and separable structures (03C15) Recursive equivalence types of sets and structures, isols (03D50)
Cited in
(34)- Uniform procedures in uncountable structures
- Degree spectra and computable dimensions in algebraic structures
- Automatic presentations of structures
- Some Questions in Computable Mathematics
- Finite computable dimension and degrees of categoricity
- A local version of the Slaman-Wehner theorem and families closed under finite differences
- Complexity of the problem of being equivalent to Horn formulas
- \(\mathbf 0\)-categorical completely decomposable torsion-free abelian groups
- A computable functor from graphs to fields
- Effective categoricity for distributive lattices and Heyting algebras
- Computable Heyting algebras with distinguished atoms and coatoms
- Decidable categoricity spectra for almost prime models
- Some applications of computable one-one numberings
- Abelian p-groups and the halting problem
- Constructing decidable graphs from decidable structures
- Degree Spectra of Relations on Computable Structures
- Friedberg numberings in the Ershov hierarchy
- Degree spectra of intrinsically c. e. relations
- Degree spectra of relations on structures of finite computable dimension
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
- Index sets of constructive models that are autostable under strong constructivizations
- Stability of representations of effective partial algebras
- On decidable categoricity and almost prime models
- Degrees of categoricity and treeable degrees
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
- \(\Sigma\)-presentations of the ordering on the reals
- The possible Turing degree of the nonzero member in a two element degree spectrum
- Positive enumerable functors
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes
- Computable categoricity of trees of finite height
- Degrees of categoricity of computable structures
- Boolean algebras with distinguished endomorphisms and generating trees
- Turing degrees of complete formulas of almost prime models
This page was built for publication: Problem of the number of non-self-equivalent constructivizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159633)
