Gathered together here are the fundamental texts of the great classical period in modern logic. A complete translation of Gottlob Frege’s Begriffsschrift—which opened a great epoch in the history of logic by fully presenting propositional calculus and quantification theory—begins the volume, which concludes with papers by Herbrand and by Gödel.
First English translation of revolutionary paper (1931) that established that even in elementary parts of arithmetic, there are propositions which cannot be proved or disproved within the system. Introduction by R. B. Braithwaite.
No one has figured more prominently in the study of the German philosopher Gottlob Frege than Michael Dummett. His magisterial Frege: Philosophy of Language is a sustained, systematic analysis of Frege's thought, omitting only the issues in philosophy of mathematics. In this work Dummett discusses, section by section, Frege's masterpiece The Foundations of Arithmetic and Frege's treatment of real numbers in the second volume of Basic Laws of Arithmetic, establishing what parts of the philosopher's views can be salvaged and employed in new theorizing, and what must be abandoned, either as incorrectly argued or as untenable in the light of technical developments. Gottlob Frege (1848-1925) was a logician, mathematician, and philosopher whose work had enormous impact on Bertrand Russell and later on the young Ludwig Wittgenstein, making Frege one of the central influences on twentieth-century Anglo-American philosophy; he is considered the founder of analytic philosophy. His philosophy of mathematics contains deep insights and remains a useful and necessary point of departure for anyone seriously studying or working in the field.
In case you are considering to adopt this book for courses with over 50 students, please contact [email protected] for more information. This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax, semantics, soundness, completeness, independence, normal forms, vertical paths through negation normal formulas, compactness, Smullyan's Unifying Principle, natural deduction, cut-elimination, semantic tableaux, Skolemization, Herbrand's Theorem, unification, duality, interpolation, and definability. The last three chapters of the book provide an introduction to type theory (higher-order logic). It is shown how various mathematical concepts can be formalized in this very expressive formal language. This expressive notation facilitates proofs of the classical incompleteness and undecidability theorems which are very elegant and easy to understand. The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory. Some of the numerous exercises require giving formal proofs. A computer program called ETPS which is available from the web facilitates doing and checking such exercises. Audience: This volume will be of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification.
Discussions of the foundations of mathematics and their history are frequently restricted to logical issues in a narrow sense, or else to traditional problems of analytic philosophy. From Dedekind to Gödel: Essays on the Development of the Foundations of Mathematics illustrates the much greater variety of the actual developments in the foundations during the period covered. The viewpoints that serve this purpose included the foundational ideas of working mathematicians, such as Kronecker, Dedekind, Borel and the early Hilbert, and the development of notions like model and modelling, arbitrary function, completeness, and non-Archimedean structures. The philosophers discussed include not only the household names in logic, but also Husserl, Wittgenstein and Ramsey. Needless to say, such logically-oriented thinkers as Frege, Russell and Gödel are not entirely neglected, either. Audience: Everybody interested in the philosophy and/or history of mathematics will find this book interesting, giving frequently novel insights.
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.
