Problem of the number of non-self-equivalent constructivizations
From MaRDI portal
Publication:1159633
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)- Positive enumerable functors
- Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
- Uniform procedures in uncountable structures
- Computable categoricity of trees of finite height
- Degrees of categoricity and treeable degrees
- The possible Turing degree of the nonzero member in a two element degree spectrum
- Degrees of categoricity of computable structures
- A local version of the Slaman-Wehner theorem and families closed under finite differences
- Turing degrees of complete formulas of almost prime models
- Degree spectra of intrinsically c. e. relations
- Stability of representations of effective partial algebras
- Constructing decidable graphs from decidable structures
- Complexity of the problem of being equivalent to Horn formulas
- Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
- Computable Heyting algebras with distinguished atoms and coatoms
- Some applications of computable one-one numberings
- \(\Sigma\)-presentations of the ordering on the reals
- Friedberg numberings in the Ershov hierarchy
- \(\mathbf 0\)-categorical completely decomposable torsion-free abelian groups
- Some Questions in Computable Mathematics
- Boolean algebras with distinguished endomorphisms and generating trees
- Finite computable dimension and degrees of categoricity
- Automatic presentations of structures
- Effective categoricity for distributive lattices and Heyting algebras
- Index sets of autostable relative to strong constructivizations constructive models for familiar classes
- On decidable categoricity and almost prime models
- Abelian \(p\)-groups and the halting problem
- Decidable categoricity spectra for almost prime models
- Degree spectra of relations on structures of finite computable dimension
- Index sets of constructive models that are autostable under strong constructivizations
- A computable functor from graphs to fields
- Degree spectra and computable dimensions in algebraic structures
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Degree Spectra of Relations on Computable Structures
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)
