Skip to main content
WebsiteintermediateFree

logicmatters.net

Unknown

Logic Matters is a blog and resource site dedicated to mathematical logic. It provides expository notes, essays, and curated reading lists across topics such as model theory, proof theory, computability, and set theory, with materials for students and researchers.

Visit resource
Also charted under:Logic in Computer Science

More resources on Mathematical Logic

BookPaid

Gödel’s Proof

A short classic that walks non-specialists through the structure of Gödel's incompleteness proof: Hilbert's program, Gödel numbering, and the construction of a self-referential undecidable sentence. This revised edition includes a foreword by Douglas Hofstadter.

CourseFree

Logic and Proofs

Learn mathematical logic and master the art of proofs with this comprehensive course from the Open Logic Team.

CourseFree

Category Theory for Scientists (MIT 18.S996)

An open textbook presenting category theory as a language for scientific modeling: sets, monoids, graphs, orders, databases and ologs, categories, functors, natural transformations, limits, colimits and adjunctions. Includes instructor insights and example student projects; suits readers comfortable with proofs.

WebsiteFree

Open Logic Project

Free, open-source collection of logic textbooks maintained by logicians, including Sets, Logic, Computation and Incompleteness and Computability. Covers propositional and first-order logic, natural deduction, completeness, computability and incompleteness, so readers can work through formal proof systems and metatheory rigorously.

CourseFree

Logic II (MIT 24.242)

Computability theory followed by a detailed study of Gödel's incompleteness theorems and their applications, including Church's undecidability theorem and Tarski's theorem on the undefinability of truth. Lecture notes and problem sets with solutions let learners work through these proofs themselves.

CourseFree

Discrete Mathematics

Dominik Scheder's proof-based course on sets, functions and relations, enumerative combinatorics, graph theory, and network flows and matchings, each concept paired with a fully proved non-trivial result. Learners read formal statements and write rigorous proofs of their own.

See all Mathematical Logic resources →