A new definition of well-behaved discrimination functions

A discrimination function shows the probability or degree with which stimuli are discriminated from each other when presented in pairs. In a previous publication [Kujala, J.V., & Dzhafarov, E.N. (2008). On minima of discrimination functions. Journal of Mathematical Psychology, 52, 116-127] we introduced a condition under which the conformity of a discrimination function with the law of Regular Minimality (which says, essentially, that "being least discriminable from" is a symmetric relation) implies the constancy of the function's minima (i.e., the same level of discriminability of every stimulus from the stimulus least discriminable from it). This condition, referred to as "well-behavedness," turns out to be unnecessarily restrictive. In this note we give a significantly more general definition of well-behavedness, applicable to all Hausdorff arc-connected stimulus spaces. The definition employs the notion of the smallest transitively and topologically closed extension of a relation. We provide a transfinite-recursive construction for this notion and illustrate it by examples. (C) 2009 Elsevier Inc. All rights reserved.