This is the Volume II of a text for a problem-oriented undergraduate course in mathematical logic. It covers the basics of computability, using Turing machines and recursive functions, and Goedel's Incompleteness Theorem, and could be used for a one semester course on these topics. Volume I, Proposi
A Problem Course in Mathematical Logic
โ Scribed by Bilaniuk S.
- Book ID
- 106632518
- Year
- 1999
- Tongue
- English
- Weight
- 422 KB
- Edition
- version 1.5
- Volume
- Volume 1
- Category
- Library
- ISBN
- 0387900926
No coin nor oath required. For personal study only.
โฆ Synopsis
This is a text for a problem-oriented undergraduate course in mathematical logic. It covers the basics of propositionaland first-order logic through the Soundness, Completeness, and Compactness Theorems. Volume II, Computation, covers the basics of computability using Turing machines and recursive functions, the Incompleteness Theorems, and complexity theory through the P and NP. Information on availabality and the conditions under which this book may be used and reproduced are given in the preface.
๐ SIMILAR VOLUMES
A comprehensive one-year graduate (or advanced undergraduate) course in mathematical logic and foundations of mathematics. No previous knowledge of logic is required; the book is suitable for self-study. Many exercises (with hints) are included.
*A Course in Mathematical Logic for Mathematicians, Second Edition* offers a straightforward introduction to modern mathematical logic that will appeal to the intuition of working mathematicians. The book begins with an elementary introduction to formal languages and proceeds to a discussion of proo