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 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.
by H. Andreka, I. Nemeti, I. Sain
Part I of the book studies algebras which are relevant to logic. Part II deals with the methodology of solving logic problems by (i) translating them to algebra, (ii) solving the algebraic problem, and (iii) translating the result back to logic.
by Christopher Gauker - University of Cincinnati
This book is for anyone who has had a solid introductory logic course and wants more. Topics covered include soundness and completeness for first-order logic, Tarski's theorem on the undefinability of truth, Godel's incompleteness theorems, etc.
by A. S. Troelstra - CSLI
This text deals with logical formalism, cut-elimination, the embedding of intuitionistic logic in classical linear logic, proofnets for the multiplicative fragment and the algorithmic interpretation of cut-elimination in proofnets.