logic-classes-1.5.3: Framework for propositional and first order logic, theorem proving

Safe HaskellNone
LanguageHaskell98

Data.Logic.Harrison.FOL

Synopsis

Documentation

eval :: FirstOrderFormula formula atom v => formula -> (atom -> Bool) -> Bool Source

list_disj :: (Constants formula, Combinable formula) => Set formula -> formula Source

list_conj :: (Constants formula, Combinable formula) => Set formula -> formula Source

var :: forall formula atom term v. (FirstOrderFormula formula atom v, Atom atom term v) => formula -> Set v Source

Return all variables occurring in a formula.

fv :: forall formula atom term v. (FirstOrderFormula formula atom v, Atom atom term v) => formula -> Set v Source

Return the variables that occur free in a formula.

subst :: (FirstOrderFormula formula atom v, Term term v f, Atom atom term v) => Map v term -> formula -> formula Source

generalize :: (FirstOrderFormula formula atom v, Atom atom term v) => formula -> formula Source