Artículos relacionados a Algorithms for Quantified Cut-Introduction: Introducing...
Algorithms for Quantified Cut-Introduction: Introducing quantified cuts in sequent calculus - Tapa blanda
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 35,90
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoResultados de la búsqueda para Algorithms for Quantified Cut-Introduction: Introducing...
Imagen del vendedor
Algorithms for Quantified Cut-Introduction
Publicado por
AV Akademikerverlag Okt 2015, 2015
ISBN 10: 363985229X
ISBN 13: 9783639852295
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783639852295
Cantidad disponible: 2 disponibles
Imagen del vendedor
Algorithms for Quantified Cut-Introduction : Introducing quantified cuts in sequent calculus
Publicado por
AV Akademikerverlag, 2015
ISBN 10: 363985229X
ISBN 13: 9783639852295
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783639852295
Cantidad disponible: 1 disponibles
Imagen del vendedor
Algorithms for Quantified Cut-Introduction
Publicado por
AV Akademikerverlag, 2015
ISBN 10: 363985229X
ISBN 13: 9783639852295
Nuevo
Tapa blanda
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 151404507
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Algorithms for Quantified Cut-Introduction
Publicado por
AV Akademikerverlag Okt 2015, 2015
ISBN 10: 363985229X
ISBN 13: 9783639852295
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9783639852295
Cantidad disponible: 1 disponibles