This is a text for a problemoriented undergraduatecourse in mathematical logic. It covers the basics of propositionaland rstorder logic through the Soundness, Completeness, andCompactness Theorems. Volume II, Computation, covers the basicsof computability using Turing machines and recursive functions,the Incompleteness Theorems, and complexity theory throughthe P and NP.Information on availabality and the conditions under whichthis book may be used and reproduced are given in the preface.

Authors: Bilaniuk S.  Pages: 95 Year: 1999 
Tags: problem course mathematical   Customers who bought this item also bought: 