There is no classification of the decidably presentable structures

DOI10.1142/S0219061318500101MaRDI QIDQ4562439zbMATH OpenOpenAlexFDO

Authors Matthew Harrison-Trainor

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

zbMATH Keywords

computable structure theorydecidable structuresindex sets

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations
• scientific article; zbMATH DE number 5379427
• A note on decidable categoricity and index sets
• Index sets for some classes of structures
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

Cites work

• A Borel reductibility theory for classes of countable structures
• A computable functor from graphs to fields
• A construction for recursive linear orderings
• An undecidable linear order that is \(n\)-decidable for all \(n\)
• Computability Theory and Its Applications
• Decidable models of -stable theories
• Degree spectra and computable dimensions in algebraic structures
• Effective model theory vs. recursive model theory
• Enumerations of families of general recursive functions
• Generic copies of countable structures
• scientific article; zbMATH DE number 5379427 (Why is no real title available?)
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 5175704 (Why is no real title available?)
• Index sets for classes of high rank structures
• Non Σ_n axiomatizable almost strongly minimal theories
• On the orbits of computably enumerable sets
• Recursive Pseudo-Well-Orderings
• The complexity of computable categoricity
• The index set of linear orderings that are autostable relative to strong constructivizations
• The isomorphism problem for torsion-free abelian groups is analytic complete

Cited in

(7)

• Finitely generated groups are universal among finitely generated structures
• Model completeness and relative decidability
• The degree of decidable categoricity of a model with infinite solutions for complete formulas
• Constructing decidable graphs from decidable structures
• Complexity of \(\Sigma^0_n\)-classifications for definable subsets
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• A pathological punctually 1-decidable structure

This page was built for publication: There is no classification of the decidably presentable structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4562439)