Book 19

Kurt Godel, the greatest logician of our time, startled the world of mathematics in 1931 with his Theorem of Undecidability, which showed that some statements in mathematics are inherently "undecidable". His work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum theory brought him further worldwide fame.

In this introductory volume, Raymond Smullyan, himself a well-known logician, guides the reader through the fascinating world of Godel's incompleteness theorems. The level of presentation is suitable for anyone with a basic acquaintance with mathematical logic. As a clear, concise introduction to a difficult but essential subject, the book will appeal to mathematicians, philosophers, and computer scientists.

Book 22

This work is a sequel to the author's Goedel's Incompleteness Theorems, though it can be read independently by anyone familiar with Goedel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

Book 27

The main purpose of this book is to present a unified treatment of fixed points as they occur in Gödel's incompleteness proofs, recursion theory, combinatory logic, semantics, and metamathematics. The book provides a survey of introductory material and a summary of recent research. The first chapters are of an introductory nature and consist mainly of exercises with solutions given to most of them.

Book 34

Set Theory and the Continuum Problem is a novel introduction to set theory, including axiomatic development, consistency, and independence results. It is self-contained and covers all the set theory that a mathematician should know. This book is intended for graduate students and researchers in mathematical logic.

Computability Theory

by Melvin Fitting

Published 16 April 1987
This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG. It also considers LISP programming language and shows its relation to the PROLOG type of language. Advanced first-degree and graduate students of computer science; researchers in computer science and logic.