Zvolte jazyk: english | cesky | deutsch | italiano | simplified chinese | traditional chinese | hindi
Koncept:
Anglické slovo:
Hlavní stránka

komutativní funkce (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.

Ontologie

SUMO / BASE-ONTOLOGY

Nadtřída(y)

[tree]
entita
is subclass of
  abstraktum  
is subclass of
  relace  
is subclass of
  relace s jedinou hodnotou  
is subclass of
  funkce  
is subclass of
[tree]
entita
is subclass of
  abstraktum  
is subclass of
  relace  
is subclass of
  terciální relace  
is subclass of
is subclass of
  binární funkce  
is subclass of
  komutativní funkce  

Instance(s)

multiplication fn  addition fn  max fn  min fn 

Související termín(y)

asociativní funkce 

Related WordNet synsets

commutative
(mathematics) of a binary operation; independent of order; as in e.g. "a x b = b x a"
commutative is similar to...  

Axiomy (1)

(=>
      (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)))))