by Stephen G. Simpson
Publisher: Pennsylvania State University 2013
Number of pages: 128
This is a course of Mathematical Logic for all mathematics graduate students. The text covers the propositional calculus, the predicate calculus, proof systems for propositional and predicate calculus, extensions of the predicate calculus, theories, definability, interpretability, arithmetization and incompleteness.
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 Arnold W. Miller - arXiv
This is a set of questions written for a course in Mathematical Logic. Topics covered are: propositional logic; axioms of ZFC; wellorderings and equivalents of AC; ordinal and cardinal arithmetic; first order logic, and the compactness theorem; etc.
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 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.