An undecidable linear order that is \(n\)-decidable for all \(n\)
From MaRDI portal
Publication:5937834
DOI10.1305/ndjfl/1039118866zbMath0966.03043MaRDI QIDQ5937834
Michael Moses, J. S. Roy Chisholm
Publication date: 17 July 2001
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1039118866
03D35: Undecidability and degrees of sets of sentences
03B25: Decidability of theories and sets of sentences
06A05: Total orders
03D45: Theory of numerations, effectively presented structures
Related Items
There is no classification of the decidably presentable structures, Sequences of n-diagrams, On the complexity of the theory of a computably presented metric structure
Cites Work