Order Total (1 Item Items):
Shipping Destination:
Algorithms Quantified Cut Introduction Introducing by Spörk Christoph (2 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (2)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (2)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (2)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (2)
- Not Print on Demand (1)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 40
- Over £ 40 (No further results match this refinement)
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Taschenbuch. Condition: 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.
-
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.
