Introduction to Mathematical Logic: A problem solving course
by Arnold W. Miller
Publisher: arXiv 1996
Number of pages: 75
Description:
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.
Download or read it online for free here:
Download link
(430KB, PDF)
Similar books
Notes on the Science of Logic
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.
(11118 views)
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.
(11118 views)
Symbolic Logic: A First Course
by Gary Hardegree - Mcgraw-Hill College
Contents: Basic Concepts of Logic; Truth-Functional Connectives; Validity in Sentential Logic; Translations in Sentential Logic; Derivations in Sentential Logic; Translations in Monadic Predicate Logic; Translations in Polyadic Predicate Logic; etc.
(16683 views)
by Gary Hardegree - Mcgraw-Hill College
Contents: Basic Concepts of Logic; Truth-Functional Connectives; Validity in Sentential Logic; Translations in Sentential Logic; Derivations in Sentential Logic; Translations in Monadic Predicate Logic; Translations in Polyadic Predicate Logic; etc.
(16683 views)
Predicative Arithmetic
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.
(17720 views)
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.
(17720 views)
Logic for Computer Science
- Wikibooks
This book provides a survey of mathematical logic and its various applications. After covering basic material of propositional logic and first-order logic, the course presents the foundations of finite model theory and descriptive complexity.
(10249 views)
- Wikibooks
This book provides a survey of mathematical logic and its various applications. After covering basic material of propositional logic and first-order logic, the course presents the foundations of finite model theory and descriptive complexity.
(10249 views)