 |


|
 |
Item Details
Title:
|
AN INTRODUCTION TO MATHEMATICAL LOGIC AND TYPE THEORY
TO TRUTH THROUGH PROOF |
By: |
Peter B. Andrews |
Format: |
Hardback |

List price:
|
£99.99 |
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
ISBN 10: |
1402007639 |
ISBN 13: |
9781402007637 |
Publisher: |
KLUWER ACADEMIC PUBLISHERS |
Pub. date: |
1 July, 2002 |
Edition: |
2nd ed. 2002 |
Series: |
Applied Logic Series v. 27 |
Pages: |
390 |
Description: |
An introduction to mathematical logic that starts with propositional calculus and first-order logic. It is of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification. |
Synopsis: |
In case you are considering to adopt this book for courses with over 50 students, please contact ties.nijssen@springer.com for more information. This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax, semantics, soundness, completeness, independence, normal forms, vertical paths through negation normal formulas, compactness, Smullyan's Unifying Principle, natural deduction, cut-elimination, semantic tableaux, Skolemization, Herbrand's Theorem, unification, duality, interpolation, and definability. The last three chapters of the book provide an introduction to type theory (higher-order logic). It is shown how various mathematical concepts can be formalized in this very expressive formal language. This expressive notation facilitates proofs of the classical incompleteness and undecidability theorems which are very elegant and easy to understand. The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory.Some of the numerous exercises require giving formal proofs. A computer program called ETPS which is available from the web facilitates doing and checking such exercises. Audience: This volume will be of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification. |
Illustrations: |
biography |
Publication: |
US |
Imprint: |
Kluwer Academic Publishers |
Returns: |
Returnable |
|
|
|
 |


|

|

|

|

|
Little Worried Caterpillar (PB)
Little Green knows she''s about to make a big change - transformingfrom a caterpillar into a beautiful butterfly. Everyone is VERYexcited! But Little Green is VERY worried. What if being a butterflyisn''t as brilliant as everyone says?Join Little Green as she finds her own path ... with just a littlehelp from her friends.

|

|
All the Things We Carry PB
What can you carry?A pebble? A teddy? A bright red balloon? A painting you''ve made?A hope or a dream?This gorgeous, reassuring picture book celebrates all the preciousthings we can carry, from toys and treasures to love and hope. With comforting rhymes and fabulous illustrations, this is a warmhug of a picture book.

|

|
|
 |