Safe Haskell	None
Language	Haskell98

Data.Logic.ATP.Tableaux

Description

Tableaux, seen as an optimized version of a Prawitz-like procedure.

Documentation

prawitz :: forall formula atom term function v. (IsFirstOrder formula, Ord formula, Unify Failing (atom, atom), term ~ UTermOf (atom, atom), HasSkolem function, Show formula, atom ~ AtomOf formula, term ~ TermOf atom, function ~ FunOf term, v ~ TVarOf term, v ~ SVarOf function) => formula -> Int Source #

newtype K Source #

Constructors

Instances

Enum K Source #
Methods succ :: K -> K # pred :: K -> K # toEnum :: Int -> K # fromEnum :: K -> Int # enumFrom :: K -> [K] # enumFromThen :: K -> K -> [K] # enumFromTo :: K -> K -> [K] # enumFromThenTo :: K -> K -> K -> [K] #
Eq K Source #
Methods (==) :: K -> K -> Bool # (/=) :: K -> K -> Bool #
Ord K Source #
Methods compare :: K -> K -> Ordering # (<) :: K -> K -> Bool # (<=) :: K -> K -> Bool # (>) :: K -> K -> Bool # (>=) :: K -> K -> Bool # max :: K -> K -> K # min :: K -> K -> K #
Show K Source #
Methods showsPrec :: Int -> K -> ShowS # show :: K -> String # showList :: [K] -> ShowS #
Pretty K Source #
Methods pPrintPrec :: PrettyLevel -> Rational -> K -> Doc # pPrint :: K -> Doc # pPrintList :: PrettyLevel -> [K] -> Doc #

tab :: (IsFirstOrder formula, Unify Failing (atom, atom), term ~ UTermOf (atom, atom), Pretty formula, HasSkolem function, atom ~ AtomOf formula, term ~ TermOf atom, function ~ FunOf term, v ~ TVarOf term, v ~ SVarOf function) => Maybe Depth -> formula -> Failing ((K, Map v term), Depth) Source #