Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic

Bulletin of Symbolic Logic 7 (3):390-391 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,438

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

Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.
Fundamental notions of analysis in subsystems of second-order arithmetic.Jeremy Avigad - 2006 - Annals of Pure and Applied Logic 139 (1):138-184.
Borel quasi-orderings in subsystems of second-order arithmetic.Alberto Marcone - 1991 - Annals of Pure and Applied Logic 54 (3):265-291.
Comparing Peano arithmetic, Basic Law V, and Hume’s Principle.Sean Walsh - 2012 - Annals of Pure and Applied Logic 163 (11):1679-1709.
Formalizing non-standard arguments in second-order arithmetic.Keita Yokoyama - 2010 - Journal of Symbolic Logic 75 (4):1199-1210.
Interpreting Classical Theories in Constructive Ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.
Interpreting classical theories in constructive ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.
Complex analysis in subsystems of second order arithmetic.Keita Yokoyama - 2007 - Archive for Mathematical Logic 46 (1):15-35.

Analytics

Added to PP
2017-02-22

Downloads
9 (#1,236,107)

6 months
1 (#1,498,742)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeremy Avigad
Carnegie Mellon University

Citations of this work

Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.

Add more citations

References found in this work

No references found.

Add more references