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 Wolfgang Rautenberg - Springer
A well-written introduction to the beautiful and coherent subject. It contains classical material such as logical calculi, beginnings of model theory, and Goedel's incompleteness theorems, as well as some topics motivated by applications.
by Uli Furbach - Wikibooks
This book is intended for computer scientists and it assumes only some basic mathematical notions like relations and orderings. The aim was to create an interactive script where logics can be experienced by interaction and experimentation.
by Christopher C. Leary, Lars Kristiansen - Milne Library Publishing
In this book, readers with no previous study in the field are introduced to the basics of model theory, proof theory, and computability theory. The text is designed to be used either in an upper division undergraduate classroom, or for self study.
by P.D. Magnus
An introduction to sentential logic and first-order predicate logic with identity, logical systems that influenced twentieth-century analytic philosophy. The book should help students understand quantified expressions in their philosophical reading.