Published by AV Akademikerverlag Okt 2015, 2015
ISBN 10: 363985229X ISBN 13: 9783639852295
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
US$ 43.05
Convert currencyQuantity: 2 available
Add to basketTaschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 72 pp. Englisch.
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 47.85
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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.
Seller: moluna, Greven, Germany
US$ 39.30
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Spoerk ChristophChristoph Spoerk (born in Vienna 1988) studied Computer Science at the Vienna University of Technology. He wrote his bachelor thesis about a heuristic solution for the Delay Constrained Steiner Tree Problem (2011) and f.
Published by AV Akademikerverlag Okt 2015, 2015
ISBN 10: 363985229X ISBN 13: 9783639852295
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
US$ 47.85
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 72 pp. Englisch.