Computability-Theoretic Complexity of Countable Structures
From MaRDI portal
Recommendations
- Enumerations in computable structure theory
- scientific article; zbMATH DE number 2047478
- On computably enumerable structures
- Complexity classes defined by counting quantifiers
- Enumeration reducibility and computable structure theory
- Enumerations, countable structures and Turing degrees
- Computable structures and the hyperarithmetical hierarchy
- Computability theoretic classifications for classes of structures
- scientific article; zbMATH DE number 1344955
- On the complexity of categoricity in computable structures
Cited in
(17)- Spaces of orders and their Turing degree spectra
- Nonmaximal decidable structures
- New Computational Paradigms
- Complexity ranks of countable models
- Enumeration reducibility and computable structure theory
- Computable structures and the hyperarithmetical hierarchy
- Computability and computable models
- Countable Lawvere theories and computational effects
- The complexity types of computable sets
- Weakly maximal decidable structures
- Turing degrees of nonabelian groups
- Isomorphisms and definable relations on computable models
- Some results on \(\mathbb{R}\)-computable structures
- Degrees of isomorphism types and countably categorical groups
- Principal numerations of functionals on admissible sets
- SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
- Computability theoretic classifications for classes of structures
This page was built for publication: Computability-Theoretic Complexity of Countable Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4432545)
