The following pages link to (Q3778746):
Displayed 50 items.
- Operational closure and stability (Q385076) (← links)
- 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)
- Admissible closures of polynomial time computable arithmetic (Q634777) (← links)
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories (Q639666) (← links)
- Proof-theoretic analysis of KPM (Q803124) (← links)
- A logic of abstraction related to finite constructive number classes (Q910401) (← links)
- Ordinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitions (Q958493) (← links)
- Patterns of resemblance of order 2 (Q1011757) (← links)
- Full operational set theory with unbounded existential quantification and power set (Q1024551) (← links)
- Fixed points in Peano arithmetic with ordinals (Q1210139) (← links)
- Proof theory of reflection (Q1332853) (← links)
- On the proof-theoretic strength of monotone induction in explicit mathematics (Q1356976) (← links)
- The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice (Q1400604) (← links)
- The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule (Q1577487) (← links)
- Inaccessible set axioms may have little consistency strength (Q1612481) (← links)
- Epsilon substitution for \(ID_1\) via cut-elimination (Q1661673) (← links)
- Understanding uniformity in Feferman's explicit mathematics (Q1899146) (← links)
- Patterns of resemblance and Bachmann-Howard fixed points (Q2064043) (← links)
- \(\Pi_1^1\)-comprehension as a well-ordering principle (Q2274030) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\) (Q2344720) (← links)
- On Feferman's operational set theory \textsf{OST} (Q2463480) (← links)
- On the relationship between fixed points and iteration in admissible set theory without foundation (Q2486984) (← links)
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory (Q2514846) (← links)
- Reflections on reflections in explicit mathematics (Q2566068) (← links)
- A few more dissimilarities between second-order arithmetic and set theory (Q2700817) (← links)
- Wellfoundedness proof with the maximal distinguished set (Q2700827) (← links)
- Interpreting classical theories in constructive ones (Q2710607) (← links)
- First order theories for nonmonotone inductive definitions: recursively inaccessible and Mahlo (Q2758045) (← links)
- Analysis of a Double Kruskal Theorem (Q2951923) (← links)
- Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory (Q3305554) (← links)
- The Operational Perspective: Three Routes (Q3305557) (← links)
- From Subsystems of Analysis to Subsystems of Set Theory (Q3305559) (← links)
- Functional interpretation and inductive definitions (Q3655246) (← links)
- The role of parameters in bar rule and bar induction (Q3984445) (← links)
- Explicit mathematics with the monotone fixed point principle. II: Models (Q4262568) (← links)
- The Recursively Mahlo Property in Second Order Arithmetic (Q4868241) (← links)
- On power set in explicit mathematics (Q4894722) (← links)
- Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa (Q4897040) (← links)
- Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$ (Q5013900) (← links)
- An Upper Bound for the Proof-Theoretic Strength of Martin-Löf Type Theory with W-type and One Universe (Q5013908) (← links)
- Computable aspects of the Bachmann–Howard principle (Q5118047) (← links)
- Iterated Inductive Definitions Revisited (Q5214787) (← links)
- Proof Theory of Constructive Systems: Inductive Types and Univalence (Q5214792) (← links)
- RELATIVIZING OPERATIONAL SET THEORY (Q5346703) (← links)
- On the relationship between <i>ATR</i><sub>0</sub> and (Q5687314) (← links)
- Elementary patterns of resemblance (Q5935985) (← links)
- Universes in explicit mathematics (Q5939842) (← links)
- Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms (Q5957853) (← links)
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension (Q6080077) (← links)