ISBN: 9780521517690 - proofs and computations hardback (perspectives in logic) (19 resultados)

Condición: New.

Condición: New.

Condición: New.

Hardback. Condición: 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.…

Condición: New. pp. 480 Index.

Hardcover. Condición: Brand New. 1st edition. 480 pages. 9.50x6.25x1.25 inches. In Stock.

Condición: As New. Unread book in perfect condition.

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: As New. Unread book in perfect condition.

Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Condición: New. This major graduate-level text provides a detailed, self-contained coverage of proof theory. Series: Perspectives in Logic. Num Pages: 480 pages, 8 b/w illus. BIC Classification: PBCD. Category: (P) Professional & Vocational. Dimension: 158 x 233 x 29. Weight in Grams: 884. . 2011. Illustrated. hardcover. . . . . Books ship from the US and Ireland. …

Hardback. Condición: 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.…

Condición: New. This major graduate-level text provides a detailed, self-contained coverage of proof theory. Series: Perspectives in Logic. Num Pages: 480 pages, 8 b/w illus. BIC Classification: PBCD. Category: (P) Professional & Vocational. Dimension: 158 x 233 x 29. Weight in Grams: 884. . 2011. Illustrated. hardcover. . . . . …

Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Hardcover. Condición: 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.…

Condición: New. Print on Demand pp. 480 8 Illus.

Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 iterat.…

Condición: New. PRINT ON DEMAND pp. 480.

Buch. Condición: Neu. Proofs and Computations | Helmut Schwichtenberg (u. a.) | Buch | Englisch | 2013 | Cambridge University Press | EAN 9780521517690 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.