This is the Volume II of a text for a problemorientedundergraduate course in mathematical logic. It covers the basicsof computability, using Turing machines and recursive functions,and G¨odel's Incompleteness Theorem, and could be used for a onesemestercourse on these topics. Volume I, Propositional and FirstOrder Logic, covers the basics of these topics through the Soundness,Completeness, and Compactness Theorems.Information on availability and the conditions under which thisbook may be used and reproduced are given in the preface.

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