Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic

Journal of Symbolic Logic 48 (4):1090-1104 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



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

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

Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.
Phase Transition Results for Three Ramsey-Like Theorems.Florian Pelupessy - 2016 - Notre Dame Journal of Formal Logic 57 (2):195-207.
The modal logic of consistency assertions of peano arithmetic.Silvio Valentini - 1983 - Mathematical Logic Quarterly 29 (1):25-32.
String theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.
A theory of formal truth arithmetically equivalent to ID.Andrea Cantini - 1990 - Journal of Symbolic Logic 55 (1):244 - 259.

Analytics

Added to PP
2009-01-28

Downloads
43 (#527,840)

6 months
5 (#1,094,893)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Current Research on Gödel’s Incompleteness Theorems.Yong Cheng - 2021 - Bulletin of Symbolic Logic 27 (2):113-167.
Ultrafilters and types on models of arithmetic.L. A. S. Kirby - 1984 - Annals of Pure and Applied Logic 27 (3):215-252.
On the Depth of Gödel’s Incompleteness Theorems.Yong Cheng - forthcoming - Philosophia Mathematica.

Add more citations

References found in this work

No references found.

Add more references