Forcing in proof theory

Bulletin of Symbolic Logic 10 (3):305-333 (2004)
  Copy   BIBTEX

Abstract

Paul Cohen’s method of forcing, together with Saul Kripke’s related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mathematical logic, from set theory and model theory to constructive and categorical logic. Here, I argue that forcing also has a place in traditional Hilbert-style proof theory, where the goal is to formalize portions of ordinary mathematics in restricted axiomatic theories, and study those theories in constructive or syntactic terms. I will discuss the aspects of forcing that are useful in this respect, and some sample applications. The latter include ways of obtaining conservation results for classical and intuitionistic theories, interpreting classical theories in constructive ones, and constructivizing model-theoretic arguments

Links

PhilArchive



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

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

On the Strength of some Semi-Constructive Theories.Solomon Feferman - 2012 - In Ulrich Berger, Hannes Diener, Peter Schuster & Monika Seisenberger (eds.), Logic, Construction, Computation. De Gruyter. pp. 201-226.
Intuitionistic logic, model theory and forcing.Melvin Fitting - 1969 - Amsterdam,: North-Holland Pub. Co..
Interpreting classical theories in constructive ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.
A proofless proof of the Barwise compactness theorem.Mark Howard - 1988 - Journal of Symbolic Logic 53 (2):597-602.
Proper forcing and l(ℝ).Itay Neeman & Jindřich Zapletal - 2001 - Journal of Symbolic Logic 66 (2):801-810.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.

Analytics

Added to PP
2009-01-28

Downloads
367 (#51,926)

6 months
12 (#174,629)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeremy Avigad
Carnegie Mellon University

Citations of this work

Epistemic Modality and Hyperintensionality in Mathematics.Timothy Bowen - 2017 - Dissertation, Arché, University of St Andrews
Forcing revisited.Toby Meadows - 2023 - Mathematical Logic Quarterly 69 (3):287-340.
A Kuroda-style j-translation.Benno van den Berg - 2019 - Archive for Mathematical Logic 58 (5):627-634.

View all 12 citations / Add more citations

References found in this work

Modal Logic: An Introduction.Brian F. Chellas - 1980 - New York: Cambridge University Press.
A New Introduction to Modal Logic.M. J. Cresswell & G. E. Hughes - 1996 - New York: Routledge. Edited by M. J. Cresswell.
Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.
Proof Theory.Gaisi Takeuti - 1990 - Studia Logica 49 (1):160-161.

View all 49 references / Add more references