Linked from

The 54 pages that link to Propositional logic, each with the reason it gives.

• Boolean algebraNarrower topic: Boolean algebra supplies algebraic identities for the classical truth-functional operations it studies.

• Predicate logicNarrower topic: Predicate logic extends it by analyzing the internal structure of propositions.

• Natural deductionNarrower topic: Natural deduction is commonly presented first as a proof system for propositional logic.

• Logical connectiveNarrower topic: It studies arguments built from logical connectives.

• Constraint satisfaction problemNarrower topic: Boolean CSPs connect directly to this broader language of truth and inference.

• Curry–Howard correspondenceNarrower topic: Its connectives correspond to the basic type constructors used in Curry–Howard.

• George BooleNarrower topic: Boole turned combinations of propositions into algebraic expressions.

• Logical equivalenceNarrower topic: Its formulas are equivalent when their truth values match under every valuation.

• Law of Excluded MiddleNarrower topic: This is the setting in which the principle is expressed as P ∨ ¬P.

• Stoic logicNarrower topic: Stoic logic is an ancient precursor, though its concepts do not map perfectly onto modern formal systems.

• SatisfiabilityNarrower topic: Propositional satisfiability asks whether a formula in this system can be true.

• Common knowledgeNarrower topic: Common-knowledge definitions apply recursively to propositions that can be true or false.

• Heyting algebraNarrower topic: Heyting algebra semantics gives an algebraic account of intuitionistic propositional formulas.

• Augustus De MorganNarrower topic: Its connectives are the basic setting for the logical laws associated with De Morgan.

• Frank P. RamseyNarrower topic: Ramsey’s early work extended the formal analysis of logical systems.

• Disjunction introductionNarrower topic: Disjunction introduction is a basic derivation rule in propositional proofs.

• Law of noncontradictionNarrower topic: It expresses the principle with a proposition and its negation.

• Peirce's lawNarrower topic: Peirce's law is a formula within this logic.

• Biconditional introductionNarrower topic: Biconditional introduction is used to prove equivalences in this logical system.

• Conjunction introductionNarrower topic: The rule operates directly on propositions in this logical framework.

• Herbrand's theoremNarrower topic: The theorem reduces first-order validity to validity in this simpler logic.

• Constructive dilemmaNarrower topic: Constructive dilemma is a rule within this broader system of inference.

• Deduction theoremNarrower topic: The theorem is often first stated and proved for propositional systems.

• Lindenbaum's lemmaNarrower topic: The lemma already appears in propositional logic, where its construction is especially direct.

• Sheffer strokeNarrower topic: The Sheffer stroke is studied as a connective within this logical system.

• Modus ponendo tollensNarrower topic: This inference form is evaluated within propositional logic.