The quantity of nonautoequivalent constructivizations
From MaRDI portal
Cites work
Cited in
(22)- Degree spectra and computable dimensions in algebraic structures
- Enumerations in computable structure theory
- On the effective universality of mereological theories
- Computability-theoretic categoricity and Scott families
- A computable functor from graphs to fields
- Categoricity spectra of computable structures
- A note on effective categoricity for linear orderings
- Ash's theorem on \(\Delta_{\alpha}^{0}\)-categorical structures and a condition for infinite \(\Delta_{\alpha}^{0}\)-dimension
- Effective model theory vs. recursive model theory
- Constructing decidable graphs from decidable structures
- Π11 relations and paths through
- Degree Spectra of Relations on Computable Structures
- Preserving categoricity and complexity of relations
- Effective categoricity of abelian p-groups
- A computably stable structure with no Scott family of finitary formulas
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
- Categoricity in hyperarithmetical degrees
- Positive numerations of families with one-valued numerations
- Stability among r.e. quotient algebras
- Effective categoricity of equivalence structures
- Strong \(\Delta ^ 0_ 2\) categoricity
- The Complexity of intrinsically r.e. subsets of existentially decidable models
This page was built for publication: The quantity of nonautoequivalent constructivizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1257890)
