Verwandte Artikel zu Algorithms for Quantified Cut-Introduction: Introducing...
Algorithms for Quantified Cut-Introduction: Introducing quantified cuts in sequent calculus - Softcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 32,78
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Algorithms for Quantified Cut-Introduction: Introducing...
Foto des Verkäufers
Algorithms for Quantified Cut-Introduction
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 151404507
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Algorithms for Quantified Cut-Introduction
Verlag:
AV Akademikerverlag Okt 2015, 2015
ISBN 10: 363985229X
ISBN 13: 9783639852295
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783639852295
Anzahl: 2 verfügbar
Foto des Verkäufers
Algorithms for Quantified Cut-Introduction
Verlag:
AV Akademikerverlag Okt 2015, 2015
ISBN 10: 363985229X
ISBN 13: 9783639852295
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783639852295
Anzahl: 1 verfügbar
Foto des Verkäufers
Algorithms for Quantified Cut-Introduction : Introducing quantified cuts in sequent calculus
Print-on-DemandAnbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783639852295
Anzahl: 1 verfügbar