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 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 Frank Waaldijk - arXiv
We give a theoretical and applicable framework for dealing with real-world phenomena. Joining pointwise and pointfree notions in BISH, natural topology gives a faithful idea of important concepts and results in intuitionism.
An undergraduate college level textbook covering first order predicate logic with identity but omitting metalogical proofs. The first rules of formal logic were written over 2300 years ago by Aristotle and are still vital.
by Stephen G. Simpson - The Pennsylvania State University
This is a set of lecture notes from a 15-week graduate course at the Pennsylvania State University. The course covered some topics which are important in contemporary mathematical logic and foundations but usually omitted from introductory courses.