Jeremy Avigad. Update procedures and the 1-consistency of arithmetic. Mathematical Logic Quarterly, vol. 48 , pp. 3–13

Bulletin of Symbolic Logic 9 (1):45-47 (2003)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1017/s1079898600004777

Links

PhilArchive



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

External links

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

Toshiyasu Arai. Consistency proof via pointwise induction. Archive for mathematical logic, vol. 37 no. 3 , pp. 149–165. [REVIEW]Andreas Weiermann - 2002 - Bulletin of Symbolic Logic 8 (4):536-537.
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2003 - Bulletin of Symbolic Logic 9 (1):45-47.
Jeremy Avigad. Formalizing forcing arguments in subsystems of second-order arithmetic. Annals of pure and applied logic, vol. 82 , pp. 165–191. [REVIEW]Alberto Marcone - 2001 - Bulletin of Symbolic Logic 7 (3):390-391.
Review: Jeremy Avigad, A Realizability Interpretation for Classical Arithmetic. [REVIEW]Ulrich Berger - 2002 - Bulletin of Symbolic Logic 8 (3):439-440.
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.
Review: Jeremy Avigad, Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic. [REVIEW]Alberto Marcone - 2001 - Bulletin of Symbolic Logic 7 (3):390-391.
Review: Toshiyasu Arai, Some Results on Cut-Elimination, Provable Well-Orderings, Induction and Reflection. [REVIEW]Jeremy Avigad - 2001 - Bulletin of Symbolic Logic 7 (1):77-78.
Jeremy Avigad and Solomon Feferman. Gödel's functional (“Dialectica”) interpretation. Handbook of proof theory, edited by Samuel R. Buss, Studies in logic and the foundations of mathematics, vol. 137, Elsevier, Amsterdam etc. 1998, pp. 337–405. [REVIEW]Toshiyasu Arai - 2000 - Bulletin of Symbolic Logic 6 (4):469-470.
Mitsuru Tada and Makoto Tatsuta. The function ⌊a/m⌋ in sharply bounded arithmetic. Archive for mathematical logic, vol. 37 no. 1 , pp. 51–57. [REVIEW]Fernando Ferreira - 2001 - Bulletin of Symbolic Logic 7 (3):391-391.
Arnold Beckmann. Proving consistency of equational theories in bounded arithmetic. The Journal of Symbolic Logic, vol. 67 , pp. 279–296. [REVIEW]Chris Pollett - 2003 - Bulletin of Symbolic Logic 9 (1):44-45.

Analytics

Added to PP
2014-03-22

Downloads
31 (#532,056)

6 months
5 (#710,905)

Historical graph of downloads
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