Problem of the number of non-self-equivalent constructivizations
From MaRDI portal
Publication:1159633
DOI10.1007/BF01669323zbMath0476.03046OpenAlexW2327605742MaRDI QIDQ1159633
Publication date: 1981
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/187109
Partial orders, general (06A06) Special categories (18B99) Recursive equivalence types of sets and structures, isols (03D50) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of denumerable and separable structures (03C15)
Related Items (32)
Degree spectra and computable dimensions in algebraic structures ⋮ Degree spectra of relations on structures of finite computable dimension ⋮ Finite computable dimension and degrees of categoricity ⋮ Abelian \(p\)-groups and the halting problem ⋮ Complexity of the problem of being equivalent to Horn formulas ⋮ Degrees of categoricity of computable structures ⋮ Effective categoricity for distributive lattices and Heyting algebras ⋮ UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES ⋮ Automatic presentations of structures ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ A local version of the Slaman-Wehner theorem and families closed under finite differences ⋮ Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations ⋮ Index sets of autostable relative to strong constructivizations constructive models for familiar classes ⋮ On decidable categoricity and almost prime models ⋮ Some Questions in Computable Mathematics ⋮ Stability of representations of effective partial algebras ⋮ Index sets of constructive models of nontrivial signature autostable relative to strong constructivizations ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Degree spectra of intrinsically c.e. relations ⋮ 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups ⋮ The possible Turing degree of the nonzero member in a two element degree spectrum ⋮ Friedberg numberings in the Ershov hierarchy ⋮ Index Sets of Constructive Models that are Autostable Under Strong Constructivizations ⋮ Boolean Algebras with Distinguished Endomorphisms and Generating Trees ⋮ Computable categoricity of trees of finite height ⋮ Turing degrees of complete formulas of almost prime models ⋮ Constructing decidable graphs from decidable structures ⋮ Some applications of computable one-one numberings ⋮ \(\Sigma\)-presentations of the ordering on the reals ⋮ \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings ⋮ Degree Spectra of Relations on Computable Structures ⋮ Positive enumerable functors
Cites Work
This page was built for publication: Problem of the number of non-self-equivalent constructivizations
