Undecidability in Some Structures Related to Computation Theory
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1160644
- Undecidability and intuitionistic incompleteness
- UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
- Computation over algebraic structures and a classification of undecidable problems
- scientific article; zbMATH DE number 1512704
- Undecidability, incompleteness and Arnol'd problems
- scientific article; zbMATH DE number 572102
- Generic Complexity of Undecidable Problems
- Generic complexity of undecidable problems
- Undecidability in Weihrauch degrees
Cited in
(24)- On the Wadge reducibility of \(k\)-partitions
- An undecidable fragment of the theory of set constraints
- Undecidable goals for completed acyclic programs
- A codicity undecidable problem in the plane.
- Elementary theories and hereditary undecidability for semilattices of numberings
- Undecidability and intuitionistic incompleteness
- Undecidable fragments of elementary theories
- Undecidability of elementary theories of Rogers semilattices of analytical hierarchies
- scientific article; zbMATH DE number 3875248 (Why is no real title available?)
- Undecidability over Continuous Time
- Undecidability in Weihrauch degrees
- scientific article; zbMATH DE number 4031659 (Why is no real title available?)
- scientific article; zbMATH DE number 4033715 (Why is no real title available?)
- scientific article; zbMATH DE number 1302671 (Why is no real title available?)
- scientific article; zbMATH DE number 512805 (Why is no real title available?)
- Hereditary undecidability of some theories of finite structures
- scientific article; zbMATH DE number 2123258 (Why is no real title available?)
- scientific article; zbMATH DE number 937378 (Why is no real title available?)
- UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
- A Useful Undecidable Theory
- Grid structures and undecidable constraint theories
- On the main scientific achievements of Victor Selivanov
- On the strongly generic undecidability of the halting problem
- Fine hierarchies and m-reducibilities in theoretical computer science
This page was built for publication: Undecidability in Some Structures Related to Computation Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611729)