The handbook is divided into four parts: model theory, set theory, recursion theory and proof theory. Each of the four parts begins with a short guide to the chapters that follow. Each chapter is written for non-specialists in the field in question. Mathematicians will find that this book provides them with a unique opportunity to apprise themselves of developments in areas other than their own.

Written by a creative master of mathematical logic, this introductory text combines stories of great philosophers, quotations, and riddles with the fundamentals of mathematical logic. Author Raymond Smullyan offers clear, incremental presentations of difficult logic concepts. He highlights each subject with inventive explanations and unique problems. Smullyan's accessible narrative provides memorable examples of concepts related to proofs, propositional logic and first-order logic, incompleteness theorems, and incompleteness proofs. Additional topics include undecidability, combinatoric logic, and recursion theory. Suitable for undergraduate and graduate courses, this book will also amuse and enlighten mathematically minded readers. Dover (2014) original publication. See every Dover book in print at www.doverpublications.com

'A wealth of examples to which solutions are given permeate the text so the reader will certainly be active.'The Mathematical GazetteThis is the final book written by the late great puzzle master and logician, Dr. Raymond Smullyan.This book is a sequel to my Beginner's Guide to Mathematical Logic.The previous volume deals with elements of propositional and first-order logic, contains a bit on formal systems and recursion, and concludes with chapters on Gödel's famous incompleteness theorem, along with related results.The present volume begins with a bit more on propositional and first-order logic, followed by what I would call a 'fein' chapter, which simultaneously generalizes some results from recursion theory, first-order arithmetic systems, and what I dub a 'decision machine.' Then come five chapters on formal systems, recursion theory and metamathematical applications in a general setting. The concluding five chapters are on the beautiful subject of combinatory logic, which is not only intriguing in its own right, but has important applications to computer science. Argonne National Laboratory is especially involved in these applications, and I am proud to say that its members have found use for some of my results in combinatory logic.This book does not cover such important subjects as set theory, model theory, proof theory, and modern developments in recursion theory, but the reader, after studying this volume, will be amply prepared for the study of these more advanced topics.

The Summer School and Conference on Mathematical Logic and its Applications, September 24 - October 4, 1986, Druzhba, Bulgaria, was honourably dedicated to the 80-th anniversary of Kurt Godel (1906 - 1978), one of the greatest scientists of this (and not only of this) century. The main topics of the Meeting were: Logic and the Foundation of Mathematics; Logic and Computer Science; Logic, Philosophy, and the Study of Language; Kurt Godel's life and deed. The scientific program comprised 5 kinds of activities, namely: a) a Godel Session with 3 invited lecturers b) a Summer School with 17 invited lecturers c) a Conference with 13 contributed talks d) Seminar talks (one invited and 12 with no preliminary selection) e) three discussions The present volume reflects an essential part of this program, namely 14 of the invited lectures and all of the contributed talks. Not presented in the volltme remai ned si x of the i nvi ted lecturers who di d not submi t texts: Yu. Ershov - The Language of!:-expressions and its Semantics; S. Goncharov - Mathematical Foundations of Semantic Programming; Y. Moschovakis - Foundations of the Theory of Algorithms; N. Nagornyj - Is Realizability of Propositional Formulae a GBdelean Property; N. Shanin - Some Approaches to Finitization of Mathematical Analysis; V. Uspensky - Algorithms and Randomness - joint with A.N.

Noted logician discusses both theoretical underpinnings and practical applications, exploring set theory, model theory, recursion theory and constructivism, proof theory, logic's relation to computer science, and other subjects. 1981 edition, reissued by Dover in 1993 with a new Postscript by the author.

This two-volume work bridges the gap between introductory expositions of logic or set theory on one hand, and the research literature on the other. It can be used as a text in an advanced undergraduate or beginning graduate course in mathematics, computer science, or philosophy. The volumes are written in a user-friendly conversational lecture style that makes them equally effective for self-study or class use. Volume 1 includes formal proof techniques, a section on applications of compactness (including nonstandard analysis), a generous dose of computability and its relation to the incompleteness phenomenon, and the first presentation of a complete proof of Godel's 2nd incompleteness since Hilbert and Bernay's Grundlagen theorem.

Mathematical Logic: An Introduction is a textbook that uses mathematical tools to investigate mathematics itself. In particular, the concepts of proof and truth are examined. The book presents the fundamental topics in mathematical logic and presents clear and complete proofs throughout the text. Such proofs are used to develop the language of propositional logic and the language of first-order logic, including the notion of a formal deduction. The text also covers Tarski’s definition of truth and the computability concept. It also provides coherent proofs of Godel’s completeness and incompleteness theorems. Moreover, the text was written with the student in mind and thus, it provides an accessible introduction to mathematical logic. In particular, the text explicitly shows the reader how to prove the basic theorems and presents detailed proofs throughout the book. Most undergraduate books on mathematical logic are written for a reader who is well-versed in logical notation and mathematical proof. This textbook is written to attract a wider audience, including students who are not yet experts in the art of mathematical proof.

Mathematical Logic and Model Theory: A Brief Introduction offers a streamlined yet easy-to-read introduction to mathematical logic and basic model theory. It presents, in a self-contained manner, the essential aspects of model theory needed to understand model theoretic algebra. As a profound application of model theory in algebra, the last part of this book develops a complete proof of Ax and Kochen's work on Artin's conjecture about Diophantine properties of p-adic number fields. The character of model theoretic constructions and results differ quite significantly from that commonly found in algebra, by the treatment of formulae as mathematical objects. It is therefore indispensable to first become familiar with the problems and methods of mathematical logic. Therefore, the text is divided into three parts: an introduction into mathematical logic (Chapter 1), model theory (Chapters 2 and 3), and the model theoretic treatment of several algebraic theories (Chapter 4). This book will be of interest to both advanced undergraduate and graduate students studying model theory and its applications to algebra. It may also be used for self-study.

This volume celebrates the work of Petr Hájek on mathematical fuzzy logic and presents how his efforts have influenced prominent logicians who are continuing his work. The book opens with a discussion on Hájek's contribution to mathematical fuzzy logic and with a scientific biography of him, progresses to include two articles with a foundation flavour, that demonstrate some important aspects of Hájek's production, namely, a paper on the development of fuzzy sets and another paper on some fuzzy versions of set theory and arithmetic. Articles in the volume also focus on the treatment of vagueness, building connections between Hájek's favorite fuzzy logic and linguistic models of vagueness. Other articles introduce alternative notions of consequence relation, namely, the preservation of truth degrees, which is discussed in a general context, and the differential semantics. For the latter, a surprisingly strong standard completeness theorem is proved. Another contribution also looks at two principles valid in classical logic and characterize the three main t-norm logics in terms of these principles. Other articles, with an algebraic flavour, offer a summary of the applications of lattice ordered-groups to many-valued logic and to quantum logic, as well as an investigation of prelinearity in varieties of pointed lattice ordered algebras that satisfy a weak form of distributivity and have a very weak implication. The last part of the volume contains an article on possibilistic modal logics defined over MTL chains, a topic that Hájek discussed in his celebrated work, Metamathematics of Fuzzy Logic, and another one where the authors, besides offering unexpected premises such as proposing to call Hájek's basic fuzzy logic HL, instead of BL, propose a very weak system, called SL as a candidate for the role of the really basic fuzzy logic. The paper also provides a generalization of the prelinearity axiom, which was investigated by Hájek in the context of fuzzy logic.