Bulletin of Symbolic Logic 23 (4):381-404 (2017)

Authors
Zlatan Damnjanovic
University of Southern California
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 Kirby’s finitary set theory, and Adjunctive Set Theory, with or without extensionality. The most basic arithmetic and simplest set theory thus turn out to be variants of string theory.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/bsl.2017.30
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 60,044
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Undecidability Without Arithmetization.Andrzej Grzegorczyk - 2005 - Studia Logica 79 (2):163-230.
Concatenation as a Basis for Arithmetic.W. V. Quine - 1946 - Journal of Symbolic Logic 11 (4):105-114.
Cardinal Arithmetic in the Style of Baron Von Münchhausen.Albert Visser - 2009 - Review of Symbolic Logic 2 (3):570-589.
Growing Commas. A Study of Sequentiality and Concatenation.Albert Visser - 2009 - Notre Dame Journal of Formal Logic 50 (1):61-85.
Pairs, Sets and Sequences in First-Order Theories.Albert Visser - 2008 - Archive for Mathematical Logic 47 (4):299-326.

View all 13 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

On the Axiom of Extensionality in the Positive Set Theory.Olivier Esser - 2003 - Mathematical Logic Quarterly 49 (1):97-100.
On Interpretability in the Theory of Concatenation.Vítězslav Švejdar - 2009 - Notre Dame Journal of Formal Logic 50 (1):87-95.
Interpretability Over Peano Arithmetic.Claes Strannegard - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Interpretability Over Peano Arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Minimal Truth and Interpretability.Martin Fischer - 2009 - Review of Symbolic Logic 2 (4):799-815.
Weak Theories of Concatenation and Arithmetic.Yoshihiro Horihata - 2012 - Notre Dame Journal of Formal Logic 53 (2):203-222.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
The Interpretability Logic of Peano Arithmetic.Alessandro Berarducci - 1990 - Journal of Symbolic Logic 55 (3):1059-1089.
Comparing Peano Arithmetic, Basic Law V, and Hume’s Principle.Sean Walsh - 2012 - Annals of Pure and Applied Logic 163 (11):1679-1709.
Cardinal Arithmetic in the Style of Baron Von Münchhausen.Albert Visser - 2009 - Review of Symbolic Logic 2 (3):570-589.
Relevant Robinson's Arithmetic.J. Michael Dunn - 1979 - Studia Logica 38 (4):407 - 418.
Interpretability Degrees of Finitely Axiomatized Sequential Theories.Albert Visser - 2014 - Archive for Mathematical Logic 53 (1-2):23-42.

Analytics

Added to PP index
2018-02-18

Total views
28 ( #380,881 of 2,433,567 )

Recent downloads (6 months)
3 ( #217,168 of 2,433,567 )

How can I increase my downloads?

Downloads

My notes