A Useful Undecidable Theory

DOI10.1007/978-3-540-73001-9_73MaRDI QIDQ5425373zbMATH OpenOpenAlexFDO

Authors Victor Selivanov

Publication date 13 November 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73001-9_73

zbMATH Keywords

discrete weak semilatticepartitionreducibilityundecidability

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Undecidability in Some Structures Related to Computation Theory
• Elementary theories and hereditary undecidability for semilattices of numberings
• Undecidability of elementary theories of Rogers semilattices of analytical hierarchies
• scientific article; zbMATH DE number 535104
• The theory of the recursively enumerable weak truth-table degrees is undecidable

Cited in

(7)

• Elementary theories and hereditary undecidability for semilattices of numberings
• Undecidability of elementary theories of Rogers semilattices of analytical hierarchies
• Undecidability in Weihrauch degrees
• On the Wadge reducibility of \(k\)-partitions
• scientific article; zbMATH DE number 5233159 (Why is no real title available?)
• On the main scientific achievements of Victor Selivanov
• Fine hierarchies and m-reducibilities in theoretical computer science

This page was built for publication: A Useful Undecidable Theory

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