On model theory for intuitionistic bounded arithmetic with applications to independence results
From MaRDI portal
Recommendations
- Model theory of bounded arithmetic with applications to independence results
- An Independence Result for Intuitionistic Bounded Arithmetic
- scientific article; zbMATH DE number 999649
- On the Hierarchy of Intuitionistic Bounded Arithmetic
- ON THE THEORY OF MODELS FOR INTUITIONISTIC LOGIC
- A model theoretic approach to proof theory of arithmetic
- Two General Results on Intuitionistic Bounded Theories
- Some elementary results in intuitionistic model theory
- On the structure of models of bounded $E\sb 1$-induction
- Model-theoretic characterization of intuitionistic predicate formulas
Cited in
(13)- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- Polynomial induction and length minimization in intuitionistic bounded arithmetic
- Existentially Closed Models and Conservation Results in Bounded Arithmetic
- On the structure of kripke models of heyting arithmetic
- Model theory of bounded arithmetic with applications to independence results
- An Independence Result for Intuitionistic Bounded Arithmetic
- Some elementary results in intuitionistic model theory
- Proof complexity of non-classical logics
- Intuitionistic validity in \(T\)-normal Kripke structures
- Functional interpretations of feasibly constructive arithmetic
- On the unprovability of circuit size bounds in intuitionistic \(\mathsf{S}^1_2\)
- Preservation theorems for bounded formulas
- New models of bounded induction axioms
This page was built for publication: On model theory for intuitionistic bounded arithmetic with applications to independence results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035302)
