Forcing in Proof Theory

@article{Avigad2004ForcingIP,
  title={Forcing in Proof Theory},
  author={Jeremy Avigad},
  journal={Bulletin of Symbolic Logic},
  year={2004},
  volume={10},
  pages={305 - 333}
}
  • J. Avigad
  • Published 1 September 2004
  • Computer Science, Mathematics
  • Bulletin of Symbolic Logic
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… 
Provably recursive functions of constructive and relatively constructive theories
TLDR
Conservation theorems for theories of classical first-order arithmetic over their intuitionistic version are proved and generalized conservation results for intuitionistic theories when certain weak forms of the principle of excluded middle are added to them are proved.
Mechanization of Separation in Generic Extensions
TLDR
Paulson's library on constructibility is extended with renaming of variables for internalized formulas, improved results on definitions by recursion on well-founded relations, and sharpened hypotheses in his development of relativization and absoluteness.
Finitely Axiomatized Theories Lack Self-Comprehension
In this paper we prove that no consistent finitely axiomatized theory one-dimensionally interprets its own extension with predicative comprehension. This constitutes a result with the flavor of the
Proof Theory
Proof theory began in the 1920’s as a part of Hilbert’s program, which aimed to secure the foundations of mathematics by modeling infinitary mathematics with formal axiomatic systems and proving
A new model construction by making a detour via intuitionistic theories I: Operational set theory without choice is Π1-equivalent to KP
TLDR
The combined interpretation, seen as a model construction in the sense of Visser's miniature model theory, is a new way of construction for classical theories and could be said the third kind of model construction ever used which is non-trivial on the logical connective level, after generic extension a la Cohen and Krivine's classical realisability model.
A nominal exploration of intuitionism
TLDR
This papers extends the Nuprl proof assistant with named exceptions and handlers, as well as a nominal fresh operator, to prove a version of Brouwer's Continuity Principle for numbers and provides a simpler proof of a weaker version of this principle that only uses diverging terms.
On the correspondence between arithmetic theories and propositional proof systems - a survey
TLDR
The aim of this paper is to explain and develop the general correspondence between propositional proof systems and arithmetic theories, as introduced by Krajicek and Pudlak, and favour a general axiomatic approach to this correspondence.
Forcing and Type Theory
TLDR
The technique of forcing is presented from a constructive point of view and the connections with proof theory and constructive mathematics are not so surprising.
A Kuroda-style j-translation
TLDR
It is shown that there exists a similar translation of intuitionistic logic into itself which is more in the spirit of Kuroda's negative translation, where the key is to apply the nucleus not only to the entire formula and universally quantified subformulas, but to conclusions of implications as well.
Constructive forcing, CPS translations and witness extraction in Interactive realizability †
  • Federico Aschieri
  • Computer Science, Mathematics
    Mathematical Structures in Computer Science
  • 2015
TLDR
A constructive and efficient method is introduced based on a new ‘(state-extending-continuation)-passing-style translation’ whose properties are described with the constructive forcing/reducibility semantics.
...
1
2
3
...

References

SHOWING 1-10 OF 187 REFERENCES
Two applications of Boolean models
  • T. Coquand
  • Mathematics, Computer Science
    Arch. Math. Log.
  • 1998
TLDR
It is shown here how to give similar arguments, valid constructively, by using Boolean models, a slight variation of ordinary first-order models, where truth values are now regular ideals of a given Boolean algebra.
Continuous Truth I Non-constructive Objects
TLDR
A general theory of the logic of potentially infinite objects, derived from a theory of meaning for statements concerning these objects, is given, showing that general principles of continuity, local choice and local compactness hold for these models.
Handbook of proof theory
An introduction to proof theory, S.R. Buss first-order proof theory of arithmetic, S.R. Buss hierarchies of provably recursive functions, M. Fairtlough and S.S. Wainer subsystems of set theory and
Transfer principles in nonstandard intuitionistic arithmetic
TLDR
A term-model construction is presented that assigns a model to any first-order intuitionistic theory, enabling it to reproduce conservation results of Moerdijk and Palmgren for nonstandard Heyting arithmetic and showing that a certain weak fragment of intuitionistic nonstandard arithmetic is conservative over primitive recursive arithmetic.
Algebraic proofs of cut elimination
  • J. Avigad
  • Mathematics, Computer Science
    J. Log. Algebraic Methods Program.
  • 2001
Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a
Constructive Topology and Combinatorics
  • T. Coquand
  • Mathematics, Computer Science
    Constructivity in Computer Science
  • 1991
TLDR
The proofs obtained by this method are well-suited for mechanisation in interactive proof systems that allow the user to introduce inductively defined notions, such as NuPrl, or Martin-Lof set theory.
Formalizing Forcing Arguments in Subsystems of Second-Order Arithmetic
  • J. Avigad
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 1996
TLDR
This method is used to sharpen the conservation theorems of Harrington and Brown-Simpson, giving an effective proof that WKL+0 is conservative over RCA0 with no significant increase in the lengths of proofs.
A uniform semantic proof for cut-elimination and completeness of various first and higher order logics
  • M. Okada
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 2002
TLDR
A natural generalization of Girard's (first order) phase semantics of linear logic to intuitionistic and higher-order phase semantics is presented, which allows for a uniform semantic proof of the cut-elimination theorem and a higher order phase-semantic completeness theorem for various different logical systems at the same time.
Bounded arithmetic, propositional logic, and complexity theory
  • J. Krajícek
  • Mathematics, Computer Science
    Encyclopedia of mathematics and its applications
  • 1995
This book presents an up-to-date, unified treatment of research in bounded arithmetic and complexity of propositional logic, with emphasis on independence proofs and lower bound proofs. The author
Saturated models of universal theories
  • J. Avigad
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 2002
Abstract A notion called Herbrand saturation is shown to provide the model-theoretic analogue of a proof-theoretic method, Herbrand analysis, yielding uniform model-theoretic proofs of a number of
...
1
2
3
4
5
...