A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
From MaRDI portal
Publication:476116
DOI10.1016/j.apal.2014.10.001zbMath1371.03092OpenAlexW2065894311MaRDI QIDQ476116
Publication date: 28 November 2014
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2014.10.001
Nonclassical and second-order set theories (03E70) Models of other mathematical theories (03C65) Intuitionistic mathematics (03F55) Relative consistency and interpretations (03F25)
Related Items (7)
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts ⋮ A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC ⋮ The Operational Perspective: Three Routes ⋮ The Operational Penumbra: Some Ontological Aspects ⋮ A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\) ⋮ Stage comparison, fixed points, and least fixed points in Kripke-Platek environments ⋮ A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Operational closure and stability
- Proof-theoretic conservations of weak weak intuitionistic constructive set theories
- The strength of extensionality. II: Weak weak set theories without infinity
- A proof-theoretic characterization of the basic feasible functionals
- Operational set theory and small large cardinals
- Proof-theoretical analysis: Weak systems of functions and classes
- The strength of extensionality. I: Weak weak set theories with infinity
- Full operational set theory with unbounded existential quantification and power set
- Logic colloquium '77. Proceedings of the colloquium held in Wroclaw, August 1977
- Goodman's theorem and beyond
- Set theory. An introduction to independence proofs
- Constructivism in mathematics. An introduction. Volume I
- Fixed points in Peano arithmetic with ordinals
- Theories with self-application and computational complexity.
- Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
- The predicative Frege hierarchy
- On Feferman's operational set theory \textsf{OST}
- Reflections on reflections in explicit mathematics
- Interpreting classical theories in constructive ones
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory
- EXPLICIT MATHEMATICS AND OPERATIONAL SET THEORY: SOME ONTOLOGICAL COMPARISONS
- Realizability algebras II : new models of ZF + DC
- Extending constructive operational set theory by impredicative principles
- Realizability algebras: a program to well order R
- A VERSION OF KRIPKE‐PLATEK SET THEORY WHICH IS CONSERVATIVE OVER PEANO ARITHMETIC
- Principles of continuous choice and continuity of functions in formal systems for constructive mathematics
- Realization of analysis into Explicit Mathematics
- The consistency of classical set theory relative to a set theory with intu1tionistic logic
- Forcing in Proof Theory
- A well-ordering proof for Feferman's theoryT 0
- Forcing under Anti‐Foundation Axiom: An expression of the stalks
- Deduction-preserving "Recursive Isomorphisms" between theories
- Some theories with positive induction of ordinal strength φω0
- Logic and structure
- Universes in explicit mathematics
- The strength of Mac Lane set theory
- Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms
This page was built for publication: A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
