This major graduate-level text provides a detailed, self-contained coverage of proof theory.
"synopsis" may belong to another edition of this title.
Helmut Schwichtenberg is an Emeritus Professor of Mathematics at Ludwig-Maximilians-Universität München. He has recently developed the 'proof-assistant' MINLOG, a computer-implemented logic system for proof/program development and extraction of computational content.
Stanley S. Wainer is an Emeritus Professor of Mathematics at the University of Leeds and a past-President of the British Logic Colloquium.
"About this title" may belong to another edition of this title.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 12937336-n
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9780521517690
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780521517690_new
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 1st edition. 480 pages. 9.50x6.25x1.25 inches. In Stock. This item is printed on demand. Seller Inventory # __0521517699
Quantity: 1 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 12937336-n
Quantity: Over 20 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9780521517690
Quantity: Over 20 available
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Hardback. Condition: New. Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gödel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to ?11-CA0. Ordinal analysis and the (Schwichtenberg-Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and ?11-CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic. Seller Inventory # LU-9780521517690
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Unread book in perfect condition. Seller Inventory # 12937336
Quantity: Over 20 available
Seller: Mispah books, Redhill, SURRE, United Kingdom
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA79705215176996
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 480 Index. Seller Inventory # 2614405448