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 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 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 Nuel Belnap - University of Pittsburgh
Contents: Grammar; The art of the logic of truth-functional connectives; Quantifier proofs; A modicum of set theory; Symbolizing English quantifiers; Quantifier semantics - interpretation and counterexample; Theories; Definitions.
by Gary Hardegree - Mcgraw-Hill College
Contents: Basic Concepts of Logic; Truth-Functional Connectives; Validity in Sentential Logic; Translations in Sentential Logic; Derivations in Sentential Logic; Translations in Monadic Predicate Logic; Translations in Polyadic Predicate Logic; etc.