传ㄧ计 (CommutativeFunction)
A BinaryFunction is commutative if
the ordering of the arguments of the function has no effect on the value
returned by the function. More precisely, a function function is
commutative just in case (function inst1 inst2) is equal to (function
inst2 inst1), for all inst1 and inst2.
Ontology
SUMO / BASE-ONTOLOGYSuperclass(es)
Instance(s)
猭ㄧ计
猭ㄧ计
程ㄧ计
程ㄧ计
Coordinate term(s)
闽硈ㄧ计
Related WordNet synsets
- commutative
- (mathematics) of a binary operation; independent of order; as in e.g. "a x b = b x a"
Axioms (1)
- if function 琌 传ㄧ计 龟ㄒ,
- then for all inst1,inst2 holds: if function 阶じ 琌 class 龟ㄒ and inst1 琌 class 龟ㄒ and inst2 琌 class 龟ㄒ, then "function(inst1,inst2)" 单 "function(inst2,inst1)"
.
(=>
(instance ?FUNCTION CommutativeFunction)
(forall
(?INST1 ?INST2)
(=>
(and
(domain ?FUNCTION 1 ?CLASS)
(instance ?INST1 ?CLASS)
(instance ?INST2 ?CLASS))
(equal
(AssignmentFn ?FUNCTION ?INST1 ?INST2)
(AssignmentFn ?FUNCTION ?INST2 ?INST1)))))