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.

中文翻译：

---

归因函数注意事项

让是从Q上的归因函数 σ 导出的知识空间。在 σ 的假设下，本文给出了一些具有判别性的充分必要条件。它还讨论了当Q是无穷集时 σ 的可分解性。更准确地说，本文证明了当Q不可数时σ 是不可解的，并给出了一个充分必要条件使得 σ 是可解的。通过应用这些结果，围绕技能多图的合并和所描绘的知识空间的网格讨论了区分性和可分解性。