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.

• First-order logicCompared with: It lacks the object variables and quantifiers that let first-order logic express general claims.

• PropositionRelated: It treats propositions as units connected by operators such as negation and conjunction.

• 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.

• Aristotelian logicCompared with: It handles connective-based arguments that traditional syllogistic forms do not capture directly.

• Principia MathematicaRelated: The work begins its formal development with 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.

• Model checkingRelated: State labels and many verification conditions use propositional formulas.

• Truth valueRelated: It studies valid inferences by tracking the truth values of formulas.

• EntscheidungsproblemCompared with: Unlike full first-order validity, propositional validity has a terminating decision procedure.

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

• Boolean satisfiability problemRelated: SAT turns propositional formulas into a computational decision problem.

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

• QuantifierCompared with: It lacks the object-level quantification that distinguishes predicate logic.

• 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.

• Knowledge representationRelated: It provides a basic language for encoding facts and checking their logical consequences.

• Logical implicationRelated: It treats implication as a basic connective with formal inference rules.

• SyllogismCompared with: Unlike term syllogistics, it represents inference through relations among whole propositions.

• CompletenessBroader topic: Its standard proof systems are complete for truth-table validity.

• LogicBroader topic: It is the simplest standard setting for studying formal inference.

• ChrysippusRelated: Stoic inference patterns helped establish logic centered on propositions rather than terms.

• 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.

• Principle of explosionRelated: A short propositional derivation makes explosion's use of negation and disjunction explicit.

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

• History of logicBroader topic: Its rise shifted attention from terms to relations among whole propositions.

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

• Symbolic logicBroader topic: It is the simplest major symbolic system, treating whole propositions as units.

• 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.

• Description logicCompared with: It offers simpler reasoning but cannot directly represent individuals, relations, and quantified concept restrictions.

• Discrete mathematicsRelated: Logical statements supply the rules for proving claims about discrete structures.

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

• Axiom (general principle)Broader topic: Axioms and inference rules generate valid formulas in some presentations of propositional 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.

• Formal fallacyRelated: Many familiar formal fallacies are easiest to state as invalid propositional patterns.

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

• Absorption lawRelated: The laws simplify expressions such as a conjunction with a disjunction containing that proposition.

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

• De Morgan's lawsRelated: Negating a conjunction or disjunction applies the laws directly.

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

• Law of identityRelated: Its formulas can instantiate identity, though identity between objects needs richer logic.

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

• NonogramRelated: A cell is filled or empty, and deductions combine those binary possibilities.