Basic Proof Theory by A S Troelstra
This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.-
The Optimal Implementation of Functional Programming Languages
-
Mathematics for Computer Graphics
-
The Clausal Theory of Types
-
Process Algebra
-
Nonmonotonic Reasoning
-
Applications of Process Algebra
- Reasoning about Gossip
-
Belief Revision
-
Mathematical Theory of Domains
-
Process Algebra: Equational Theories of Communicating Processes
-
Initial Algebras and Terminal Coalgebras
-
Rippling: Meta-Level Guidance for Mathematical Reasoning
-
Finite-State Techniques
-
Higher Order Logic and Hardware Verification
-
Formal Methods in Artificial Intelligence
-
Hybrid Graph Theory and Network Analysis
-
Data Refinement
-
Lambda-calculus, Combinators and Functional Programming
-
A Unifying Framework for Structured Analysis and Design Models
-
Concurrency Verification
-
Design Theory and Computer Science
-
Nets, Terms and Formulas
-
Computational Learning Theory
-
Metamathematics, Machines and Goedel's Proof
-
Formal Specification and Design
-
The Logic of Typed Feature Structures
-
Free Choice Petri Nets
-
Two-Level Functional Languages
-
Basic Simple Type Theory
-
Term Rewriting Systems
-
The Uncertain Reasoner's Companion
-
Deductive and Declarative Programming
-
Information Flow
-
Domains and Lambda-Calculi
-
Formal Semantics and Pragmatics for Natural Language Querying
'This is a fine bookAny computer scientist with some logical background will benefit from studying it. It is written by two of the experts in the field and comes up to their usual standards of precision and care.' Ray Turner, Computer Journal
| SKU | Unavailable |
| ISBN 13 | 9780521779111 |
| ISBN 10 | 0521779111 |
| Title | Basic Proof Theory |
| Author | A S Troelstra |
| Series | Cambridge Tracts In Theoretical Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Cambridge University Press |
| Year published | 2000-07-27 |
| Number of pages | 432 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |