Metamath: A Computer Language for Mathematical Proofs


Book Description

Metamath is a computer language and an associated computer program for archiving, verifying, and studying mathematical proofs. The Metamath language is simple and robust, with an almost total absence of hard-wired syntax, and we believe that it provides about the simplest possible framework that allows essentially all of mathematics to be expressed with absolute rigor. While simple, it is also powerful; the Metamath Proof Explorer (MPE) database has over 23,000 proven theorems and is one of the top systems in the "Formalizing 100 Theorems" challenge. This book explains the Metamath language and program, with specific emphasis on the fundamentals of the MPE database.




Logic, Semantics, Metamathematics


Book Description







Foundations of Constructive Mathematics


Book Description

This book is about some recent work in a subject usually considered part of "logic" and the" foundations of mathematics", but also having close connec tions with philosophy and computer science. Namely, the creation and study of "formal systems for constructive mathematics". The general organization of the book is described in the" User's Manual" which follows this introduction, and the contents of the book are described in more detail in the introductions to Part One, Part Two, Part Three, and Part Four. This introduction has a different purpose; it is intended to provide the reader with a general view of the subject. This requires, to begin with, an elucidation of both the concepts mentioned in the phrase, "formal systems for constructive mathematics". "Con structive mathematics" refers to mathematics in which, when you prove that l a thing exists (having certain desired properties) you show how to find it. Proof by contradiction is the most common way of proving something exists without showing how to find it - one assumes that nothing exists with the desired properties, and derives a contradiction. It was only in the last two decades of the nineteenth century that mathematicians began to exploit this method of proof in ways that nobody had previously done; that was partly made possible by the creation and development of set theory by Georg Cantor and Richard Dedekind.




Metamathematics of First-Order Arithmetic


Book Description

A much-needed monograph on the metamathematics of first-order arithmetic, paying particular attention to fragments of Peano arithmetic.




An Introduction to Ramsey Theory


Book Description

This book takes the reader on a journey through Ramsey theory, from graph theory and combinatorics to set theory to logic and metamathematics. Written in an informal style with few requisites, it develops two basic principles of Ramsey theory: many combinatorial properties persist under partitions, but to witness this persistence, one has to start with very large objects. The interplay between those two principles not only produces beautiful theorems but also touches the very foundations of mathematics. In the course of this book, the reader will learn about both aspects. Among the topics explored are Ramsey's theorem for graphs and hypergraphs, van der Waerden's theorem on arithmetic progressions, infinite ordinals and cardinals, fast growing functions, logic and provability, Gödel incompleteness, and the Paris-Harrington theorem. Quoting from the book, “There seems to be a murky abyss lurking at the bottom of mathematics. While in many ways we cannot hope to reach solid ground, mathematicians have built impressive ladders that let us explore the depths of this abyss and marvel at the limits and at the power of mathematical reasoning at the same time. Ramsey theory is one of those ladders.”




Metamathematics of Fuzzy Logic


Book Description

This book presents a systematic treatment of deductive aspects and structures of fuzzy logic understood as many valued logic sui generis. It aims to show that fuzzy logic as a logic of imprecise (vague) propositions does have well-developed formal foundations and that most things usually named ‘fuzzy inference’ can be naturally understood as logical deduction. It is for mathematicians, logicians, computer scientists, specialists in artificial intelligence and knowledge engineering, and developers of fuzzy logic.




Metamathematics, Machines and Gödel's Proof


Book Description

Describes the use of computer programs to check several proofs in the foundations of mathematics.




Recursion Theory for Metamathematics


Book Description

This work is a sequel to the author's Gödel's Incompleteness Theorems, though it can be read independently by anyone familiar with Gödel's incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.




Metamathematics and the Philosophical Tradition


Book Description

Metamathematics and the Philosophical Tradition is the first work to explore in such historical depth the relationship between fundamental philosophical quandaries regarding self-reference and meta-mathematical notions of consistency and incompleteness. Using the insights of twentieth-century logicians from Gödel through Hilbert and their successors, this volume revisits the writings of Aristotle, the ancient skeptics, Anselm, and enlightenment and seventeenth and eighteenth century philosophers Leibniz, Berkeley, Hume, Pascal, Descartes, and Kant to identify ways in which these both encode and evade problems of a priori definition and self-reference. The final chapters critique and extend more recent insights of late 20th-century logicians and quantum physicists, and offer new applications of the completeness theorem as a means of exploring "metatheoretical ascent" and the limitations of scientific certainty. Broadly syncretic in range, Metamathematics and the Philosophical Tradition addresses central and recurring problems within epistemology. The volume’s elegant, condensed writing style renders accessible its wealth of citations and allusions from varied traditions and in several languages. Its arguments will be of special interest to historians and philosophers of science and mathematics, particularly scholars of classical skepticism, the Enlightenment, Kant, ethics, and mathematical logic.