The following pages link to (Q4079564):
Displaying 10 items.
- On the computational complexity of cut-reduction (Q636310) (← links)
- Fragments of arithmetic (Q762484) (← links)
- What can be done with PRA? (Q1147134) (← links)
- Finite investigations of transfinite derivations (Q1254248) (← links)
- Continuous normalization for the lambda-calculus and Gödel's T (Q1772771) (← links)
- Notation systems for infinitary derivations (Q2277451) (← links)
- Further applications of ultra-conservative ω-rules (Q3318773) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC (Q5274882) (← links)
- Proof Search Tree and Cut Elimination (Q5452195) (← links)
