Introduction to Mathematical Logic: A problem solving course
by Arnold W. Miller
Publisher: arXiv 1996
Number of pages: 75
This is a set of 288 questions written for a Moore-style 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; Lowenheim-Skolem theorems; Turing machines, Church's Thesis; completeness theorem and first incompleteness theorem; undecidable theories; second incompleteness theorem.
Home page url
Download or read it online for free here:
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 Edward Nelson - Princeton Univ Pr
The book 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, and more.
by Nick Bezhanishvili, Dick de Jongh - Universiteit van Amsterdam
In this course we give an introduction to intuitionistic logic. We concentrate on the propositional calculus mostly, make some minor excursions to the predicate calculus and to the use of intuitionistic logic in intuitionistic formal systems.
by Wolfgang Rautenberg - Springer
A well-written introduction to the beautiful and coherent subject. It contains classical material such as logical calculi, beginnings of model theory, and Goedel's incompleteness theorems, as well as some topics motivated by applications.