Forcing in Proof Theory
From MaRDI portal
Recommendations
Cites work
- A Boolean model of ultrafilters
- A feasible theory for analysis
- A model for intuitionistic non-standard arithmetic
- A new method for establishing conservativity of classical systems over their intuitionistic version
- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
- Algebraic proofs of cut elimination
- An Effective Conservation Result for Nonstandard Arithmetic
- Class groups of integral group rings
- Constructive Sheaf Semantics
- Constructive topology and combinatorics
- Dynamical method in algebra: Effective Nullstellensätze
- Ein Ausgezeichnetes Modell Für Die Intuitionistische Typenlogik
- Eliminating definitions and Skolem functions in first-order logic
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- Forcing in intuitionistic systems without power-set
- Forcing on bounded arithmetic II
- Formalizing forcing arguments in subsystems of second-order arithmetic
- Free-variable axiomatic foundations of infinitesimal analysis: A fragment with finitary consistency proof
- scientific article; zbMATH DE number 3861137 (Why is no real title available?)
- scientific article; zbMATH DE number 3869560 (Why is no real title available?)
- scientific article; zbMATH DE number 48990 (Why is no real title available?)
- scientific article; zbMATH DE number 192927 (Why is no real title available?)
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 1955470 (Why is no real title available?)
- scientific article; zbMATH DE number 755666 (Why is no real title available?)
- IKP and friends
- Internal set theory: A new approach to nonstandard analysis
- Interpreting classical theories in constructive ones
- Intuitionistische Untersuchungen der formalistischen Logik
- Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
- La logique des topos
- Mathematical logic.
- Minimal invariant spaces in formal topology
- Minimal models of Heyting arithmetic
- On the scheme of induction for bounded arithmetic formulas
- On the strength of Ramsey's theorem
- On the strength of Ramsey's theorem for pairs
- Principles of continuous choice and continuity of functions in formal systems for constructive mathematics
- Ramsey's theorem and recursion theory
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Saturated models of universal theories
- Set theory. An introduction to independence proofs
- Some conservation results on weak König's lemma
- Some points in formal topology.
- The Baire category theorem in weak subsystems of second-order arithmetic
- The point of pointless topology
- The strength of Mac Lane set theory
- Transfer principles in nonstandard intuitionistic arithmetic
Cited in
(34)- Partially definable forcing and bounded arithmetic
- A Kuroda-style \(j\)-translation
- First steps towards a formalization of forcing
- The modal logic of inner models
- Ultrafilters in reverse mathematics
- Term extraction and Ramsey's theorem for pairs
- Forcing for hat inductive definitions in arithmetic
- Extracting Herbrand trees in classical realizability using forcing
- scientific article; zbMATH DE number 5845490 (Why is no real title available?)
- scientific article; zbMATH DE number 5971087 (Why is no real title available?)
- scientific article; zbMATH DE number 5130974 (Why is no real title available?)
- scientific article; zbMATH DE number 4154903 (Why is no real title available?)
- On the correspondence between arithmetic theories and propositional proof systems – a survey
- scientific article; zbMATH DE number 3900729 (Why is no real title available?)
- Fatal Heyting algebras and forcing persistent sentences
- The definitional side of the forcing
- Validating Brouwer's continuity principle for numbers using named exceptions
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
- scientific article; zbMATH DE number 903095 (Why is no real title available?)
- Prawitz, Proofs, and Meaning
- Constructive forcing, CPS translations and witness extraction in interactive realizability
- Finitely axiomatized theories lack self‐comprehension
- Forcing revisited
- On the Weihrauch degree of the additive Ramsey theorem
- Hilbert's tenth problem for term algebras with a substitution operator
- Complemented subsets and Boolean-valued, partial functions
- Defining long words succinctly in FO and MSO
- On the first-order parts of problems in the Weihrauch degrees
- Algorithmically random series
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
- On Nash-Williams' theorem regarding sequences with finite range
- Provably recursive functions of constructive and relatively constructive theories
This page was built for publication: Forcing in Proof Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4678943)
