Predicate Comparison Table

Entity > Abstract > Class > Relation > Predicate

Next Relation: ProbabilityRelation Up: Relation Previous Relation: Function

Predicate comparison table

Subject have domain1 be second domain of documentation have axiom is a kind of is an instance of have relatedInternalConcept

BinaryPredicate inverse A Predicate relating two items - its valence is two
(=>
(instance ?REL BinaryPredicate)
(valence ?REL 2))
Predicate

disjointDecomposition Class subrelation A disjointDecomposition of a Class C is a set of subclasses of C that are mutually disjoint
(forall (?INT) (domain disjointDecomposition ?INT Class))
VariableArityRelation exhaustiveDecomposition

exhaustiveDecomposition Class subrelation An exhaustiveDecomposition of a Class C is a set of subclasses of C such that every subclass of C either is an element of the set or is a subclass of an element of the set. Note: this does not necessarily mean that the elements of the set are disjoint (see partition - a partition is a disjoint exhaustive decomposition.
(forall (?INT) (domain exhaustiveDecomposition ?INT Class))
VariableArityRelation partition

holds Relation subrelation (holds P N1 ... NK) is true just in case the tuple of objects denoted by N1,..., NK is an element of the Relation P
(=>
(instance ?REL VariableArityRelation)
(not
(exists (?INT)
(valence ?REL ?INT))))
VariableArityRelation

QuaternaryPredicate subrelation The Class of Predicates that require four arguments
(=>
(instance ?REL QuaternaryPredicate)
(valence ?REL 4))
QuaternaryRelation

QuintaryPredicate subrelation The Class of Predicates that require five arguments
(=>
(instance ?REL QuintaryPredicate)
(valence ?REL 5))
QuintaryRelation

SententialOperator subrelation This Class currently comprises all of the logical operators (viz. 'and', 'or', 'not', '=>', and '<=>')
(forall (?INT) (domain exhaustiveDecomposition ?INT Class))
Predicate

TernaryPredicate subrelation The Class of Predicates that require exactly three arguments
(=>
(instance ?REL TernaryPredicate)
(valence ?REL 3))
TernaryRelation

Subject	have domain1	be second domain of	documentation	have axiom	is a kind of	is an instance of	have relatedInternalConcept
BinaryPredicate		inverse	A Predicate relating two items - its valence is two	(=> (instance ?REL BinaryPredicate) (valence ?REL 2))	Predicate
disjointDecomposition	Class	subrelation	A disjointDecomposition of a Class C is a set of subclasses of C that are mutually disjoint	(forall (?INT) (domain disjointDecomposition ?INT Class))		VariableArityRelation	exhaustiveDecomposition
exhaustiveDecomposition	Class	subrelation	An exhaustiveDecomposition of a Class C is a set of subclasses of C such that every subclass of C either is an element of the set or is a subclass of an element of the set. Note: this does not necessarily mean that the elements of the set are disjoint (see partition - a partition is a disjoint exhaustive decomposition.	(forall (?INT) (domain exhaustiveDecomposition ?INT Class))		VariableArityRelation	partition
holds	Relation	subrelation	(holds P N1 ... NK) is true just in case the tuple of objects denoted by N1,..., NK is an element of the Relation P	(=> (instance ?REL VariableArityRelation) (not (exists (?INT) (valence ?REL ?INT))))		VariableArityRelation
QuaternaryPredicate		subrelation	The Class of Predicates that require four arguments	(=> (instance ?REL QuaternaryPredicate) (valence ?REL 4))	QuaternaryRelation
QuintaryPredicate		subrelation	The Class of Predicates that require five arguments	(=> (instance ?REL QuintaryPredicate) (valence ?REL 5))	QuintaryRelation
SententialOperator		subrelation	This Class currently comprises all of the logical operators (viz. 'and', 'or', 'not', '=>', and '<=>')	(forall (?INT) (domain exhaustiveDecomposition ?INT Class))	Predicate
TernaryPredicate		subrelation	The Class of Predicates that require exactly three arguments	(=> (instance ?REL TernaryPredicate) (valence ?REL 3))	TernaryRelation

Next Relation: ProbabilityRelation Up: Relation Previous Relation: Function