: Welcome guest :
Sigma KEE - BinaryFunction
s that require two arguments.
is a term-forming
that maps from a n-tuple of arguments to a range and that associates this n-tuple with at most one range element. Note that the range is a
, and each element of the range is an instance of the
The class of
s whose properties can be inherited downward in the class hierarchy via the
s relate three items. The two
is associative if bracketing has no effect on the value returned by the
. More precisely, a
?FUNCTION is associative just in case (?FUNCTION ?INST1 (?FUNCTION ?INST2 ?INST3)) is equal to (?FUNCTION (?FUNCTION ?INST1 ?INST2) ?INST3), for all ?INST1, ?INST2, and ?INST3.
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.
Show simplified definition with tree view
Show full definition (without tree view)
Show full definition (with tree view)
Sigma web home
Suggested Upper Merged Ontology (SUMO) web home
Sigma version 2.99c (>= 2017/11/20) is
open source software
and its partners