forall x Open Logic Project
Unknown
Free open-licensed textbook from the Open Logic Project, based on P.D. Magnus's forall x, teaching formal logic from truth-functional logic through first-order predicate logic, with natural deduction, translation exercises and semantics. Readers learn to symbolize English arguments and construct formal proofs.
More resources on Predicate Logic
Wolfram MathWorld
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.
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.
Stanford Encyclopedia of Philosophy - Classical Logic
Stanford Encyclopedia of Philosophy entry presenting classical first-order logic: its formal language, a natural-deduction proof system, model-theoretic semantics, and the soundness, completeness and compactness theorems. Readers come away understanding how syntax and semantics of predicate logic relate.
Introduction to Logic
This course is an introduction to Logic from a computational perspective. It shows how to encode information in the form of logical sentences; it shows how to reason with information in this form; and it provides an overview of logic technology and its applications - in mathematics, science, engineering, business, law, and so forth.
A Concise Introduction to Logic
Standard introductory logic textbook covering arguments and fallacies, categorical syllogisms, propositional logic with natural deduction, and predicate logic with quantifiers and relations. Readers learn to translate English statements into symbolic form and prove validity using quantifier rules.
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.