There is no classification of the decidably presentable structures
From MaRDI portal
Publication:4562439
DOI10.1142/S0219061318500101OpenAlexW2964002528MaRDI QIDQ4562439
Publication date: 20 December 2018
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.06587
Related Items (6)
Complexity of \(\Sigma^0_n\)-classifications for definable subsets ⋮ Finitely generated groups are universal among finitely generated structures ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Model completeness and relative decidability ⋮ Constructing decidable graphs from decidable structures ⋮ The degree of decidable categoricity of a model with infinite solutions for complete formulas
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computable categoricity
- The isomorphism problem for torsion-free abelian groups is analytic complete
- Generic copies of countable structures
- Enumerations of families of general recursive functions
- Degree spectra and computable dimensions in algebraic structures
- DECIDABLE MODELS OF ω-STABLE THEORIES
- A Borel reductibility theory for classes of countable structures
- On the orbits of computably enumerable sets
- Non Σn axiomatizable almost strongly minimal theories
- A construction for recursive linear orderings
- Computability Theory and Its Applications
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- Index sets for classes of high rank structures
- Recursive Pseudo-Well-Orderings
- Effective model theory vs. recursive model theory
- An undecidable linear order that is \(n\)-decidable for all \(n\)
This page was built for publication: There is no classification of the decidably presentable structures