The following pages link to Thomas Strahm (Q588960):
Displaying 22 items.
- Admissible closures of polynomial time computable arithmetic (Q634777) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- The \(\mu\) quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals (Q1267848) (← links)
- Bar induction and \(\omega\) model reflection (Q1302306) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- The unfolding of non-finitist arithmetic (Q1577479) (← links)
- The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule (Q1577487) (← links)
- Fixed point theories and dependent choice (Q1590660) (← links)
- Totality in applicative theories (Q1896484) (← links)
- Second order theories with ordinals and elementary comprehension (Q1908814) (← links)
- A flexible type system for the small Veblen ordinal (Q2312096) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator and join (Q2563984) (← links)
- Reflections on reflections in explicit mathematics (Q2566068) (← links)
- Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory (Q2747729) (← links)
- A note on the theory SID<ω of stratified induction (Q2933746) (← links)
- UNFOLDING FINITIST ARITHMETIC (Q3066785) (← links)
- (Q3081651) (← links)
- Realisability in weak systems of explicit mathematics (Q3107339) (← links)
- Partial Applicative Theories and Explicit Substitutions (Q4870067) (← links)
- Katalin Bimbó. Proof Theory: Sequent Calculi and Related Formalisms. CRC Press, Boca Raton, 2014, x + 374 pp. (Q5346698) (← links)
- On the proof theory of type two functionals based on primitive recursive operations (Q5485397) (← links)
