Items related to Algorithms for Quantified Cut-Introduction: Introducing...
Algorithms for Quantified Cut-Introduction: Introducing quantified cuts in sequent calculus - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Buy New
View this item
£ 31.98
£ 9.51 shipping from Germany to United Kingdom
Destination, rates & speedsSearch results for Algorithms for Quantified Cut-Introduction: Introducing...
Seller Image
Algorithms for Quantified Cut-Introduction
Published by
AV Akademikerverlag Okt 2015, 2015
ISBN 10: 363985229X
ISBN 13: 9783639852295
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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 Inventory # 9783639852295
Quantity: 2 available
Seller Image
Algorithms for Quantified Cut-Introduction : Introducing quantified cuts in sequent calculus
Print on DemandSeller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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 Inventory # 9783639852295
Quantity: 1 available
Seller Image
Algorithms for Quantified Cut-Introduction
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 151404507
Quantity: Over 20 available
Seller Image
Algorithms for Quantified Cut-Introduction
Published by
AV Akademikerverlag Okt 2015, 2015
ISBN 10: 363985229X
ISBN 13: 9783639852295
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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. Seller Inventory # 9783639852295
Quantity: 1 available