Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
Skip header Section
Introduction to Mathematical LogicAugust 2009
Publisher:
  • Chapman & Hall/CRC
ISBN:978-1-58488-876-5
Published:11 August 2009
Pages:
469
Skip Bibliometrics Section
Reflects downloads up to 01 Sep 2024Bibliometrics
Skip Abstract Section
Abstract

Retaining all the key features of the previous editions, Introduction to Mathematical Logic, Fifth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of Gdel, Church, Kleene, Rosser, and Turing.New to the Fifth Edition A new section covering basic ideas and results about nonstandard models of number theoryA second appendix that introduces modal propositional logicAn expanded bibliography Additional exercises and selected answers This long-established text continues to expose students to natural proofs and set-theoretic methods. Only requiring some experience in abstract mathematical thinking, it offers enough material for either a one- or two-semester course on mathematical logic.

Cited By

  1. Naumov P and Yuan Y (2021). Intelligence in Strategic Games, Journal of Artificial Intelligence Research, 71, (521-556), Online publication date: 10-Sep-2021.
  2. Azimipour S and Naumov P (2021). Axiomatic theory of betweenness, Archive for Mathematical Logic, 60:1-2, (227-239), Online publication date: 1-Feb-2021.
  3. Obrenović N, Luković I and Ristić S (2019). Consolidation of database check constraints, Software and Systems Modeling (SoSyM), 18:3, (2111-2135), Online publication date: 1-Jun-2019.
  4. Chen X and Roşu G Matching μ-logic Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
  5. Kumar R, Arthan R, Myreen M and Owens S (2016). Self-Formalisation of Higher-Order Logic, Journal of Automated Reasoning, 56:3, (221-259), Online publication date: 1-Mar-2016.
  6. Vargas-Vera M (2016). Methodology for the Elaboration of Quizzes using Propositional Logic Calculus in an E-Learning Environment, International Journal of Knowledge Society Research, 7:4, (63-74), Online publication date: 1-Oct-2016.
  7. Domracheva A and Shapkin P (2016). Type-theoretic Means for Querying Heterogeneous Data Sources Available via Cloud APIs, Procedia Computer Science, 96:C, (951-960), Online publication date: 1-Oct-2016.
  8. (2016). Kripke-type Semantics for CG3', Electronic Notes in Theoretical Computer Science (ENTCS), 328:C, (17-29), Online publication date: 8-Dec-2016.
  9. Bair L and Tolk A Towards a unified theory of validation Proceedings of the 2013 Winter Simulation Conference: Simulation: Making Decisions in a Complex World, (1245-1256)
  10. Estrada O, Arrazola J and Osorio M A possibilistic intuitionistic logic Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I, (362-373)
  11. Casagrande A, Piazza C and Policriti A (2009). Discrete Semantics for Hybrid Automata, Discrete Event Dynamic Systems, 19:4, (471-493), Online publication date: 1-Dec-2009.
  12. Bengio Y (2009). Learning Deep Architectures for AI, Foundations and Trends® in Machine Learning, 2:1, (1-127), Online publication date: 1-Jan-2009.
  13. Alonso J, Magdalena L and González-Rodríguez G (2009). Looking for a good fuzzy system interpretability index, International Journal of Approximate Reasoning, 51:1, (115-134), Online publication date: 1-Dec-2009.
  14. Cohen A Anaphora resolution as equality by default Proceedings of the 6th discourse anaphora and anaphor resolution conference on Anaphora: analysis, algorithms and applications, (44-58)
  15. Vaillant S A finite first-order presentation of set theory Proceedings of the 2002 international conference on Types for proofs and programs, (316-330)
Contributors
  • The City University of New York

Index Terms

  1. Introduction to Mathematical Logic

      Reviews

      Edgar R. Chavez

      Since it first appeared in 1964, Mendelson's book has been recognized as an excellent textbook in the field. It is one of the most frequently mentioned texts in references and recommended reading lists. The fifth edition has a few additions that add to its value: a new section about nonstandard models of arithmetic; an appendix about modal logic that Mendelson carefully titles "First Steps in Propositional Logic," thereby clearly indicating the level of coverage he intends to present; an expanded and updated bibliography that highlights the ever-widening amount of work in the field; and additional exercises (and selected answers), in which the reader will find ample opportunity to work at different levels of difficulty. Mathematical logic is an area where philosophy, computer science, and mathematics intersect. Mathematical logic is an active, fruitful area of research in all three disciplines. This book is a clear, concise, mathematically rigorous introduction to a large field. Mendelson does an excellent job of meeting the needs of computer scientists and mathematicians. Philosophy students may need to stretch their intellectual muscles to tackle the mathematics in this textbook. For one thing, readers need to be completely comfortable reading and doing mathematical proofs. For those who feel the need for a gentle but thorough introduction to proofs, I recommend Velleman's book [1], which will also help readers acquire a solid acquaintance with the mechanics of predicate logic and quantificational logic. Thompson's excellent review of the third edition of the book [2] does an excellent job of placing the book in the context of computer science and summarizing its contents. I fully agree with his assessment that "this is a first-class textbook in mathematical logic, with much to offer the computer scientist." This book rightfully belongs in the small, elite set of superb books that every computer science graduate, graduate student, scientist, and teacher should be familiar with. Students with adequate background will find Mendelson's book a fecund source of study and enjoyment. The book is also superb for self-study, as readers will welcome the clear style, the attention to precise definitions, the footnotes that highlight and expand concepts that need extra consideration, and the natural progression of theory built on incremental steps from proposition to proposition (propositions are really metatheorems, a concept lucidly explained on page 27). The bibliography is current and extensive. Additionally, Mendelson points out the most helpful references within the text itself, when appropriate. As I have already mentioned, examples and exercises are plentiful and of high quality. Some exercises are meant to fill out details or expand material introduced in the text. Difficult exercises and those that require familiarity with material not fully developed in the text are clearly marked. All readers, but particularly those studying on their own, will be greatly rewarded if they work on all of them. Mendelson includes solutions and hints to a good selection of exercises. The table of contents of the fifth edition can be found on the publisher's Web site [3]. Online Computing Reviews Service

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.

      Recommendations