Contents
Index
logic-classes-1.4.7: Framework for propositional and first order logic, theorem proving
A
B
C
D
E
F
G
H
I
L
M
N
O
P
Q
R
S
T
U
V
W
Y
Z
:
!
.
<
=
?
|
All
Index - P
P
1 (Data Constructor)
Data.Logic.Harrison.PropExamples
2 (Data Constructor)
Data.Logic.Harrison.DefCNF
3 (Data Constructor)
Data.Logic.Types.Harrison.Prop
pApp
1 (Function)
Data.Logic.Classes.FirstOrder
2 (Function)
Data.Logic.Classes.Equals
pApp0
1 (Function)
Data.Logic.Classes.FirstOrder
2 (Function)
Data.Logic.Classes.Equals
pApp1
1 (Function)
Data.Logic.Classes.FirstOrder
2 (Function)
Data.Logic.Classes.Equals
pApp2
1 (Function)
Data.Logic.Classes.FirstOrder
2 (Function)
Data.Logic.Classes.Equals
pApp3
1 (Function)
Data.Logic.Classes.FirstOrder
2 (Function)
Data.Logic.Classes.Equals
pApp4
1 (Function)
Data.Logic.Classes.FirstOrder
2 (Function)
Data.Logic.Classes.Equals
pApp5
1 (Function)
Data.Logic.Classes.FirstOrder
2 (Function)
Data.Logic.Classes.Equals
pApp6
1 (Function)
Data.Logic.Classes.FirstOrder
2 (Function)
Data.Logic.Classes.Equals
pApp7
1 (Function)
Data.Logic.Classes.FirstOrder
2 (Function)
Data.Logic.Classes.Equals
pholds
Data.Logic.Harrison.Herbrand
plSat
Data.Logic.Instances.PropLogic
plSat0
Data.Logic.Instances.PropLogic
pname
Data.Logic.Types.Harrison.Prop
pnf
Data.Logic.Harrison.Skolem
Pos
Data.Boolean
,
Data.Boolean.SatSolver
pos
Data.Logic.Normal.Implicative
positive
1 (Function)
Data.Logic.Classes.Negate
2 (Function)
Data.Logic.Harrison.Prop
Predicate
1 (Type/Class)
Data.Logic.Classes.Apply
2 (Data Constructor)
Data.Logic.Instances.Chiou
3 (Type/Class)
Data.Logic.Types.FirstOrder
4 (Data Constructor)
Data.Logic.Types.FirstOrder
PredicateName
Data.Logic.Classes.Equals
predicates
Data.Logic.Harrison.Equal
predicate_congruence
Data.Logic.Harrison.Equal
PredName
Data.Logic.Types.Harrison.Equal
prefix
Data.Logic.Classes.Variable
presolution
Data.Logic.Harrison.Resolution
Pretty
Data.Logic.Classes.Pretty
pretty
Data.Logic.Classes.Pretty
prettyApply
Data.Logic.Classes.Apply
prettyAtomEq
Data.Logic.Classes.Equals
prettyBinOp
Data.Logic.Classes.Combine
prettyBool
Data.Logic.Classes.Constants
prettyFirstOrder
Data.Logic.Classes.FirstOrder
prettyINF
Data.Logic.Normal.Implicative
prettyLit
Data.Logic.Classes.Literal
prettyProof
Data.Logic.Normal.Implicative
prettyPropositional
Data.Logic.Classes.Propositional
prettyTerm
Data.Logic.Classes.Term
prettyVariable
Data.Logic.Classes.Variable
prime
Data.Logic.Harrison.PropExamples
Proof
1 (Type/Class)
Data.Logic.KnowledgeBase
2 (Data Constructor)
Data.Logic.KnowledgeBase
proof
Data.Logic.KnowledgeBase
ProofResult
Data.Logic.KnowledgeBase
proofResult
Data.Logic.KnowledgeBase
Prop
Data.Logic.Types.Harrison.Prop
PropositionalFormula
Data.Logic.Classes.Propositional
prove
Data.Logic.Resolution
Proved
Data.Logic.KnowledgeBase
ProverT
Data.Logic.KnowledgeBase
psimplify
Data.Logic.Harrison.Prop
pSubst
Data.Logic.Harrison.Prop
PTerm
Data.Logic.Types.FirstOrder
public
Data.Logic.Types.FirstOrderPublic
purednf
Data.Logic.Harrison.Prop
puremeson
Data.Logic.Harrison.Meson