Computability theoretic classifications for classes of structures
From MaRDI portal
Recommendations
Cited in
(28)- Computable structures and the hyperarithmetical hierarchy
- Jump inversions of algebraic structures and the \({\Sigma}\)-definability
- Degree spectra of real closed fields
- Computability of distributive lattices
- Finitely generated groups are universal among finitely generated structures
- A note on computable distinguishing colorings
- Categoricity spectra of computable structures
- Model completeness and relative decidability
- Computable analysis and classification problems
- HKSS-completeness of modal algebras
- Constructing decidable graphs from decidable structures
- Classifications of definable subsets
- On functors enumerating structures
- Equivalence Relations on Classes of Computable Structures
- Structural properties for feasibly computable classes of type two
- scientific article; zbMATH DE number 1984268 (Why is no real title available?)
- Computability-Theoretic Complexity of Countable Structures
- scientific article; zbMATH DE number 2047478 (Why is no real title available?)
- A computable functor from graphs to fields
- BOREL FUNCTORS AND INFINITARY INTERPRETATIONS
- The tree of tuples of a structure
- Jump inversions of algebraic structures and Σ‐definability
- UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
- Turing-Complete Subclasses of CHR
- Computable functors and effective interpretability
- Point Degree Spectra of Represented Spaces
- Computable Heyting algebras with distinguished atoms and coatoms
- On computability-theoretic universality of Boolean-valued models
This page was built for publication: Computability theoretic classifications for classes of structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371227)
