This work makes available to readers without specialized training in mathematics complete proofs of the fundamental metatheorems of standard (i.e., basically truth-functional) first order logic. Included is a complete proof, accessible to non-mathematicians, of the undecidability of first order logic, the most important fact about logic to emerge from the work of the last half-century. Hunter explains concepts of mathematics and set theory along the way for the benefit of non-mathematicians. He also provides ample exercises with comprehensive answers.

An Introduction to Metalogic is a uniquely accessible introduction to the metatheory of first-order predicate logic. No background knowledge of logic is presupposed, as the book is entirely self-contained and clearly defines all of the technical terms it employs. Yaqub begins with an introduction to predicate logic and ends with detailed outlines of the proofs of the incompleteness, undecidability, and indefinability theorems, covering many related topics in between.

An Introduction to Metalogic is a uniquely accessible introduction to the metatheory of first-order predicate logic. No background knowledge of logic is presupposed, as the book is entirely self-contained and clearly defines all of the technical terms it employs. Yaqub begins with an introduction to predicate logic and ends with detailed outlines of the proofs of the incompleteness, undecidability, and indefinability theorems, covering many related topics in between.

A textbook on the semantics, proof theory, and metatheory of first-order logic. It covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic. It is based on the Open Logic project, and available for free download at slc.openlogicproject.org.

Part I of this coherent, well-organized text deals with formal principles of inference and definition. Part II explores elementary intuitive set theory, with separate chapters on sets, relations, and functions. Ideal for undergraduates.

Logic for Philosophy is an introduction to logic for students of contemporary philosophy. It is suitable both for advanced undergraduates and for beginning graduate students in philosophy. It covers (i) basic approaches to logic, including proof theory and especially model theory, (ii) extensions of standard logic that are important in philosophy, and (iii) some elementary philosophy of logic. It emphasizes breadth rather than depth. For example, it discusses modal logic and counterfactuals, but does not prove the central metalogical results for predicate logic (completeness, undecidability, etc.) Its goal is to introduce students to the logic they need to know in order to read contemporary philosophical work. It is very user-friendly for students without an extensive background in mathematics. In short, this book gives you the understanding of logic that you need to do philosophy.

This book reclaims logic as a branch of philosophy, offering a self-contained and complete introduction to the three traditional systems of classical logic (term, sentence, and predicate logic) and the philosophical issues that surround those systems. The exposition is lucid, clear, and engaging. Practical methods are favored over the traditional, and creative approaches over the merely mechanical. The author’s guiding principle is to introduce classical logic in an intellectually honest way, and not to shy away from difficulties and controversies where they arise. Relevant philosophical issues, such as the relation between the meaning and the referent of a proper name, logical versus metaphysical possibility, and the conceptual content of an expression, are discussed throughout. In this way, the book is not only an introduction to the three main systems of classical logic, but also an introduction to the philosophy of classical logic.

Classical logic is traditionally introduced by itself, but that makes it seem arbitrary and unnatural. This text introduces classical alongside several nonclassical logics (relevant, constructive, quantative, paraconsistent).

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.

Elementary Logic explains what logic is, how it is done, and why it can be exciting. The book covers the central part of logic that all students have to learn: propositional logic. It aims to provide a crystal-clear introduction to what is often regarded as the most technically difficult area in philosophy. The book opens with an explanation of what logic is and how it is constructed. Subsequent chapters take the reader step-by-step through all aspects of elementary logic. Throughout, ideas are explained simply and directly, with the chapters packed with overviews, illustrative examples, and summaries. Each chapter builds on previous explanation and example, with the final chapters presenting more advanced methods. After a discussion of meta-logic and logical systems, the book closes with an exploration of how paradoxes can exist in the world of logic. Elementary Logic's clarity and engagement make it ideal for any reader studying logic for the first time.