Interpretations of the first-order theory of diagonalizable algebras in peano arithmetic

Studia Logica 39 (4):347 - 354 (1980)
  Copy   BIBTEX

Abstract

For every sequence |p n } n of formulas of Peano ArithmeticPA with, every formulaA of the first-order theory diagonalizable algebras, we associate a formula 0 A, called the value ofA inPA with respect to the interpretation. We show that, ifA is true in every diagonalizable algebra, then, for every, 0 A is a theorem ofPA.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Undecidability in diagonalizable algebras.V. Yu Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.
Interpretability over peano arithmetic.Claes Strannegård - 1999 - Journal of Symbolic Logic 64 (4):1407-1425.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.

Analytics

Added to PP
2009-01-28

Downloads
38 (#421,430)

6 months
8 (#367,748)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Undecidability in diagonalizable algebras.V. Yu Shavrukov - 1997 - Journal of Symbolic Logic 62 (1):79-116.
Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
Representation and Reality by Language: How to make a home quantum computer?Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (34):1-14.

View all 7 citations / Add more citations