MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
@article{Damnjanovic2021MUTUALIO,
title={MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES},
author={Zlatan Damnjanovic},
journal={The Journal of Symbolic Logic},
year={2021},
volume={87},
pages={1374 - 1395}
}Abstract Kristiansen and Murwanashyaka recently proved that Robinson arithmetic, Q, is interpretable in an elementary theory of full binary trees, T. We prove that, conversely, T is interpretable in Q by producing a formal interpretation of T in an elementary concatenation theory QT+, thereby also establishing mutual interpretability of T with several well-known weak essentially undecidable theories of numbers, strings, and sets. We also introduce a “hybrid” elementary theory of strings and…
2 Citations
Symmetric relations, symmetric theories, and Pythagrapheanism
- PhilosophyPhilosophy and Phenomenological Research
- 2022
. It is a metaphysical orthodoxy that interesting non-symmetric relations cannot be reduced to symmetric ones. This orthodoxy is wrong. I show this by exploring the expressive power of symmetric…
A Universal Algebraic Set Theory Built on Mereology with Applications
- MathematicsLogica Universalis
- 2022
Category theory is often treated as an algebraic foundation for mathematics, and the widely known algebraization of ZF set theory in terms of this discipline is referenced as “categorical set theory”…
References
SHOWING 1-10 OF 32 REFERENCES
MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY
- Computer Science, PhilosophyThe Bulletin of Symbolic Logic
- 2017
Abstract An elementary theory of concatenation, QT +, is introduced and used to establish mutual interpretability of Robinson arithmetic, Minimal Predicative Set Theory, quantifier-free part of…
Interpretability in Robinson's Q
- PhilosophyThe Bulletin of Symbolic Logic
- 2013
Edward Nelson published in 1986 a book defending an extreme formalist view of mathematics according to which there is an impassable barrier in the totality of exponentiation, and some very nice logical investigations and results were produced.
Concatenation as a basis for arithmetic
- Computer ScienceJournal of Symbolic Logic
- 1946
General syntax, the formal part of the general theory of signs, has as its basic operation the operation of concatenation, expressed by the connective ‘⌢’ and understood as follows : where x and y…
Weak theories of concatenation and minimal essentially undecidable theories
- MathematicsArch. Math. Log.
- 2014
It is proved that the theory of concatenation WTC-ε, which is a weak subtheory of Grzegorczyk’s theory, is a minimal essentially undecidable theory, and that if one omits an axiom scheme from the theory, then the resulting theory is no longer essentially Undecidable.
Growing Commas. A Study of Sequentiality and Concatenation
- Computer ScienceNotre Dame J. Formal Log.
- 2009
It is shown that TC does not define pairing, and a reasonable extension of TC is determined that is sequential, i.e., has a good sequence coding.
On Interpretability Between Some Weak Essentially Undecidable Theories
- Materials ScienceCiE
- 2020
It is proved that Robinson’s \documentclass[12pt]{minimal} is mutually interpretable with Robinson”s \usepackage{amsmath} \use package{wasysym} £7.5m term model.