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 Vilnis Detlovs, Karlis Podnieks - University of Latvia
From the table of contents: 1. Introduction. What Is Logic, Really?; 2. Propositional Logic; 3. Predicate Logic; 4. Completeness Theorems (Model Theory); 5. Normal Forms. Resolution Method; 6. Miscellaneous (Negation as Contradiction or Absurdity).
by Arnold W. Miller - arXiv
This is a set of questions written for a course in Mathematical Logic. Topics covered are: propositional logic; axioms of ZFC; wellorderings and equivalents of AC; ordinal and cardinal arithmetic; first order logic, and the compactness theorem; etc.
by Bertrand Russell - University of Massachusetts Amherst
A very accessible mathematical classic. It sets forth in elementary form the logical definition of number, the analysis of the notion of order, the modern doctrine of the infinite, and the theory of descriptions and classes as symbolic fictions.
by Michal Walicki - University of Bergen
This text is an introduction to mathematical logic: the compendium with the whole syllabus and an extensive section on the history of logic. The author covers the basic set theory, Turing machines, statement logic, and predicate logic.