| PL |
This class defines propositional formulae.
|
| PLAnd |
This class defines formulae of the form p ∧ q where p and q are
propositional formulae.
|
| PLAtomic |
This class defines atomic propositions in propositional logic.
|
| PLBDD |
This class provides a BDD manager for propositional formulae.
|
| PLBinary |
This class defines binary propositional formulae.
|
| PLEquivalence |
This class defines equivalence formulae l ↔ r where l and r are
propositional formulae.
|
| PLFormula |
This class defines editable propositional formulae.
|
| PLImplication |
This class defines an implication formula l → r where l and r are
propositional formulae.
|
| PLNegation |
This class defines negated propositional formulae.
|
| PLOr |
This class defines formulae of the form p ∨ q where p and q are
propositional formulae.
|
| PLParser |
This class provides a parser for propositional formulae.
|
| PLReasoner |
The class provides a reasoner for entailments of classical propositional
formulae.
|
| PLUnary |
This class defines unary propositional formulae.
|