The following pages link to (Q4364500):
Displaying 9 items.
- An extension of the omega-rule (Q283132) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- A termination proof for epsilon substitution using partial derivations (Q1401363) (← links)
- Reduction of finite and infinite derivations (Q1577482) (← links)
- Infinitary action logic with exponentiation (Q2067638) (← links)
- Infinitary action logic with multiplexing (Q2698280) (← links)
- A Characterisation of Definable NP Search Problems in Peano Arithmetic (Q3638270) (← links)
- A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION (Q4628680) (← links)
- Mining the surface: witnessing the low complexity theorems of arithmetic (Q6160756) (← links)