MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES

DOI10.1017/JSL.2022.15OpenAlexW3156328138MaRDI QIDQ5052004FDOQ5052004

Authors: Zlatan Damnjanovic 

Publication date: 18 November 2022

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

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

zbMATH Keywords

interpretabilitystringsRobinson arithmeticessential undecidabilityconcatenation theoryfull binary trees

Mathematics Subject Classification ID

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

Cites Work

• Undecidable theories
• Growing commas. A study of sequentiality and concatenation
• Concatenation as a basis for arithmetic
• On interpretability between some weak essentially undecidable theories
• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• Title not available (Why is that?)
• Interpretability in Robinson's Q
• MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY
• MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES

Cited In (6)

• 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
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5052004)