The quantity of nonautoequivalent constructivizations
From MaRDI portal
Publication:1257890
DOI10.1007/BF01669456zbMath0407.03040OpenAlexW2044797614MaRDI QIDQ1257890
Publication date: 1978
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01669456
Model theory (03C99) Other constructive mathematics (03F65) Computability and recursion theory (03D99)
Related Items
Degree spectra and computable dimensions in algebraic structures ⋮ Strong \(\Delta ^ 0_ 2\) categoricity ⋮ Π11 relations and paths through ⋮ Preserving categoricity and complexity of relations ⋮ On the effective universality of mereological theories ⋮ A Note on Effective Categoricity for Linear Orderings ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Computability-theoretic categoricity and Scott families ⋮ Stability among r.e. quotient algebras ⋮ Effective model theory vs. recursive model theory ⋮ The Complexity of intrinsically r.e. subsets of existentially decidable models ⋮ Effective categoricity of equivalence structures ⋮ A computably stable structure with no Scott family of finitary formulas ⋮ Categoricity spectra of computable structures ⋮ Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension ⋮ Constructing decidable graphs from decidable structures ⋮ Effective categoricity of abelian \(p\)-groups ⋮ Categoricity in hyperarithmetical degrees ⋮ Enumerations in computable structure theory ⋮ Positive numerations of families with one-valued numerations ⋮ \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings ⋮ Degree Spectra of Relations on Computable Structures
Cites Work
