Author: David Hilbert
Publisher: American Mathematical Soc.
Release Date: 1950
David Hilbert was particularly interested in the foundations of mathematics. Among many other things, he is famous for his attempt to axiomatize mathematics. This now classic text is his treatment of symbolic logic. This translation is based on the second German edition and has been modified according to the criticisms of Church and Quine. In particular, the authors' original formulation of Godel's completeness proof for the predicate calculus has been updated. In the first half of the twentieth century, an important debate on the foundations of mathematics took place. Principles of Mathematical Logic represents one of Hilbert's important contributions to that debate. Although symbolic logic has grown considerably in the subsequent decades, this book remains a classic.
The History of Philosophical and Formal Logic introduces ideas and thinkers central to the development of philosophical and formal logic. From its Aristotelian origins to the present-day arguments, logic is broken down into four main time periods: Antiquity and the Middle Ages (Aristotle and The Stoics) The early modern period (Bolzano, Boole) High modern period (Frege, Peano & Russell and Hilbert) Early 20th century (Godel and Tarski) Each new time frame begins with an introductory overview highlighting themes and points of importance. Chapters discuss the significance and reception of influential works and look at historical arguments in the context of contemporary debates. To support independent study, comprehensive lists of primary and secondary reading are included at the end of chapters, along with exercises and discussion questions. By clearly presenting and explaining the changes to logic across the history of philosophy, The History of Philosophical and Formal Logic constructs an easy-to-follow narrative. This is an ideal starting point for students looking to understand the historical development of logic.
Author: Robert L. Rogers
Release Date: 2014-05-12
Mathematical Logic and Formalized Theories: A Survey of Basic Concepts and Results focuses on basic concepts and results of mathematical logic and the study of formalized theories. The manuscript first elaborates on sentential logic and first-order predicate logic. Discussions focus on first-order predicate logic with identity and operation symbols, first-order predicate logic with identity, completeness theorems, elementary theories, deduction theorem, interpretations, truth, and validity, sentential connectives, and tautologies. The text then tackles second-order predicate logic, as well as second-order theories, theory of definition, and second-order predicate logic F2. The publication takes a look at natural and real numbers, incompleteness, and the axiomatic set theory. Topics include paradoxes, recursive functions and relations, Gödel's first incompleteness theorem, axiom of choice, metamathematics of R and elementary algebra, and metamathematics of N. The book is a valuable reference for mathematicians and researchers interested in mathematical logic and formalized theories.
This seminal, multidisciplinary book shows how mathematics can be used to study the first principles of DNA. Most importantly, it enriches the so-called “Chargaff’s grammar of biology” by providing the conceptual theoretical framework necessary to generalize Chargaff’s rules. Starting with a simple example of DNA mathematical modeling where human nucleotide frequencies are associated to the Fibonacci sequence and the Golden Ratio through an optimization problem, its breakthrough is showing that the reverse, complement and reverse-complement operators defined over oligonucleotides induce a natural set partition of DNA words of fixed-size. These equivalence classes, when organized into a matrix form, reveal hidden patterns within the DNA sequence of every living organism. Intended for undergraduate and graduate students both in mathematics and in life sciences, it is also a valuable resource for researchers interested in studying invariant genomic properties.
"Attractive and well-written introduction." — Journal of Symbolic Logic The logic that mathematicians use to prove their theorems is itself a part of mathematics, in the same way that algebra, analysis, and geometry are parts of mathematics. This attractive and well-written introduction to mathematical logic is aimed primarily at undergraduates with some background in college-level mathematics; however, little or no acquaintance with abstract mathematics is needed. Divided into three chapters, the book begins with a brief encounter of naïve set theory and logic for the beginner, and proceeds to set forth in elementary and intuitive form the themes developed formally and in detail later. In Chapter Two, the predicate calculus is developed as a formal axiomatic theory. The statement calculus, presented as a part of the predicate calculus, is treated in detail from the axiom schemes through the deduction theorem to the completeness theorem. Then the full predicate calculus is taken up again, and a smooth-running technique for proving theorem schemes is developed and exploited. Chapter Three is devoted to first-order theories, i.e., mathematical theories for which the predicate calculus serves as a base. Axioms and short developments are given for number theory and a few algebraic theories. Then the metamathematical notions of consistency, completeness, independence, categoricity, and decidability are discussed, The predicate calculus is proved to be complete. The book concludes with an outline of Godel's incompleteness theorem. Ideal for a one-semester course, this concise text offers more detail and mathematically relevant examples than those available in elementary books on logic. Carefully chosen exercises, with selected answers, help students test their grasp of the material. For any student of mathematics, logic, or the interrelationship of the two, this book represents a thought-provoking introduction to the logical underpinnings of mathematical theory. "An excellent text." — Mathematical Reviews
This original anthology collects 10 of Weyl's less-technical writings that address the broader scope and implications of mathematics. Most have been long unavailable or not previously published in book form. Subjects include logic, topology, abstract algebra, relativity theory, and reflections on the work of Weyl's mentor, David Hilbert. 2012 edition.
Author: R.E. Grandy
Publisher: Springer Science & Business Media
Release Date: 2012-12-06
This book is intended to be a survey of the most important results in mathematical logic for philosophers. It is a survey of results which have philosophical significance and it is intended to be accessible to philosophers. I have assumed the mathematical sophistication acquired· in an introductory logic course or in reading a basic logic text. In addition to proving the most philosophically significant results in mathematical logic, I have attempted to illustrate various methods of proof. For example, the completeness of quantification theory is proved both constructively and non-constructively and relative ad vantages of each type of proof are discussed. Similarly, constructive and non-constructive versions of Godel's first incompleteness theorem are given. I hope that the reader· will develop facility with the methods of proof and also be caused by reflect on their differences. I assume familiarity with quantification theory both in under standing the notations and in finding object language proofs. Strictly speaking the presentation is self-contained, but it would be very difficult for someone without background in the subject to follow the material from the beginning. This is necessary if the notes are to be accessible to readers who have had diverse backgrounds at a more elementary level. However, to make them accessible to readers with no background would require writing yet another introductory logic text. Numerous exercises have been included and many of these are integral parts of the proofs.
Die theoretische Logik, auch mathematische oder symbolische Logik genannt, ist eine Ausdehnung der formalen Methode der Mathematik auf das Gebiet der Logik. Sie wendet für die Logik eine ähnliche Formel sprache an, wie sie zum Ausdruck mathematischer Beziehungen schon seit langem gebräuchlich ist. In der Mathematik würde es heute als eine Utopie gelten, wollte man beim Aufbau einer mathematischen Disziplin sich nur der gewöhnlichen Sprache bedienen. Die großen Fortschritte, die in der Mathematik seit der Antike gemacht worden sind, sind zum wesentlichen Teil mit dadurch bedingt, daß es gelang, einen brauchbaren und leistungsfähigen Formalismus zu finden. - Was durch die Formel sprache in der Mathematik erreicht wird, das soll auch in der theoretischen Logik durch diese erzielt werden, nämlich eine exakte, wissenschaftliche Behandlung ihres Gegenstandes. Die logischen Sachverhalte, die zwischen Urteilen, Begriffen usw. bestehen, finden ihre Darstellung durch Formeln, deren Interpretation frei ist von den Unklarheiten, die beim sprachlichen Ausdruck leicht auftreten können. Der Übergang zu logischen Folgerungen, wie er durch das Schließen geschieht, wird in seine letzten Elemente zerlegt und erscheint als formale Umgestaltung der Ausgangsformeln nach gewissen Regeln, die den Rechenregeln in der Algebra analog sind; das logische Denken findet sein Abbild in einem Logikkalkül. Dieser Kalkül macht die erfolgreiche Inangriffnahme von Problemen möglich, bei denen das rein inhaltliche Denken prinzipiell versagt. Zu diesen gehört z. B.
Author: Steve Reeves
Publisher: Addison Wesley Publishing Company
Release Date: 1990
An understanding of logic is essential to computer science. This book provides a highly accessible account of the logical basis required for reasoning about computer programs and applying logic in fields like artificial intelligence. The text contains extended examples, algorithms, and programs written in Standard ML and Prolog. No prior knowledge of either language is required. The book contains a clear account of classical first-order logic, one of the basic tools for program verification, as well as an introductory survey of modal and temporal logics and possible world semantics. An introduction to intuitionistic logic as a basis for an important style of program specification is also featured in the book.
Author: John Venn
Publisher: Taylor & Francis US
Release Date: 1973
Venn, best known for his diagrams for set theory, primarily studied logic and probability theory. The present book is a study of the principles of logic, with special emphasis on inference and induction. From the Preface to the First Edition (1889): ``As many readers will probably perceive, the main original guiding influence with me--as with most of those of the middle generation, and especially with most of those who approached logic with previous mathematical or scientific training--was that of Mill ... I still continue to regard the general attitude towards phenomena, which Mill took up as a logician, to be the soundest and most useful for scientific study ... '' From the Preface to the Second Edition (1907): ``Though thus leaving the main outlines unaltered I have done what I could to improve the work, and to try to bring it up to date ... A number of paragraphs have been altered, others have been re-written, and many hundreds of minor alterations, additions and corrections inserted ... ''