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: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 12937336-n
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In English. Seller Inventory # ria9780521517690_new
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: CitiRetail, Stevenage, United Kingdom
Hardcover. Condition: new. Hardcover. 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 Goedel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to P11CA0. Ordinal analysis and the (SchwichtenbergWainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and P11CA0. 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. Written by acknowledged experts, for advanced students and researchers in mathematical logic and computer science, this volume provides a detailed, self-contained coverage of proof theory in both classical and constructive arithmetics, up to finitely iterated inductive definitions. Deep connections with computability, complexity and program extraction form the principal themes. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521517690
Quantity: 1 available
Seller: Books Puddle, Woodside, NY, U.S.A.
Condition: New. pp. 480 Index. Seller Inventory # 2614405448
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 12937336