The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in mathematical logic. This edition includes an extensive appendix on second-order logic, a section on set theory with urlements, and a section on the logic that results when we allow models with empty domains. The text contains numerous exercises and an appendix furnishes answers to many of them. Introduction to Mathematical Logic includes: propositional logic first-order logic first-order number theory and the incompleteness and undecidability theorems of Gödel, Rosser, Church, and Tarski axiomatic set theory theory of computability The study of mathematical logic, axiomatic set theory, and computability theory provides an understanding of the fundamental assumptions and proof techniques that form basis of mathematics. Logic and computability theory have also become indispensable tools in theoretical computer science, including artificial intelligence. Introduction to Mathematical Logic covers these topics in a clear, reader-friendly style that will be valued by anyone working in computer science as well as lecturers and researchers in mathematics, philosophy, and related fields.

This introductory graduate text covers modern mathematical logic from propositional, first-order and infinitary logic and Gödel's Incompleteness Theorems to extensive introductions to set theory, model theory and recursion (computability) theory. Based on the author's more than 35 years of teaching experience, the book develops students' intuition by presenting complex ideas in the simplest context for which they make sense. The book is appropriate for use as a classroom text, for self-study, and as a reference on the state of modern logic.

This is a mathematics textbook with theorems and proofs. The choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. In order to provide a balanced treatment of logic, tableaux are related to deductive proof systems. The book presents various logical systems and contains exercises. Still further, Prolog source code is available on an accompanying Web site. The author is an Associate Professor at the Department of Science Teaching, Weizmann Institute of Science.

This book offers a unique opportunity to understand the essence of one of the great thinkers of western civilization. A guided reading of Euclid's Elements leads to a critical discussion and rigorous modern treatment of Euclid's geometry and its more recent descendants, with complete proofs. Topics include the introduction of coordinates, the theory of area, history of the parallel postulate, the various non-Euclidean geometries, and the regular and semi-regular polyhedra.

This text for a second course in linear algebra, aimed at math majors and graduates, adopts a novel approach by banishing determinants to the end of the book and focusing on understanding the structure of linear operators on vector spaces. The author has taken unusual care to motivate concepts and to simplify proofs. For example, the book presents - without having defined determinants - a clean proof that every linear operator on a finite-dimensional complex vector space has an eigenvalue. The book starts by discussing vector spaces, linear independence, span, basics, and dimension. Students are introduced to inner-product spaces in the first half of the book and shortly thereafter to the finite- dimensional spectral theorem. A variety of interesting exercises in each chapter helps students understand and manipulate the objects of linear algebra. This second edition features new chapters on diagonal matrices, on linear functionals and adjoints, and on the spectral theorem; some sections, such as those on self-adjoint and normal operators, have been entirely rewritten; and hundreds of minor improvements have been made throughout the text.

Written in a clear, precise and user-friendly style, Logic as a Tool: A Guide to Formal Logical Reasoning is intended for undergraduates in both mathematics and computer science, and will guide them to learn, understand and master the use of classical logic as a tool for doing correct reasoning. It offers a systematic and precise exposition of classical logic with many examples and exercises, and only the necessary minimum of theory. The book explains the grammar, semantics and use of classical logical languages and teaches the reader how grasp the meaning and translate them to and from natural language. It illustrates with extensive examples the use of the most popular deductive systems -- axiomatic systems, semantic tableaux, natural deduction, and resolution -- for formalising and automating logical reasoning both on propositional and on first-order level, and provides the reader with technical skills needed for practical derivations in them. Systematic guidelines are offered on how to perform logically correct and well-structured reasoning using these deductive systems and the reasoning techniques that they employ. •Concise and systematic exposition, with semi-formal but rigorous treatment of the minimum necessary theory, amply illustrated with examples •Emphasis both on conceptual understanding and on developing practical skills •Solid and balanced coverage of syntactic, semantic, and deductive aspects of logic •Includes extensive sets of exercises, many of them provided with solutions or answers •Supplemented by a website including detailed slides, additional exercises and solutions For more information browse the book's website at: https://logicasatool.wordpress.com

This revised and updated fourth edition designed for upper division courses in linear algebra includes the basic results on vector spaces over fields, determinants, the theory of a single linear transformation, and inner product spaces. While it does not presuppose an earlier course, many connections between linear algebra and calculus are worked into the discussion. A special feature is the inclusion of sections devoted to applications of linear algebra, which can either be part of a course, or used for independent study, and new to this edition is a section on analytic methods in matrix theory, with applications to Markov chains in probability theory. Proofs of all the main theorems are included, and are presented on an equal footing with methods for solving numerical problems. Worked examples are integrated into almost every section, to bring out the meaning of the theorems, and illustrate techniques for solving problems. Many numerical exercises make use of all the ideas, and develop computational skills, while exercises of a theoretical nature provide opportunities for students to discover for themselves.

The traditional debate among philosophers of mathematics is whether there is an external mathematical reality, something out there to be discovered, or whether mathematics is the product of the human mind. This provocative book, now available in a revised and expanded paperback edition, goes beyond foundationalist questions to offer what has been called a "postmodern" assessment of the philosophy of mathematics--one that addresses issues of theoretical importance in terms of mathematical experience. By bringing together essays of leading philosophers, mathematicians, logicians, and computer scientists, Thomas Tymoczko reveals an evolving effort to account for the nature of mathematics in relation to other human activities. These accounts include such topics as the history of mathematics as a field of study, predictions about how computers will influence the future organization of mathematics, and what processes a proof undergoes before it reaches publishable form. This expanded edition now contains essays by Penelope Maddy, Michael D. Resnik, and William P. Thurston that address the nature of mathematical proofs. The editor has provided a new afterword and a supplemental bibliography of recent work.

Designed for students having no previous experience with rigorous proofs, this text can be used immediately after standard calculus courses. It is highly recommended for anyone planning to study advanced analysis, as well as for future secondary school teachers. A limited number of concepts involving the real line and functions on the real line are studied, while many abstract ideas, such as metric spaces and ordered systems, are avoided completely. A thorough treatment of sequences of numbers is used as a basis for studying standard calculus topics, and optional sections invite students to study such topics as metric spaces and Riemann-Stieltjes integrals.

A First Course in Logic is an introduction to first-order logic suitable for first and second year mathematicians and computer scientists. There are three components to this course: propositional logic; Boolean algebras; and predicate/first-order, logic. Logic is the basis of proofs in mathematics — how do we know what we say is true? — and also of computer science — how do I know this program will do what I think it will? Surprisingly little mathematics is needed to learn and understand logic (this course doesn't involve any calculus). The real mathematical prerequisite is an ability to manipulate symbols: in other words, basic algebra. Anyone who can write programs should have this ability.