Vendeur : preigu, Osnabrück, Allemagne
EUR 36,30
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Algorithms for Quantified Cut-Introduction | Introducing quantified cuts in sequent calculus | Christoph Spörk | Taschenbuch | 72 S. | Englisch | 2015 | AV Akademikerverlag | EAN 9783639852295 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.
Edité par AV Akademikerverlag Okt 2015, 2015
ISBN 10 : 363985229X ISBN 13 : 9783639852295
Langue: anglais
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
EUR 35,90
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Vendeur : moluna, Greven, Allemagne
EUR 32,78
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : 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.
Edité par AV Akademikerverlag Okt 2015, 2015
ISBN 10 : 363985229X ISBN 13 : 9783639852295
Langue: anglais
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
EUR 39,90
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 39,90
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.