This is an introduction to logic and the axiomatization of set theory from a unique standpoint. Philosophical considerations, which are often ignored or treated casually, are here given careful consideration, and furthermore the author places the notion of inductively defined sets (recursive datatypes) at the centre of his exposition resulting in a treatment of well established topics that is fresh and insightful. The presentation is engaging, but always great care is taken to illustrate difficult points. Understanding is also aided by the inclusion of many exercises. Little previous knowledge of logic is required of the reader, and only a background of standard undergraduate mathematics is assumed.Read more
- Inductively defined sets play a central role
- Great care is taken to motivate the axioms of set theory
- Philosophical concerns emphasised
Reviews & endorsements
'This is a remarkable book, presenting an introduction to mathematical logic and axiomatic set theory from a unified standpoint … also eminently suitable for self-study by mature mathematicians who wish to acquire a well-balanced and deeper knowledge of a field that is not part of their specialty … The author's presentation is a model of clarity, and much of the liveliness of a lecture has been preserved in the write-up. The various asides, cross-references, and care in motivating definitions and concepts all contribute to the value of the book as an instructional source … a treasure in its genre, to be highly recommended by the reviewer.' MathSciNetSee more reviews
'… a real sense of freshness and vitality … I found this a very readable and stimulating book. Forster writes with an agreeably light touch and a whimsical sense of fun and his use of rectypes as a leitmotiv is both innovative and inspired.' The Mathematical Gazette
'The author's philosophical training leads him to accompany many definitions with lengthy reflexions which add interest and enliven the book.' Mathematika
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: December 2003
- format: Paperback
- isbn: 9780521533614
- length: 246 pages
- dimensions: 229 x 152 x 13 mm
- weight: 0.34kg
- contains: 125 exercises
- availability: Available
Table of Contents
1. Definitions and notations
2. Recursive datatypes
3. Partially ordered sets
4. Propositional calculus
5. Predicate calculus
6. Computable functions
8. Set theory
9. Answers to selected questions.
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact firstname.lastname@example.org.
Instructors have used or reviewed this title for the following courses
- Introduction to Proof
- Mathematical Logic ll
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email email@example.comRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×