This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but also optional topics that include Turing's theory of computability and Ramsey's theorem.

Forever Undecided is the most challenging yet of Raymond Smullyan’s puzzle collections. It is, at the same time, an introduction—ingenious, instructive, entertaining—to Gödel’s famous theorems. With all the wit and charm that have delighted readers of his previous books, Smullyan transports us once again to that magical island where knights always tell the truth and knaves always lie. Here we meet a new and amazing array of characters, visitors to the island, seeking to determine the natives’ identities. Among them: the census-taker McGregor; a philosophical-logician in search of his flighty bird-wife, Oona; and a regiment of Reasoners (timid ones, normal ones, conceited, modest, and peculiar ones) armed with the rules of propositional logic (if X is true, then so is Y). By following the Reasoners through brain-tingling exercises and adventures—including journeys into the “other possible worlds” of Kripke semantics—even the most illogical of us come to understand Gödel’s two great theorems on incompleteness and undecidability, some of their philosophical and mathematical implications, and why we, like Gödel himself, must remain Forever Undecided!

Discrete Structure, Logic, and Computability introduces the beginning computer science student to some of the fundamental ideas and techniques used by computer scientists today, focusing on discrete structures, logic, and computability. The emphasis is on the computational aspects, so that the reader can see how the concepts are actually used. Because of logic's fundamental importance to computer science, the topic is examined extensively in three phases that cover informal logic, the technique of inductive proof; and formal logic and its applications to computer science.

George Boolos was one of the most prominent and influential logician-philosophers of recent times. This collection, nearly all chosen by Boolos himself shortly before his death, includes thirty papers on set theory, second-order logic, and plural quantifiers; on Frege, Dedekind, Cantor, and Russell; and on miscellaneous topics in logic and proof theory, including three papers on various aspects of the Gödel theorems. Boolos is universally recognized as the leader in the renewed interest in studies of Frege's work on logic and the philosophy of mathematics. John Burgess has provided introductions to each of the three parts of the volume, and also an afterword on Boolos's technical work in provability logic, which is beyond the scope of this volume.

The interplay between computability and randomness has been an active area of research in recent years, reflected by ample funding in the USA, numerous workshops, and publications on the subject. The complexity and the randomness aspect of a set of natural numbers are closely related. Traditionally, computability theory is concerned with the complexity aspect. However, computability theoretic tools can also be used to introduce mathematical counterparts for the intuitive notion of randomness of a set. Recent research shows that, conversely, concepts and methods originating from randomness enrich computability theory. The book covers topics such as lowness and highness properties, Kolmogorov complexity, betting strategies and higher computability. Both the basics and recent research results are desribed, providing a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.

Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation. Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself. Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.