Algorithms for Quantified Cut-Introduction. Introducing quantified cuts in sequent calculus

      Аннотация: In proof theory finding lemmas for a given proof is of deep interest. The possibility of algorithmically computing them, even for large proofs, is a defined goal in this research area. This book describes an approach for introducing quantified cuts into proofs in sequent calculus by making good use of knowledge from formal language theory. The described method is even capable of possibly introducing several lemmas at once into a proof.

Ключевые слова: Proof Theory, Sequent Calculus, Cut-Introduction, Formal Language Theory