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 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 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 Kees Doets, Jan van Eijck - College Publications
The purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming. The programming language that will be our tool for this is Haskell, a member of the Lisp family.
by Stephen G. Simpson - The Pennsylvania State University
This is a set of lecture notes from a 15-week graduate course at the Pennsylvania State University. The course covered some topics which are important in contemporary mathematical logic and foundations but usually omitted from introductory courses.