Theorems Of Peano Arithmetic Are Buridan-volpin Recursively Satisfable

Reports on Mathematical Logic:57-74 (1997)
  Copy   BIBTEX

Abstract

The notion of recursive satisfaction is extended from prenex $\forall \exists$ arithmetic sentences to any first-order arithmetic sentence by allowing the scope of a negative quantifier to depend on positive quantifiers which may lie within its scope.

Categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,423

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Iterations of satisfaction classes and models of peano arithmetic.Roman Murawski - 1992 - Mathematical Logic Quarterly 38 (1):59-84.
Strictly Primitive Recursive Realizability, II. Completeness with Respect to Iterated Reflection and a Primitive Recursive $\omega$ -Rule.Zlatan Damnjanovic - 1998 - Notre Dame Journal of Formal Logic 39 (3):363-388.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
On the derivability of instantiation properties.Harvey Friedman - 1977 - Journal of Symbolic Logic 42 (4):506-514.
Separations of first and second order theories in bounded arithmetic.Masahiro Yasumoto - 2005 - Archive for Mathematical Logic 44 (6):685-688.
The shortest definition of a number in Peano arithmetic.Dev K. Roy - 2003 - Mathematical Logic Quarterly 49 (1):83-86.
Undefinability vs. Definability of Satisfaction and Truth.Roman Murawski - 1999 - Vienna Circle Institute Yearbook 6:203-215.
Indiscernibles and satisfaction classes in arithmetic.Ali Enayat - 2024 - Archive for Mathematical Logic 63 (5):655-677.
Mathematical Incompleteness Results in First-Order Peano Arithmetic: A Revisionist View of the Early History.Saul A. Kripke - 2021 - History and Philosophy of Logic 43 (2):175-182.

Analytics

Added to PP
2015-02-12

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references