Book Description
Fascinating study of the origin and nature of mathematical thought, including relation of mathematics and science, 20th-century developments, impact of computers, and more.Includes 34 illustrations. 1968 edition."
Author : Mark Kac
Publisher : Courier Corporation
Page : 189 pages
File Size : 19,64 MB
Release : 1992-01-01
Category : Philosophy
ISBN : 0486670856
Fascinating study of the origin and nature of mathematical thought, including relation of mathematics and science, 20th-century developments, impact of computers, and more.Includes 34 illustrations. 1968 edition."
Author : Geoffrey Hellman
Publisher : Cambridge University Press
Page : 296 pages
File Size : 38,69 MB
Release : 2021-02-04
Category : Science
ISBN : 1316999602
In these essays Geoffrey Hellman presents a strong case for a healthy pluralism in mathematics and its logics, supporting peaceful coexistence despite what appear to be contradictions between different systems, and positing different frameworks serving different legitimate purposes. The essays refine and extend Hellman's modal-structuralist account of mathematics, developing a height-potentialist view of higher set theory which recognizes indefinite extendability of models and stages at which sets occur. In the first of three new essays written for this volume, Hellman shows how extendability can be deployed to derive the axiom of Infinity and that of Replacement, improving on earlier accounts; he also shows how extendability leads to attractive, novel resolutions of the set-theoretic paradoxes. Other essays explore advantages and limitations of restrictive systems - nominalist, predicativist, and constructivist. Also included are two essays, with Solomon Feferman, on predicative foundations of arithmetic.
Author : Elliot Mendelsohn
Publisher : Springer Science & Business Media
Page : 351 pages
File Size : 41,8 MB
Release : 2012-12-06
Category : Science
ISBN : 1461572886
This is a compact mtroduction to some of the pnncipal tOpICS of mathematical logic . In the belief that beginners should be exposed to the most natural and easiest proofs, I have used free-swinging set-theoretic methods. The significance of a demand for constructive proofs can be evaluated only after a certain amount of experience with mathematical logic has been obtained. If we are to be expelled from "Cantor's paradise" (as nonconstructive set theory was called by Hilbert), at least we should know what we are missing. The major changes in this new edition are the following. (1) In Chapter 5, Effective Computability, Turing-computabIlity IS now the central notion, and diagrams (flow-charts) are used to construct Turing machines. There are also treatments of Markov algorithms, Herbrand-Godel-computability, register machines, and random access machines. Recursion theory is gone into a little more deeply, including the s-m-n theorem, the recursion theorem, and Rice's Theorem. (2) The proofs of the Incompleteness Theorems are now based upon the Diagonalization Lemma. Lob's Theorem and its connection with Godel's Second Theorem are also studied. (3) In Chapter 2, Quantification Theory, Henkin's proof of the completeness theorem has been postponed until the reader has gained more experience in proof techniques. The exposition of the proof itself has been improved by breaking it down into smaller pieces and using the notion of a scapegoat theory. There is also an entirely new section on semantic trees.
Author : H.-D. Ebbinghaus
Publisher : Springer Science & Business Media
Page : 290 pages
File Size : 25,91 MB
Release : 2013-03-14
Category : Mathematics
ISBN : 1475723555
This introduction to first-order logic clearly works out the role of first-order logic in the foundations of mathematics, particularly the two basic questions of the range of the axiomatic method and of theorem-proving by machines. It covers several advanced topics not commonly treated in introductory texts, such as Fraïssé's characterization of elementary equivalence, Lindström's theorem on the maximality of first-order logic, and the fundamentals of logic programming.
Author : Michael L. O'Leary
Publisher : John Wiley & Sons
Page : 464 pages
File Size : 32,63 MB
Release : 2015-09-14
Category : Mathematics
ISBN : 1118548019
A mathematical introduction to the theory and applications of logic and set theory with an emphasis on writing proofs Highlighting the applications and notations of basic mathematical concepts within the framework of logic and set theory, A First Course in Mathematical Logic and Set Theory introduces how logic is used to prepare and structure proofs and solve more complex problems. The book begins with propositional logic, including two-column proofs and truth table applications, followed by first-order logic, which provides the structure for writing mathematical proofs. Set theory is then introduced and serves as the basis for defining relations, functions, numbers, mathematical induction, ordinals, and cardinals. The book concludes with a primer on basic model theory with applications to abstract algebra. A First Course in Mathematical Logic and Set Theory also includes: Section exercises designed to show the interactions between topics and reinforce the presented ideas and concepts Numerous examples that illustrate theorems and employ basic concepts such as Euclid’s lemma, the Fibonacci sequence, and unique factorization Coverage of important theorems including the well-ordering theorem, completeness theorem, compactness theorem, as well as the theorems of Löwenheim–Skolem, Burali-Forti, Hartogs, Cantor–Schröder–Bernstein, and König An excellent textbook for students studying the foundations of mathematics and mathematical proofs, A First Course in Mathematical Logic and Set Theory is also appropriate for readers preparing for careers in mathematics education or computer science. In addition, the book is ideal for introductory courses on mathematical logic and/or set theory and appropriate for upper-undergraduate transition courses with rigorous mathematical reasoning involving algebra, number theory, or analysis.
Author : Stephen Cole Kleene
Publisher : Courier Corporation
Page : 436 pages
File Size : 27,46 MB
Release : 2013-04-22
Category : Mathematics
ISBN : 0486317072
Contents include an elementary but thorough overview of mathematical logic of 1st order; formal number theory; surveys of the work by Church, Turing, and others, including Gödel's completeness theorem, Gentzen's theorem, more.
Author : G. T. Kneebone
Publisher : Dover Publications
Page : 0 pages
File Size : 35,67 MB
Release : 2001
Category : Logic, Symbolic and mathematical
ISBN : 9780486417127
Ideal for students intending to specialize in the topic. Part I discusses traditional and symbolic logic. Part II explores the foundations of mathematics. Part III focuses on the philosophy of mathematics.
Author : Eric Schechter
Publisher : Princeton University Press
Page : 530 pages
File Size : 32,45 MB
Release : 2005-08-28
Category : Mathematics
ISBN : 9780691122793
Classical logic is traditionally introduced by itself, but that makes it seem arbitrary and unnatural. This text introduces classical alongside several nonclassical logics (relevant, constructive, quantative, paraconsistent).
Author : Jan Krajicek
Publisher : Cambridge University Press
Page : 361 pages
File Size : 21,69 MB
Release : 1995-11-24
Category : Computers
ISBN : 0521452058
Discusses the deep connections between logic and complexity theory, and lists a number of intriguing open problems.
Author : Christopher C. Leary
Publisher : Lulu.com
Page : 382 pages
File Size : 33,56 MB
Release : 2015
Category : Computers
ISBN : 1942341075
At the intersection of mathematics, computer science, and philosophy, mathematical logic examines the power and limitations of formal mathematical thinking. In this expansion of Leary's user-friendly 1st edition, readers with no previous study in the field are introduced to the basics of model theory, proof theory, and computability theory. The text is designed to be used either in an upper division undergraduate classroom, or for self study. Updating the 1st Edition's treatment of languages, structures, and deductions, leading to rigorous proofs of Gödel's First and Second Incompleteness Theorems, the expanded 2nd Edition includes a new introduction to incompleteness through computability as well as solutions to selected exercises.