This fourth edition of one of the classic logic textbooks has been thoroughly revised by John Burgess. The aim is to increase the pedagogical value of the book for the core market of students of philosophy and for students of mathematics and computer science as well. This book has become a classic because of its accessibility to students without a mathematical background, and because it covers not simply the staple topics of an intermediate logic course such as Godel's Incompleteness Theorems, (...) but also a large number of optional topics from Turing's theory of computability to Ramsey's theorem. John Burgess has now enhanced the book by adding a selection of problems at the end of each chapter, and by reorganising and rewriting chapters to make them more independent of each other and thus to increase the range of options available to instructors as to what to cover and what to defer. (shrink)

The Oxford Translation of Aristotle was originally published in 12 volumes between 1912 and 1954. It is universally recognized as the standard English version of Aristotle. This revised edition contains the substance of the original Translation, slightly emended in light of recent scholarship three of the original versions have been replaced by new translations and a new and enlarged selection of Fragments has been added. The aim of the translation remains the same: to make the surviving works of Aristotle readily (...) accessible to English speaking readers. (shrink)

Considered by many to be Abraham Robinson's magnum opus, this book offers an explanation of the development and applications of non-standard analysis by the mathematician who founded the subject. Non-standard analysis grew out of Robinson's attempt to resolve the contradictions posed by infinitesimals within calculus. He introduced this new subject in a seminar at Princeton in 1960, and it remains as controversial today as it was then. This paperback reprint of the 1974 revised edition is indispensable reading for anyone interested (...) in non-standard analysis. It treats in rich detail many areas of application, including topology, functions of a real variable, functions of a complex variable, and normed linear spaces, together with problems of boundary layer flow of viscous fluids and rederivations of Saint-Venant's hypothesis concerning the distribution of stresses in an elastic body. (shrink)

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 ...

This work makes available to readers without specialized training in mathematics complete proofs of the fundamental metatheorems of standard (i.e., basically ...

Suitable for advanced undergraduates and graduate students from diverse fields and varying backgrounds, this self-contained course in mathematical logic features numerous exercises that vary in difficulty. The author is a Professor of Mathematics at the University of Wisconsin.

Logic is essential to correct reasoning and also has important theoretical applications in philosophy, computer science, linguistics, and mathematics. This book provides an exceptionally clear introduction to classical logic, with a unique approach that emphasizes both the hows and whys of logic. Here Nicholas Smith thoroughly covers the formal tools and techniques of logic while also imparting a deeper understanding of their underlying rationales and broader philosophical significance. In addition, this is the only introduction to logic available today that presents (...) all the major forms of proof--trees, natural deduction in all its major variants, axiomatic proofs, and sequent calculus. The book also features numerous exercises, with solutions available on an accompanying website. -/- Logic is the ideal textbook for undergraduates and graduate students seeking a comprehensive and accessible introduction to the subject. -/- Provides an essential introduction to classical logic Emphasizes the how and why of logic Covers both formal and philosophical issues Presents all the major forms of proof--from trees to sequent calculus Features numerous exercises, with solutions available online The ideal textbook for undergraduates and graduate students . (shrink)

Different formal tools are useful for different purposes. For example, when it comes to modelling degrees of belief, probability theory is a better tool than classical logic; when it comes to modelling the truth of mathematical claims, classical logic is a better tool than probability theory. In this paper I focus on a widely used formal tool and argue that it does not provide a good model of a phenomenon of which many think it does provide a good model: I (...) shall argue that while supervaluationism may provide a model of probability of truth, or of assertability, it cannot provide a good model of truth -- supertruth cannot be truth. The core of the argument is that an adequate model of truth must render certain connectives truth-functional (at least in certain circumstances) -- and supervaluationism does not do so (in those circumstances). (shrink)

Tarski's model-theoretic truth definition of the 1950s differs from his 1930s truth definition by allowing the language to have a set of parameters that are interpreted by means of structures. The paper traces how the model-theoretic theorems that Tarski and others were proving in the period between these two truth definitions became increasingly difficult to fit into the framework of the earlier truth definition, making the later one more or less inevitable. The paper also maintains that neither recursiveness nor satisfaction (...) are essential features of the truth definition . The recursive form was a ‘practical’ step towards the explicit definition that was Tarski's target. There are model-theoretic languages for which satisfaction is provably too crude a notion for expressing those properties of formulas that are needed for determining the truth of sentences. (shrink)

As Wilfrid Hodges has observed, there is no mention of the notion truth-in-a-model in Tarski's article 'The Concept of Truth in Formalized Languages'; nor does truth make many appearances in his papers on model theory from the early 1950s. In later papers from the same decade, however, this reticence is cast aside. Why should Tarski, who defined truth for formalized languages and pretty much founded model theory, have been so reluctant to speak of truth in a model? What might explain (...) the change in his practice? The answers, I believe, lie in Tarski's views on truth simpliciter. (shrink)

Wilfrid Hodges; VIII*—Truth in a Structure, Proceedings of the Aristotelian Society, Volume 86, Issue 1, 1 June 1986, Pages 135–152, https://doi.org/10.1093/ari.

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)

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.