by Edward Nelson
Publisher: Princeton Univ Pr 1987
Number of pages: 201
The book is based on lecture notes of a course given at Princeton University in 1980. From the contents: the impredicativity of induction, the axioms of arithmetic, order, induction by relativization, the bounded least number principle, Euclidean algorithm, encoding, sets and functions, and more.
Home page url
Download or read it online for free here:
by Robert Goldblatt - Center for the Study of Language
Sets out the basic theory of normal modal and temporal propositional logics, applies this theory to logics of discrete, dense, and continuous time, to the temporal logic of henceforth, next, and until, and to the dynamic logic of regular programs.
by Kees Doets, Jan van Eijck - College Publications
The purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming. The programming language that will be our tool for this is Haskell, a member of the Lisp family.
by Karlis Podnieks - University of Latvia
Textbook for students in mathematical logic and foundations of mathematics. Contents: Platonism, intuition and the nature of mathematics; Axiomatic Set Theory; First Order Arithmetic; Hilbert's Tenth Problem; Incompleteness Theorems; Godel's Theorem.
An undergraduate college level textbook covering first order predicate logic with identity but omitting metalogical proofs. The first rules of formal logic were written over 2300 years ago by Aristotle and are still vital.