Skip to main content Accessibility help
×
Home

MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY

  • ZLATAN DAMNJANOVIC (a1)

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.

Copyright

References

Hide All
[1] Burgess, J., Fixing Frege, Princeton University Press, Princeton, 2005.
[2] Collins, G. E. and Halpern, J. D., On the interpretability of arithmetic in set theory. Notre Dame Journal of Formal Logic, vol. 11 (1970), pp. 477483.
[3] Damnjanovic, Z., From Strings to Sets: A Technical Report, University of Southern California, 2016, arXiv: 1701.07548.
[4] Ferreira, F. and Ferreira, G., Interpretability in Robinson’s Q, this Bulletin, vol. 19 (2013), pp. 289317.
[5] Ganea, M., Arithmetic in semigroups. Journal of Symbol Logic, vol. 74 (2007), pp. 265278.
[6] Grzegorczyk, A., Undecidability without arithmetization. Studia Logica, vol. 79 (2005), pp. 163230.
[7] Grzegorczyk, A. and Zdanowski, K., Undecidability and concatenation, Andrzej Mostowski and Foundational Studies (Ehrenfeucht, A., Marek, V. W., and Srebrny, M., editors), IOS Press, Amsterdam, 2008, pp. 7291.
[8] Hájek, P. and Pudlák, P., Metamathematics of First-Order Arithmetic, Springer, Berlin, 1993.
[9] Kirby, L., Finitary set theory. Notre Dame Journal of Formal Logic, vol. 50 (2009), pp. 227243.
[10] Montagna, F. and Mancini, A., A minimal predicative set theory. Notre Dame Journal of Formal Logic, vol. 35 (1994), pp. 186203.
[11] Mycielski, J., Pudlák, P., and Stern, A. S., A Lattice of Chapters of Mathematics (Interpretations between Theorems), Memoirs of the American Mathematical Society, vol. 426, American Mathematical Society, Providence, RI, 1990.
[12] Nelson, E., Predicative Arithmetic, Princeton University Press, Princeton, 1986.
[13] Quine, W. V. O., Concatenation as a basis for arithmetic. Journal of Symbolic Logic, vol. 11 (1946), pp. 105114.
[14] Szmielew, W. and Tarski, A., Mutual interpretability of some essentially undecidable theories, Proceedings of the International Congress of Mathematicians (Cambridge, Massachussetts, 1950), (Graves, L. M., Hille, E., Smith, P. A., and Zariski, O., editors), vol. 1, American Mathematical Society, Providence, RI, 1952, p. 734.
[15] Švejdar, V, On interpretability in the theory of concatenation. Notre Dame Journal of Formal Logic, vol. 50 (2009), pp. 8795.
[16] Tarski, A., Mostowski, A., and Robinson, R. M., Undecidable Theories, North-Holland, Amsterdam, 1953.
[17] Visser, A., Pairs, sets and sequences in first-order theories. Archive for Mathematical Logic, vol. 47 (2008), pp. 297326.
[18] Visser, A., Cardinal arithmetic in the style of Baron von Münchhausen. Review of Symbolic Logic, vol. 2 (2009), pp. 570589.
[19] Visser, A., Growing commas: A study of sequentiality and concatenation. Notre Dame Journal of Formal Logic, vol. 50 (2009), pp. 6185.

Keywords

MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY

  • ZLATAN DAMNJANOVIC (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed