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 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 H. Andreka, I. Nemeti, I. Sain
Part I of the book studies algebras which are relevant to logic. Part II deals with the methodology of solving logic problems by (i) translating them to algebra, (ii) solving the algebraic problem, and (iii) translating the result back to logic.
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.
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.