Volume II, on formal (ZFC) set theory, incorporates a self-contained "chapter 0" on proof techniques so that it is based on formal logic, in the style of Bourbaki. The emphasis on basic techniques provides a solid foundation in set theory and a thorough context for the presentation of advanced topics (such as absoluteness, relative consistency results, two expositions of Godel's construstive universe, numerous ways of viewing recursion and Cohen forcing).

Between inventing the concept of a universal computer in 1936 and breaking the German Enigma code during World War II, Alan Turing (1912-1954), the British founder of computer science and artificial intelligence, came to Princeton University to study mathematical logic. Some of the greatest logicians in the world--including Alonzo Church, Kurt Godel, John von Neumann, and Stephen Kleene--were at Princeton in the 1930s, and they were working on ideas that would lay the groundwork for what would become known as computer science. This book presents a facsimile of the original typescript of Turing's fascinating and influential 1938 Princeton PhD thesis, one of the key documents in the history of mathematics and computer science. The book also features essays by Andrew Appel and Solomon Feferman that explain the still-unfolding significance of the ideas Turing developed at Princeton.

A work of philosophy as well as mathematics, Turing's thesis envisions a practical goal--a logical system to formalize mathematical proofs so they can be checked mechanically. If every step of a theorem could be verified mechanically, the burden on intuition would be limited to the axioms. Turing's point, as Appel writes, is that "mathematical reasoning can be done, and should be done, in mechanizable formal logic." Turing's vision of "constructive systems of logic for practical use" has become reality: in the twenty-first century, automated "formal methods" are now routine.

Presented here in its original form, this fascinating thesis is one of the key documents in the history of mathematics and computer science."

The book is a concise, self-contained and fully updated introduction to automata theory - a fundamental topic of computer sciences and engineering. The material is presented in a rigorous yet convincing way and is supplied with a wealth of examples, exercises and down-to-the earth convincing explanatory notes. An ideal text to a spectrum of one-term courses in computer sciences, both at the senior undergraduate and graduate students.

Is mathematics 'entangled' with its various formalisations? Or are the central concepts of mathematics largely insensitive to formalisation, or 'formalism free'? What is the semantic point of view and how is it implemented in foundational practice? Does a given semantic framework always have an implicit syntax? Inspired by what she calls the 'natural language moves' of Goedel and Tarski, Juliette Kennedy considers what roles the concepts of 'entanglement' and 'formalism freeness' play in a range of logical settings, from computability and set theory to model theory and second order logic, to logicality, developing an entirely original philosophy of mathematics along the way. The treatment is historically, logically and set-theoretically rich, and topics such as naturalism and foundations receive their due, but now with a new twist.

This book is a modern introduction to model theory which stresses applications to algebra throughout the text. The first half of the book includes classical material on model construction techniques, type spaces, prime models, saturated models, countable models, and indiscernibles and their applications. The author also includes an introduction to stability theory beginning with Morley's Categoricity Theorem and concentrating on omega-stable theories. One significant aspect of this text is the inclusion of chapters on important topics not covered in other introductory texts, such as omega-stable groups and the geometry of strongly minimal sets. The author then goes on to illustrate how these ingredients are used in Hrushovski's applications to diophantine geometry. David Marker is Professor of Mathematics at the University of Illinois at Chicago. His main area of research involves mathematical logic and model theory, and their applications to algebra and geometry. This book was developed from a series of lectures given by the author at the Mathematical Sciences Research Institute in 1998.

The proceedings of the Los Angeles Caltech-UCLA 'Cabal Seminar' were originally published in the 1970s and 1980s. Large Cardinals, Determinacy and Other Topics is the final volume in a series of four books collecting the seminal papers from the original volumes together with extensive unpublished material, new papers on related topics and discussion of research developments since the publication of the original volumes. This final volume contains Parts VII and VIII of the series. Part VII focuses on 'Extensions of AD, models with choice', while Part VIII ('Other topics') collects material important to the Cabal that does not fit neatly into one of its main themes. These four volumes will be a necessary part of the book collection of every set theorist.

This quick yet detailed introduction to set theory and forcing builds the reader's intuition about it as much as the mathematical detail. Intuition, rather absent from the existing literature on the subject, here plays a large role. The reader will not only learn the facts, but will understand why they are true and will be brought to ask: what else could be true? Having presented forcing in Part I, the second part of the book discusses contemporary issues in the theory of forcing. It includes known and some previously unpublished results as well as many open questions. This is ideal for those who want to start a research career in forcing but do not have a personal interlocutor. Obviously, not everything about forcing is in this book. Many references are included to help the reader further explore the vast amount of research literature available on the subject.

This quick yet detailed introduction to set theory and forcing builds the reader's intuition about it as much as the mathematical detail. Intuition, rather absent from the existing literature on the subject, here plays a large role. The reader will not only learn the facts, but will understand why they are true and will be brought to ask: what else could be true? Having presented forcing in Part I, the second part of the book discusses contemporary issues in the theory of forcing. It includes known and some previously unpublished results as well as many open questions. This is ideal for those who want to start a research career in forcing but do not have a personal interlocutor. Obviously, not everything about forcing is in this book. Many references are included to help the reader further explore the vast amount of research literature available on the subject.

This volume celebrates the work of Petr Hajek 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 Hajek'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 Hajek'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 Hajek'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 Hajek discussed in his celebrated work, Metamathematics of Fuzzy Logic, and another one where the authors, besides offering unexpected premises such as proposing to call Hajek'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 Hajek in the context of fuzzy logic."

Proofs play a central role in advanced mathematics and theoretical computer science, yet many students struggle the first time they take a course in which proofs play a significant role. This bestselling text's third edition helps students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs. Featuring over 150 new exercises and a new chapter on number theory, this new edition introduces students to the world of advanced mathematics through the mastery of proofs. The book begins with the basic concepts of logic and set theory to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for an analysis of techniques that can be used to build up complex proofs step by step, using detailed 'scratch work' sections to expose the machinery of proofs about numbers, sets, relations, and functions. Assuming no background beyond standard high school mathematics, this book will be useful to anyone interested in logic and proofs: computer scientists, philosophers, linguists, and, of course, mathematicians.

Spatial Reasoning Puzzles That Make Kids Think! engages even the most reluctant math learner. In this fun and challenging book, students must conquer four types of logical and spatial reasoning puzzles (Slitherlink, Hashiwokakero, Masyu, and Yajilin). The rules for each type of puzzle are very different, but easy to understand. The challenge is for students to apply their critical thinking skills to new situations and develop new strategies for solving each puzzle. Teacher support is provided for solving the puzzles and also for helping students to create puzzles of their own. Students will be begging for more of these unique spatial reasoning puzzles! Grades 6-8

The last two decades have seen a wave of exciting new developments in the theory of algorithmic randomness and its applications to other areas of mathematics. This volume surveys much of the recent work that has not been included in published volumes until now. It contains a range of articles on algorithmic randomness and its interactions with closely related topics such as computability theory and computational complexity, as well as wider applications in areas of mathematics including analysis, probability, and ergodic theory. In addition to being an indispensable reference for researchers in algorithmic randomness, the unified view of the theory presented here makes this an excellent entry point for graduate students and other newcomers to the field.

The concepts of a locally presentable category and an accessible category have turned out to be useful in formulating connections between universal algebra, model theory, logic and computer science. The aim of this book is to provide an exposition of both the theory and the applications of these categories at a level accessible to graduate students. Firstly the properties of l-presentable objects, locally l-presentable categories, and l-accessible categories are discussed in detail, and the equivalence of accessible and sketchable categories is proved. The authors go on to study categories of algebras and prove that Freyd's essentially algebraic categories are precisely the locally presentable categories. In the final chapters they treat some topics in model theory and some set theoretical aspects. For researchers in category theory, algebra, computer science, and model theory, this book will be a necessary purchase.

This junior/senior level text is devoted to a study of first-order logic and its role in the foundations of mathematics: What is a proof? How can a proof be justified? To what extent can a proof be made a purely mechanical procedure? How much faith can we have in a proof that is so complex that no one can follow it through in a lifetime? The first substantial answers to these questions have only been obtained in this century. The most striking results are contained in Goedel's work: First, it is possible to give a simple set of rules that suffice to carry out all mathematical proofs; but, second, these rules are necessarily incomplete - it is impossible, for example, to prove all true statements of arithmetic. The book begins with an introduction to first-order logic, Goedel's theorem, and model theory. A second part covers extensions of first-order logic and limitations of the formal methods. The book covers several advanced topics, not commonly treated in introductory texts, such as Trachtenbrot's undecidability theorem. Fraissé's elementary equivalence, and Lindstroem's theorem on the maximality of first-order logic.

Proofs play a central role in advanced mathematics and theoretical computer science, yet many students struggle the first time they take a course in which proofs play a significant role. This bestselling text's third edition helps students transition from solving problems to proving theorems by teaching them the techniques needed to read and write proofs. Featuring over 150 new exercises and a new chapter on number theory, this new edition introduces students to the world of advanced mathematics through the mastery of proofs. The book begins with the basic concepts of logic and set theory to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for an analysis of techniques that can be used to build up complex proofs step by step, using detailed 'scratch work' sections to expose the machinery of proofs about numbers, sets, relations, and functions. Assuming no background beyond standard high school mathematics, this book will be useful to anyone interested in logic and proofs: computer scientists, philosophers, linguists, and, of course, mathematicians.

Classical logic is concerned, loosely, with the behaviour of truths. Epistemic logic similarly is about the behaviour of known or believed truths. Justification logic is a theory of reasoning that enables the tracking of evidence for statements and therefore provides a logical framework for the reliability of assertions. This book, the first in the area, is a systematic account of the subject, progressing from modal logic through to the establishment of an arithmetic interpretation of intuitionistic logic. The presentation is mathematically rigorous but in a style that will appeal to readers from a wide variety of areas to which the theory applies. These include mathematical logic, artificial intelligence, computer science, philosophical logic and epistemology, linguistics, and game theory.

Model theory begins with an audacious idea: to consider statements about mathematical structures as mathematical objects of study in their own right. While inherently important as a tool of mathematical logic, it also enjoys connections to and applications in diverse branches of mathematics, including algebra, number theory and analysis. Despite this, traditional introductions to model theory assume a graduate-level background of the reader. In this innovative textbook, Jonathan Kirby brings model theory to an undergraduate audience. The highlights of basic model theory are illustrated through examples from specific structures familiar from undergraduate mathematics, paying particular attention to definable sets throughout. With numerous exercises of varying difficulty, this is an accessible introduction to model theory and its place in mathematics.

Spectral spaces are a class of topological spaces. They are a tool linking algebraic structures, in a very wide sense, with geometry. They were invented to give a functional representation of Boolean algebras and distributive lattices and subsequently gained great prominence as a consequence of Grothendieck's invention of schemes. There are more than 1,000 research articles about spectral spaces, but this is the first monograph. It provides an introduction to the subject and is a unified treatment of results scattered across the literature, filling in gaps and showing the connections between different results. The book includes new research going beyond the existing literature, answering questions that naturally arise from this comprehensive approach. The authors serve graduates by starting gently with the basics. For experts, they lead them to the frontiers of current research, making this book a valuable reference source.

This proceedings volume contains research papers in mathematical logic, especially in model theory and its applications to algebra and formal theories of arithmetic. Other papers address interpretability theory, computable analysis, modal logic, and the history of mathematical logic in Iran. The conference was held in Tehran, Iran, in October 2003, with the expressed purpose of bringing together researchers with connections to Iranian logicians and promoting further research in mathematical logic in Iran.

The notion of an ( ,1)-category has become widely used in homotopy theory, category theory, and in a number of applications. There are many different approaches to this structure, all of them equivalent, and each with its corresponding homotopy theory. This book provides a relatively self-contained source of the definitions of the different models, the model structure (homotopy theory) of each, and the equivalences between the models. While most of the current literature focusses on how to extend category theory in this context, and centers in particular on the quasi-category model, this book offers a balanced treatment of the appropriate model structures for simplicial categories, Segal categories, complete Segal spaces, quasi-categories, and relative categories, all from a homotopy-theoretic perspective. Introductory chapters provide background in both homotopy and category theory and contain many references to the literature, thus making the book accessible to graduates and to researchers in related areas.

The notion of an ( ,1)-category has become widely used in homotopy theory, category theory, and in a number of applications. There are many different approaches to this structure, all of them equivalent, and each with its corresponding homotopy theory. This book provides a relatively self-contained source of the definitions of the different models, the model structure (homotopy theory) of each, and the equivalences between the models. While most of the current literature focusses on how to extend category theory in this context, and centers in particular on the quasi-category model, this book offers a balanced treatment of the appropriate model structures for simplicial categories, Segal categories, complete Segal spaces, quasi-categories, and relative categories, all from a homotopy-theoretic perspective. Introductory chapters provide background in both homotopy and category theory and contain many references to the literature, thus making the book accessible to graduates and to researchers in related areas.

Hilbert's Programs & Beyond presents the foundational work of David Hilbert in a sequence of thematically organized essays. They first trace the roots of Hilbert's work to the radical transformation of mathematics in the 19th century and bring out his pivotal role in creating mathematical logic and proof theory. They then analyze techniques and results of "classical" proof theory as well as their dramatic expansion in modern proof theory. This intellectual experience finally opens horizons for reflection on the nature of mathematics in the 21st century: Sieg articulates his position of reductive structuralism and explores mathematical capacities via computational models.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the fourth publication in the Lecture Notes in Logic series, Miller develops the necessary features of the theory of descriptive sets in order to present a new proof of Louveau's separation theorem for analytic sets. While some background in mathematical logic and set theory is assumed, the material is based on a graduate course given by the author at the University of Wisconsin, Madison, and is thus accessible to students and researchers alike in these areas, as well as in mathematical analysis.