The following pages link to Forcing in Proof Theory (Q4678943):
Displaying 14 items.
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP (Q476116) (← links)
- Provably recursive functions of constructive and relatively constructive theories (Q964451) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- A Kuroda-style \(j\)-translation (Q2312092) (← links)
- THE MODAL LOGIC OF INNER MODELS (Q2805035) (← links)
- Ultrafilters in reverse mathematics (Q2878778) (← links)
- Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
- Forcing for hat inductive definitions in arithmetic (Q2922495) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- Prawitz, Proofs, and Meaning (Q5213604) (← links)
- Constructive forcing, CPS translations and witness extraction in Interactive realizability (Q5360214) (← links)
- Finitely axiomatized theories lack self‐comprehension (Q6051417) (← links)
- Forcing revisited (Q6096804) (← links)
