The following pages link to Thomas Strahm (Q588960):
Displaying 6 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)
- 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)
