--- title: Formal Systems description: Formal systems are abstract frameworks consisting of an alphabet, grammar rules, axioms, and inference rules used to derive theorems. You will understand how these systems model logical reasoning and how to analyze their consistency, completeness, and soundness. category: mathematics subcategory: mathematical-logic difficulty: beginner, intermediate, advanced url: /subject/formal-systems --- # Formal Systems Formal systems are abstract frameworks consisting of an alphabet, grammar rules, axioms, and inference rules used to derive theorems. You will understand how these systems model logical reasoning and how to analyze their consistency, completeness, and soundness. ## Where to start Start with the Open Logic Project, a set of free, open-source logic textbooks that include formal systems. If you only use one resource, make it Logic and Structure, Dirk van Dalen's logic textbook. The Logic for Computer Science course from BITS Pilani on Coursera then covers natural deduction, soundness, completeness and undecidability, with practice writing formal proofs. ## Available Resources 1 Books • 2 Courses • 5 Websites ## Websites ### 1. nLab: Formal System nLab entry defining deductive and formal systems as collections of judgments and inference steps, explaining proof trees and effective enumerability, with natural deduction, sequent calculus, Hilbert systems and type theory as examples. Readers gain a precise, general vocabulary for comparing proof systems. **Difficulty:** Beginner | **Price:** Free **Link:** https://ncatlab.org/nlab/show/formal+system **Tags:** formal-systems, deductive-systems, proof-theory, type-theory, category-theory ### 2. 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. **Difficulty:** Beginner | **Price:** Free **Link:** https://openlogicproject.org/ **Tags:** mathematical-logic, first-order-logic, proof-theory, computability, open-textbooks ### 3. Stanford Encyclopedia of Philosophy: Proof Theory Stanford Encyclopedia of Philosophy survey of proof theory: Hilbert's program, axiomatic systems, natural deduction and sequent calculus, cut elimination, Gentzen's consistency proof and ordinal analysis. Readers gain a historical and technical map of how formal proofs are studied as mathematical objects. **Difficulty:** Beginner | **Price:** Free **Link:** https://plato.stanford.edu/entries/proof-theory/ **Tags:** proof-theory, sequent-calculus, natural-deduction, hilberts-program, philosophy-of-mathematics ### 4. Wolfram MathWorld **Author:** Eric W. Weisstein MathWorld is an online mathematics encyclopedia from Wolfram Research offering detailed, browsable articles on topics across the math spectrum, including algebra, geometry, calculus, and number theory. Each entry includes definitions, theorems, formulas, diagrams, worked examples, and links to further reading. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://mathworld.wolfram.com **Tags:** mathematics-reference, encyclopedia, abstract-algebra, number-theory, geometry ### 5. plato.stanford.edu The Stanford Encyclopedia of Philosophy is a peer‑reviewed online encyclopedia of philosophy featuring in‑depth, scholarly articles written and regularly updated by experts, including comprehensive coverage of logic topics. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://plato.stanford.edu **Tags:** websites, mathematics-statistics, discrete-math ## Courses ### 1. Introduction to Logic Learn the fundamentals of logic and formal systems with this introductory course. Explore reasoning principles and problem-solving techniques. **Difficulty:** Advanced | **Price:** Free **Link:** https://logic.stanford.edu/intrologic/ **Tags:** propositional-logic, relational-logic, first-order-logic, formal-proofs ### 2. Logic for Computer Science A Coursera course from BITS Pilani on computational logic: propositional and predicate logic, natural deduction, soundness and completeness, undecidability, LTL and CTL model checking, and Floyd-Hoare program verification. Learners can write formal proofs and verify properties of algorithms and systems. **Difficulty:** Intermediate | **Language:** English | **Price:** Free **Link:** https://www.coursera.org/learn/bits-logic-for-computer-science **Tags:** propositional-logic, predicate-logic, model-checking, temporal-logic, hoare-logic, program-verification ## Books ### 1. Logic and Structure **Author:** Dirk van Dalen Upper-undergraduate logic textbook by Dirk van Dalen covering propositional and predicate logic via natural deduction, completeness and compactness, basic model theory and intuitionistic logic. Readers learn to prove metatheorems about formal systems rather than simply use them. **Difficulty:** Intermediate | **Language:** English | **Price:** Paid **Link:** https://www.amazon.com/dp/3540098933?tag=edmonddante07-20 **Tags:** books, mathematics-statistics, mathematical-logic --- *This content is part of Dantes.io - Your Treasure Map to Knowledge* *Curated by humans at Dantes.io. Personal study use welcome; republishing this curation requires permission (team@dantes.io).* View this page online: https://dantes.io/subject/formal-systems