Notes on attribution functions
Xun Ge, Shou Lin · British Journal of Mathematical and Statistical Psychology · 2020
Let be the knowledge space derived from an attribution function σ on Q . Under an assumption for σ, this paper gives some necessary and sufficient conditions such that is discriminative. It also discusses the resolubility of σ when Q is an infinite set. More precisely, this paper proves that σ is not resoluble if Q is uncountable, and gives a necessary and sufficient condition such that σ is resoluble when is ‐well‐graded. By way of applications of these results, discriminativeness and resolubility are discussed around the merge of skill multimaps and the meshing of the delineated knowledge spaces.