Abstract

One of the major problems in reductive proof theory in the early 1970s was to give a proof-theoretic reduction of classical theories of iterated arithmetical inductive definitions to corresponding constructive systems. This problem was solved in [BFPS] in various ways which all where based on the method of cut-elimination (normalization, reps.) for infinitary Tait-style sequent calculi (infinitary systems of natural deduction,

Citations