We systematically study some basic properties of the theory of pre-topological spaces, such as, pre-base, subspace, axioms of separation, connectedness, etc. Pre-topology is also known as knowledge space in the theory of knowledge structures. We discuss the language of axioms of separation of pre-topology in the theory of knowledge spaces, the relation of Alexandroff spaces and quasi ordinal spaces, and the applications of the density of pre-topological spaces in primary items for knowledge spaces. In particular, we give a characterization of a skill multimap such that the delineate knowledge structure is a knowledge space, which gives an answer to a problem in [14] or [18] whenever each item with finitely many competencies; moreover, we give an algorithm to find the set of atom primary items for any finite knowledge spaces.
The theory of knowledge spaces (KST) which is regarded as a mathematical framework for the assessment of knowledge and advices for further learning. Now the theory of knowledge spaces has many applications in education. From the topological point of view, we discuss the language of the theory of knowledge spaces by the axioms of separation and the accumulation points of pre-topology respectively, which establishes some relations between topological spaces and knowledge spaces; in particular, we show that the language of the regularity of pre-topology in knowledge spaces and give a characterization for knowledge spaces by inner fringe of knowledge states. Moreover, we study the relations of Alexandroff spaces and quasi ordinal spaces; then we give an application of the density of pre-topological spaces in primary items for knowledge spaces, which shows that one person in order to master an item, she or he must master some necessary items. In particular, we give a characterization of a skill multimap such that the delineated knowledge structure is a knowledge space, which gives an answer to a problem in [14] or [18] whenever each item with finitely many competencies; further, we give an algorithm to find the set of atom primary items for any finite knowledge space.
Fuzzy skill multimaps can describe individuals' knowledge states from the perspective of latent cognitive abilities. The significance of discriminative knowledge structure is reducing repeated testing and the workload for students, which responds to the so-called 'double reduction policy'. As an application in knowledge assessment, the bidiscriminative knowledge structure is useful for evaluating 'relative independence' items or knowledge points. Moreover, it is of great significance that which kind of fuzzy skill multimap delineates a discriminative or bi-discriminative knowledge structure. Moreover, we give a characterization of fuzzy skill multimaps such that the delineated knowledge structures are knowledge spaces, learning spaces and simple closure spaces respectively. Further, there are some interesting applications in the meshing of the delineated knowledge structures and the distributed fuzzy skill multimaps. We also give a more precise analysis with regard to the separability (resp. bi-separability) on which condition the information collected within a local assessment can reflect an assessment at the global level, and which condition any of the local domains can localize from given global assessment.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.