Math 2.0

concept

Predicate logic

Summary

Predicate logic extends propositional logic with variables for objects, predicates and quantifiers. Its formulas can say "for all xx" with the universal quantifier and "there exists xx" with the existential quantifier. In first-order logic, the quantifiers range over objects, not over sets of objects or predicates.

Remarks

Other names are first-order logic and predicate calculus. An example of a formula is ∀x ∃y (y>x)\forall x \, \exists y \, (y > x). Most of mathematics can be written in first-order logic with the axioms of Zermelo–Fraenkel set theory.

Explanations

L1 human

Propositional logic cannot say "every number has a larger number". Predicate logic can: it has variables such as xx and yy, and words such as "for all" and "there exists". This is the logic of most mathematical statements.

What this node needs for W2
  • edge defines in: at least one definition (0 of 1)
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 9 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Proposition concept
  2. Conjunction definition
  3. Disjunction definition
  4. Implication definition
  5. Negation definition
  6. Predicate definition
  7. Biconditional definition
  8. Propositional logic concept
  9. Predicate logic concept

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/First-order_logic, lead section