Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Logic.ATP.PropExamples

Description

Some propositional formulas to test, and functions to generate classes.

Synopsis

Documentation

Constructors

Instances details

NumAtom (Knows Integer) Source #
Instance details Defined in Data.Logic.ATP.DP Methods ma :: Integer -> Knows Integer Source # ai :: Knows Integer -> Integer Source #
IsAtom (Knows Integer) Source #
Instance details Defined in Data.Logic.ATP.PropExamples
Num a => HasFixity (Knows a) Source #
Instance details Defined in Data.Logic.ATP.PropExamples Methods precedence :: Knows a -> Precedence Source # associativity :: Knows a -> Associativity Source #
Show a => Show (Knows a) Source #
Instance details Defined in Data.Logic.ATP.PropExamples Methods showsPrec :: Int -> Knows a -> ShowS # show :: Knows a -> String # showList :: [Knows a] -> ShowS #
Eq a => Eq (Knows a) Source #
Instance details Defined in Data.Logic.ATP.PropExamples Methods (==) :: Knows a -> Knows a -> Bool # (/=) :: Knows a -> Knows a -> Bool #
Ord a => Ord (Knows a) Source #
Instance details Defined in Data.Logic.ATP.PropExamples Methods compare :: Knows a -> Knows a -> Ordering # (<) :: Knows a -> Knows a -> Bool # (<=) :: Knows a -> Knows a -> Bool # (>) :: Knows a -> Knows a -> Bool # (>=) :: Knows a -> Knows a -> Bool # max :: Knows a -> Knows a -> Knows a # min :: Knows a -> Knows a -> Knows a #
(Num a, Show a) => Pretty (Knows a) Source #
Instance details Defined in Data.Logic.ATP.PropExamples Methods pPrintPrec :: PrettyLevel -> Rational -> Knows a -> Doc # pPrint :: Knows a -> Doc # pPrintList :: PrettyLevel -> [Knows a] -> Doc #

mk_knows :: (IsPropositional formula, AtomOf formula ~ Knows a) => String -> a -> formula Source #

mk_knows2 :: (IsPropositional formula, AtomOf formula ~ Knows a) => String -> a -> a -> formula Source #

Generate assertion equivalent to R(s,t) <= n for the Ramsey number R(s,t)