On interpretability between some weak essentially undecidable theories
From MaRDI portal
Publication:2106592
DOI10.1007/978-3-030-51466-2_6MaRDI QIDQ2106592
Juvenal Murwanashyaka, Lars Kristiansen
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_6
68Qxx: Theory of computing
Related Items
MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES, TREE THEORY: INTERPRETABILITY BETWEEN WEAK FIRST-ORDER THEORIES OF TREES, Weak essentially undecidable theories of concatenation, Weak sequential theories of finite full binary trees
Cites Work
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
- Growing commas. A study of sequentiality and concatenation
- First-order concatenation theory with bounded quantifiers
- Undecidable theories
- MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY
- Variants of Robinson's essentially undecidable theoryR
- FINDING THE LIMIT OF INCOMPLETENESS I
- Recursive functions and existentially closed structures
- Unnamed Item
- Unnamed Item
- Unnamed Item