pm#binary_function_type class of functions requiring two arguments
supertype: function_type ternary_relation_type
instance of: class_of_inheritable_relation_type
instance: binary_function list_order_fn list_concatenate_fn where_fn multiplication_fn addition_fn subtraction_fn division_fn exponentiation_fn log_fn max_fn min_fn remainder_fn union_fn intersection_fn relative_complement_fn kappa_fn measure_fn interval_fn per_fn time_interval_fn recurrent_time_interval_fn month_fn day_fn hour_fn minute_fn second_fn temporal_composition_fn mereological_sum_fn mereological_product_fn mereological_difference_fn edition_fn series_volume_fn periodical_issue_fn relative_time_fn
equal: binary_function (pm)
subtype: associative_function_type a binary function is associative if bracketing has no effect on the value returned by the function; more precisely, a function ?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
subtype: commutative_function_type a binary function 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
No statement uses or specializes binary_function_type; click here to add one.