Problem of the number of non-self-equivalent constructivizations

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)

Cites Work

Title not available (Why is that?)

Cited In (34)

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
Computable Heyting algebras with distinguished atoms and coatoms
Effective categoricity for distributive lattices and Heyting algebras
Decidable categoricity spectra for almost prime models
Index Sets of Constructive Models that are Autostable Under Strong Constructivizations
Constructing decidable graphs from decidable structures
Some applications of computable one-one numberings
Abelian \(p\)-groups and the halting problem
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
UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES
0″-Categorical Completely Decomposable Torsion-Free Abelian Groups
Stability of representations of effective partial algebras
Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
Degrees of categoricity and treeable degrees
Boolean Algebras with Distinguished Endomorphisms and Generating Trees
On decidable categoricity and almost prime models
\(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations
A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
\(\Sigma\)-presentations of the ordering on the reals
Positive enumerable functors
The possible Turing degree of the nonzero member in a two element degree spectrum
Computable categoricity of trees of finite height
Index sets of autostable relative to strong constructivizations constructive models for familiar classes
Degrees of categoricity of computable structures
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)