The Logical Foundations of Mathematics

The Logical Foundations of Mathematics
Author: William S. Hatcher
Publisher: Elsevier
Total Pages: 331
Release: 2014-05-09
Genre: Mathematics
ISBN: 1483189635

The Logical Foundations of Mathematics offers a study of the foundations of mathematics, stressing comparisons between and critical analyses of the major non-constructive foundational systems. The position of constructivism within the spectrum of foundational philosophies is discussed, along with the exact relationship between topos theory and set theory. Comprised of eight chapters, this book begins with an introduction to first-order logic. In particular, two complete systems of axioms and rules for the first-order predicate calculus are given, one for efficiency in proving metatheorems, and the other, in a "natural deduction" style, for presenting detailed formal proofs. A somewhat novel feature of this framework is a full semantic and syntactic treatment of variable-binding term operators as primitive symbols of logic. Subsequent chapters focus on the origin of modern foundational studies; Gottlob Frege's formal system intended to serve as a foundation for mathematics and its paradoxes; the theory of types; and the Zermelo-Fraenkel set theory. David Hilbert's program and Kurt Gödel's incompleteness theorems are also examined, along with the foundational systems of W. V. Quine and the relevance of categorical algebra for foundations. This monograph will be of interest to students, teachers, practitioners, and researchers in mathematics.

Logical Foundations of Mathematics and Computational Complexity

Logical Foundations of Mathematics and Computational Complexity
Author: Pavel Pudlák
Publisher: Springer Science & Business Media
Total Pages: 699
Release: 2013-04-22
Genre: Mathematics
ISBN: 3319001191

The two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. Logical Foundations of Mathematics and Computational Complexity covers a broad spectrum of results in logic and set theory that are relevant to the foundations, as well as the results in computational complexity and the interdisciplinary area of proof complexity. The author presents his ideas on how these areas are connected, what are the most fundamental problems and how they should be approached. In particular, he argues that complexity is as important for foundations as are the more traditional concepts of computability and provability. Emphasis is on explaining the essence of concepts and the ideas of proofs, rather than presenting precise formal statements and full proofs. Each section starts with concepts and results easily explained, and gradually proceeds to more difficult ones. The notes after each section present some formal definitions, theorems and proofs. Logical Foundations of Mathematics and Computational Complexity is aimed at graduate students of all fields of mathematics who are interested in logic, complexity and foundations. It will also be of interest for both physicists and philosophers who are curious to learn the basics of logic and complexity theory.

Leśniewski's Systems of Logic and Foundations of Mathematics

Leśniewski's Systems of Logic and Foundations of Mathematics
Author: Rafal Urbaniak
Publisher: Springer Science & Business Media
Total Pages: 240
Release: 2013-09-24
Genre: Science
ISBN: 3319004824

This meticulous critical assessment of the ground-breaking work of philosopher Stanislaw Leśniewski focuses exclusively on primary texts and explores the full range of output by one of the master logicians of the Lvov-Warsaw school. The author’s nuanced survey eschews secondary commentary, analyzing Leśniewski's core philosophical views and evaluating the formulations that were to have such a profound influence on the evolution of mathematical logic. One of the undisputed leaders of the cohort of brilliant logicians that congregated in Poland in the early twentieth century, Leśniewski was a guide and mentor to a generation of celebrated analytical philosophers (Alfred Tarski was his PhD student). His primary achievement was a system of foundational mathematical logic intended as an alternative to the Principia Mathematica of Alfred North Whitehead and Bertrand Russell. Its three strands—‘protothetic’, ‘ontology’, and ‘mereology’, are detailed in discrete sections of this volume, alongside a wealth other chapters grouped to provide the fullest possible coverage of Leśniewski’s academic output. With material on his early philosophical views, his contributions to set theory and his work on nominalism and higher-order quantification, this book offers a uniquely expansive critical commentary on one of analytical philosophy’s great pioneers.​

Foundations of Logic and Mathematics

Foundations of Logic and Mathematics
Author: Yves Nievergelt
Publisher: Springer Science & Business Media
Total Pages: 425
Release: 2012-12-06
Genre: Mathematics
ISBN: 146120125X

This modern introduction to the foundations of logic and mathematics not only takes theory into account, but also treats in some detail applications that have a substantial impact on everyday life (loans and mortgages, bar codes, public-key cryptography). A first college-level introduction to logic, proofs, sets, number theory, and graph theory, and an excellent self-study reference and resource for instructors.

Foundations of Mathematical Logic

Foundations of Mathematical Logic
Author: Haskell Brooks Curry
Publisher: Courier Corporation
Total Pages: 420
Release: 1977-01-01
Genre: Mathematics
ISBN: 9780486634623

Written by a pioneer of mathematical logic, this comprehensive graduate-level text explores the constructive theory of first-order predicate calculus. It covers formal methods — including algorithms and epitheory — and offers a brief treatment of Markov's approach to algorithms. It also explains elementary facts about lattices and similar algebraic systems. 1963 edition.

Logical Foundations of Proof Complexity

Logical Foundations of Proof Complexity
Author: Stephen Cook
Publisher: Cambridge University Press
Total Pages: 0
Release: 2014-03-06
Genre: Mathematics
ISBN: 9781107694118

This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.

Computability, Complexity, Logic

Computability, Complexity, Logic
Author: E. Börger
Publisher: Elsevier
Total Pages: 618
Release: 1989-07-01
Genre: Computers
ISBN: 008088704X

The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems.The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes and classical aspects of these areas, the subject matter has been selected to give priority throughout to the new aspects of traditional questions, results and methods which have developed from the needs or knowledge of computer science and particularly of complexity theory.It is both a textbook for introductory courses in the above-mentioned disciplines as well as a monograph in which further results of new research are systematically presented and where an attempt is made to make explicit the connections and analogies between a variety of concepts and constructions.

The Foundations of Mathematics

The Foundations of Mathematics
Author: Kenneth Kunen
Publisher:
Total Pages: 251
Release: 2009
Genre: Mathematics
ISBN: 9781904987147

Mathematical logic grew out of philosophical questions regarding the foundations of mathematics, but logic has now outgrown its philosophical roots, and has become an integral part of mathematics in general. This book is designed for students who plan to specialize in logic, as well as for those who are interested in the applications of logic to other areas of mathematics. Used as a text, it could form the basis of a beginning graduate-level course. There are three main chapters: Set Theory, Model Theory, and Recursion Theory. The Set Theory chapter describes the set-theoretic foundations of all of mathematics, based on the ZFC axioms. It also covers technical results about the Axiom of Choice, well-orderings, and the theory of uncountable cardinals. The Model Theory chapter discusses predicate logic and formal proofs, and covers the Completeness, Compactness, and Lowenheim-Skolem Theorems, elementary submodels, model completeness, and applications to algebra. This chapter also continues the foundational issues begun in the set theory chapter. Mathematics can now be viewed as formal proofs from ZFC. Also, model theory leads to models of set theory. This includes a discussion of absoluteness, and an analysis of models such as H( ) and R( ). The Recursion Theory chapter develops some basic facts about computable functions, and uses them to prove a number of results of foundational importance; in particular, Church's theorem on the undecidability of logical consequence, the incompleteness theorems of Godel, and Tarski's theorem on the non-definability of truth.