inverse Comparison Table

Next BinaryPredicate: irreflexiveOn Up: BinaryPredicate, SymmetricRelation Previous BinaryPredicate: instance

inverse comparison table

Subject have domain2 have domain1 be first domain of documentation have axiom is a kind of is an instance of

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

SymmetricRelation trichotomizingOn A BinaryRelation ?REL is symmetric just in case (?REL ?INST1 ?INST2) imples (?REL ?INST2 ?INST1), for all ?INST1 and ?INST2
(=>
(instance ?REL SymmetricRelation)
(forall (?INST1 ?INST2)
(=>
(holds ?REL ?INST1 ?INST2)
(holds ?REL ?INST2 ?INST2))))
BinaryRelation

inverse BinaryRelation BinaryRelation singleValued The inverse of a BinaryRelation is a relation in which all the tuples of the original relation are reversed. In other words, one BinaryRelation is the inverse of another if they are equivalent when their arguments are swapped
(=>
(and
(inverse ?REL1 ?REL2)
(instance ?REL1 BinaryRelation)
(instance ?REL2 BinaryRelation))
(forall (?INST1 ?INST2)
(<=>
(holds ?REL1 ?INST1 ?INST2)
(holds ?REL2 ?INST2 ?INST1))))
SymmetricRelation

Subject	have domain2	have domain1	be first domain of	documentation	have axiom	is a kind of	is an instance of
BinaryPredicate			singleValued	A Predicate relating two items - its valence is two	(=> (instance ?REL BinaryPredicate) (valence ?REL 2))	Predicate
SymmetricRelation			trichotomizingOn	A BinaryRelation ?REL is symmetric just in case (?REL ?INST1 ?INST2) imples (?REL ?INST2 ?INST1), for all ?INST1 and ?INST2	(=> (instance ?REL SymmetricRelation) (forall (?INST1 ?INST2) (=> (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST2))))	BinaryRelation
inverse	BinaryRelation	BinaryRelation	singleValued	The inverse of a BinaryRelation is a relation in which all the tuples of the original relation are reversed. In other words, one BinaryRelation is the inverse of another if they are equivalent when their arguments are swapped	(=> (and (inverse ?REL1 ?REL2) (instance ?REL1 BinaryRelation) (instance ?REL2 BinaryRelation)) (forall (?INST1 ?INST2) (<=> (holds ?REL1 ?INST1 ?INST2) (holds ?REL2 ?INST2 ?INST1))))		SymmetricRelation

Next BinaryPredicate: irreflexiveOn Up: BinaryPredicate, SymmetricRelation Previous BinaryPredicate: instance