Linked from

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

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

• Principia MathematicaRelated: The work begins its formal development with propositional logic.

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

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

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

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

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

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

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

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

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

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

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

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

• Knowledge (artificial intelligence)Related: It encodes facts as statements that can support deductive reasoning.

• Stone's representation theorem for Boolean algebrasRelated: Equivalence classes of propositions form Boolean algebras with Stone spaces of maximal consistent theories.