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 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.
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.
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 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.