Module cop::fof

source ·
Expand description

First-order formulas and various normal forms.

Structs

  • Universal quantifier.
  • The state of Skolemisation at a given position in a formula.

Enums

  • Conjunctive normal form of literals L, preserving parentheses.
  • Disjunction of literals that preserves parentheses.
  • Full first-order formula over atoms A and variables V.
  • Atoms occurring in a FOF, containing predicates P, constants C, and variables V.
  • Negation-normal form of literals L, variables V, and quantifiers V.
  • Binary operation.
  • Associative binary operation.
  • Quantifier.

Functions

  • Given x and y1 o … o yn, return x if n = 0, else x o y1 o … o yn.