Pages that link to "Item:Q2747729"

The following pages link to Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory (Q2747729):

Displaying 13 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)
• The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories (Q639666) (← links)
• The provably terminating operations of the subsystem PETJ of explicit mathematics (Q639690) (← links)
• Full operational set theory with unbounded existential quantification and power set (Q1024551) (← links)
• The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice (Q1400604) (← links)
• Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe (Q1861330) (← links)
• Universes over Frege structures (Q1861539) (← links)
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← 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)
• Reflections on reflections in explicit mathematics (Q2566068) (← links)
• EXPLICIT MATHEMATICS AND OPERATIONAL SET THEORY: SOME ONTOLOGICAL COMPARISONS (Q2795201) (← links)