Summary and Info
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.
Review and Comments
Rate the Book
A Problem Course in Mathematical Logic 0 out of 5 stars based on 0 ratings.