MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES

DOI10.1017/jsl.2022.15OpenAlexW3156328138MaRDI QIDQ5052004

Zlatan Damnjanovic

Publication date: 18 November 2022

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.07202

zbMATH Keywords

stringsinterpretabilityRobinson arithmeticessential undecidabilityfull binary treesconcatenation theory

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Relative consistency and interpretations (03F25)

Related Items (3)

MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES ⋮ TREE THEORY: INTERPRETABILITY BETWEEN WEAK FIRST-ORDER THEORIES OF TREES ⋮ Weak sequential theories of finite full binary trees

Cites Work

• Unnamed Item
• 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
• On interpretability between some weak essentially undecidable theories
• Undecidable theories
• Interpretability in Robinson's Q
• MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY
• MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
• Concatenation as a basis for arithmetic

This page was built for publication: MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES