Proofs and Computations by Stanley Wainer
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.-
Computable Structure Theory
-
Subsystems of Second Order Arithmetic
-
General Recursion Theory
-
Computability in Analysis and Physics
-
Recursion-Theoretic Hierarchies
-
Degrees of Unsolvability
-
Fundamentals of Stability Theory
-
Constructibility
-
Higher Recursion Theory
-
Essential Stability Theory
-
Model-Theoretic Logics
-
Admissible Sets and Structures
-
Pure Inductive Logic
-
Lambda Calculus with Types
"Written by two leading practitioners in the area of formal logic, the book provides a panoramic view of the topicThis reference volume is a must for the bookshelf of every practitioner of formal logic and computer science." Prahladavaradan Sampath, Computing Reviews
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.
| SKU | Unavailable |
| ISBN 13 | 9780521517690 |
| ISBN 10 | 0521517699 |
| Title | Proofs and Computations |
| Author | Stanley Wainer |
| Series | Perspectives In Logic |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Cambridge University Press |
| Year published | 2011-12-15 |
| Number of pages | 480 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |