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 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 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.
by Gary Hardegree - UMass Amherst
Contents: Summary; Translations in Function Logic; Derivations in Function Logic; Translations in Identity Logic; Extra Material on Identity Logic; Derivations in Identity Logic; Translations in Description Logic; Derivations in Description Logic.
by Louis Couturat - Project Gutenberg
Mathematical Logic is a necessary preliminary to logical Mathematics. The present work is concerned with the 'calculus ratiocinator' aspect, and shows, in an admirably succinct form, the beauty of the calculus of logic regarded as an algebra.