UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
From MaRDI portal
Recommendations
- Undecidability in Some Structures Related to Computation Theory
- scientific article; zbMATH DE number 1160644
- Hereditary undecidability of some theories of finite structures
- Undecidability and intuitionistic incompleteness
- scientific article; zbMATH DE number 4074492
- Computability theoretic classifications for classes of structures
- Publication:4952569
- scientific article; zbMATH DE number 937378
- Undecidability of elementary theories of Rogers semilattices of analytical hierarchies
- The undecidability of the semi-unification problem
Cited in
(12)- Undecidability in Some Structures Related to Computation Theory
- Undecidability of the structure of the Solovay degrees of c.e. reals
- Undecidable hypotheses in Edward Nelson's internal set theory
- On the theory of computably enumerable linear preorders with concatenation
- Undecidable fragments of elementary theories
- scientific article; zbMATH DE number 2236644 (Why is no real title available?)
- Definability in first order theories of graph orderings
- Undefinable Classes and Definable Elements in Models of Set Theory and Arithmetic
- The unification hierarchy is undecidable
- scientific article; zbMATH DE number 3880676 (Why is no real title available?)
- scientific article; zbMATH DE number 937378 (Why is no real title available?)
- Hereditary undecidability of some theories of finite structures
This page was built for publication: UNDECIDABILITY OF THE THEORIES OF CLASSES OF STRUCTURES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177872)