On interpretability between some weak essentially undecidable theories
From MaRDI portal
Publication:2106592
Recommendations
Cites work
- scientific article; zbMATH DE number 5295812 (Why is no real title available?)
- An interpretation of Robinson arithmetic in its Grzegorczyk's weaker variant
- Finding the limit of incompleteness. I
- First-order concatenation theory with bounded quantifiers
- Growing commas. A study of sequentiality and concatenation
- Mutual interpretability of Robinson arithmetic and adjunctive set theory with extensionality
- Recursive functions and existentially closed structures
- Undecidable theories
- Variants of Robinson's essentially undecidable theoryR
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
- Why the theory R is special
Cited in
(9)- Weak essentially undecidable theories of concatenation
- Interpretability degrees of finitely axiomatized sequential theories
- BI-INTERPRETATION IN WEAK SET THEORIES
- Weak sequential theories of finite full binary trees
- A weak theory of building blocks
- TREE THEORY: INTERPRETABILITY BETWEEN WEAK FIRST-ORDER THEORIES OF TREES
- MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
- scientific article; zbMATH DE number 5233159 (Why is no real title available?)
This page was built for publication: On interpretability between some weak essentially undecidable theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106592)