Linked from

The 46 pages that link to Predicate logic, each with the reason it gives.

• Analytic philosophyRelated: Fregean logic gave analytic philosophers tools to expose the structure of complex propositions.

• Principia MathematicaRelated: Its quantifiers and relations let the authors formalize mathematical definitions and proofs.

• Charles Sanders PeirceRelated: Peirce independently developed quantificational notation that anticipated modern predicate logic.

• DecidabilityRelated: Logical theories become decision problems when asked whether a sentence is provable or valid.

• SatisfiabilityRelated: In predicate logic, satisfiability depends on both an interpretation and a domain.

• Knowledge representationRelated: Its predicates and quantifiers express structured facts beyond simple true-or-false propositions.

• Logical implicationRelated: Implication combines quantified statements in arguments about objects and relations.

• Domain of discourseRelated: Predicates are interpreted as properties or relations on the chosen domain.

• Rule-based systemRelated: It provides a precise basis for rules involving entities and relations.

• Augustus De MorganRelated: De Morgan’s transformations extend to quantifiers: negation exchanges universal and existential claims.

• PredicateRelated: It uses predicates to express structured claims beyond whole-proposition logic.

• Transfinite inductionRelated: Induction proves a universally quantified property by examining each ordinal stage.

• DatalogRelated: Datalog atoms use predicates applied to constants and variables to represent facts.

• Prenex normal formRelated: Its predicates and quantifiers supply the formula's basic vocabulary.

• Symbolic logicRelated: Its predicates and quantifiers supply the structure behind quantified symbolic statements.

• Edgar F. CoddRelated: Codd connected relational data to logic-based ways of stating queries.

• Formal fallacyRelated: Quantifier scope and predicate structure generate formal fallacies beyond propositional logic.

• Blum axiomsRelated: The second axiom is a uniform predicate about whether a computation’s measure is at most a bound.

• Philosophical logicRelated: Its quantifiers make claims about identity and existence formally analyzable.

• Ugly duckling theoremRelated: Predicates provide the describable properties that the theorem counts.