This book is intended to be used as a textbook by students of mathematics, and also within limitations as a reference work.

The present text book is intended as an introduction to elementary logic. Its content, structure, and manner have been determined in large measure - perhaps 'caused' is the better word- by certain desiderata about which the reader should be informed at the outset. The leading idea is that even an introductory treatment of logic may profitably be fashioned around a rigorous framework.

A Mathematical Introduction to Logic, Second Edition, offers increased flexibility with topic coverage, allowing for choice in how to utilize the textbook in a course. The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional (...) coverage of introductory material such as sets. Increased flexibility of the text, allowing instructors more choice in how they use the textbook in courses. Reduced mathematical rigour to fit the needs of undergraduate students. (shrink)

Coherent, well organized text familiarizes readers with complete theory of logical inference and its applications to math and the empirical sciences. Part I deals with formal principles of inference and definition; Part II explores elementary intuitive set theory, with separate chapters on sets, relations, and functions. Last section introduces numerous examples of axiomatically formulated theories in both discussion and exercises. Ideal for undergraduates; no background in math or philosophy required.

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. (shrink)

Draws attention to some unexpected consequences of using a zero-ary connective in modal propositional logic.

8.3 The consistency proof -- 8.4 Applications of the consistency proof -- 8.5 Second-order arithmetic -- Problems -- Chapter 9: Set Theory -- 9.1 Axioms for sets -- 9.2 Development of set theory -- 9.3 Ordinals -- 9.4 Cardinals -- 9.5 Interpretations of set theory -- 9.6 Constructible sets -- 9.7 The axiom of constructibility -- 9.8 Forcing -- 9.9 The independence proofs -- 9.10 Large cardinals -- Problems -- Appendix The Word Problem -- Index.

INTRODUCTION In ita original form the present paper was presented to the American Mathematical Society, April 2k,, as a companion piece to the writer's ...