Publication:4364500
From MaRDI portal
zbMath0887.03043MaRDI QIDQ4364500
Publication date: 23 March 1998
03F05: Cut-elimination and normal-form theorems
03F07: Structure of proofs
03F03: Proof theory in general (including proof-theoretic semantics)
03F15: Recursive ordinals and ordinal notations
Related Items
A NOTE ON PREDICATIVE ORDINAL ANALYSIS I: ITERATED COMPREHENSION AND TRANSFINITE INDUCTION, Mining the surface: witnessing the low complexity theorems of arithmetic, An extension of the omega-rule, On the computational complexity of cut-reduction, A termination proof for epsilon substitution using partial derivations, Reduction of finite and infinite derivations, Infinitary action logic with exponentiation, Infinitary action logic with multiplexing, A Characterisation of Definable NP Search Problems in Peano Arithmetic