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 Nuel Belnap - University of Pittsburgh
This course assumes you know how to use truth functions and quantifiers as tools. Our task here is to study these very tools. Contents: logic of truth functional connectives; first order logic of extensional predicates, operators, and quantifiers.
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 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).