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 Robert Goldblatt - Center for the Study of Language
Sets out the basic theory of normal modal and temporal propositional logics, applies this theory to logics of discrete, dense, and continuous time, to the temporal logic of henceforth, next, and until, and to the dynamic logic of regular programs.
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 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 Johan van Benthem - CSLI
An examination of the role of partial information - with illustrations drawn from different branches of Intensional Logic - and various influences stemming from current theories of the semantics of natural language, involving generalized quantifiers.