Andere Kunden interessierten sich auch für
![About Cut-Elimination in Schematic Proofs]( "About Cut-Elimination in Schematic Proofs")
About Cut-Elimination in Schematic Proofs29,99 €![Design and Application of Quantified Self Approaches for Reflective Learning in the Workplace]( "Design and Application of Quantified Self Approaches for Reflective Learning in the Workplace")
Design and Application of Quantified Self Approaches for Reflective Learning in the Workplace56,00 €![Classification of Medical Data with HTM Cortical Learning Algorithms]( "Classification of Medical Data with HTM Cortical Learning Algorithms")
Classification of Medical Data with HTM Cortical Learning Algorithms19,99 €![Using Genetic Algorithms for Racing Line Optimization]( "Using Genetic Algorithms for Racing Line Optimization")
Using Genetic Algorithms for Racing Line Optimization36,99 €![Final Cut Pro X for iMovie and Final Cut Express Users]( "Final Cut Pro X for iMovie and Final Cut Express Users")
Final Cut Pro X for iMovie and Final Cut Express Users43,99 €![Combinatorial Optimization]( "Combinatorial Optimization")
Combinatorial Optimization37,99 €![Animation of Sorting Algorithms in ANIMAL]( "Animation of Sorting Algorithms in ANIMAL")
Animation of Sorting Algorithms in ANIMAL26,99 €
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.