<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>H. Hnatienko);</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Phase categories as a tool for modeling uncertainty in higher education programs and program learning outcomes⋆</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hryhorii Hnatiienko</string-name>
          <email>hnatiienko@knu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleg Ilarionov</string-name>
          <email>oleg.ilarionov@knu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hanna Krasovska</string-name>
          <email>hanna.krasovska@knu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Larysa Myrutenko</string-name>
          <email>myrutenko.lara@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anzhelika Tkachuk</string-name>
          <email>angelikatkachuk@knu.ua</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Taras Shevchenko National University of Kyiv</institution>
          ,
          <addr-line>64/13 Volodymyrska str., 01601 Kyiv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <volume>000</volume>
      <fpage>0</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>A new tool for modeling uncertainty in educational programs in the form of phase categories is proposed. Uncertainty naturally exists in the reflections between the topics, outcomes, and competencies of educational programs. A review of the literature exploring the formalization and evaluation of educational programs is conducted. A diagram of the relationships between the elements of the model within an educational program is provided. Approaches to applying category theory to describe educational programs in the form of a rigorous mathematical structure are described, where objects are interpreted as topics or outcomes, and morphisms are interpreted as logical dependencies between them. A number of approaches to the reasonable determination of the values of weight coefficients of mutual influences between functor mappings are proposed. Several lemmas are formulated and proved, which mathematically justify the authors' proposed toolkit for modeling uncertainty. Examples of the application and interpretation of the described phase models are given. The prospects for further research and the possible development of uncertainty modeling in educational programs using phase-category tools are considered.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;program learning outcomes</kwd>
        <kwd>uncertainty</kwd>
        <kwd>modeling and structuring of educational content</kwd>
        <kwd>weight coefficients</kwd>
        <kwd>personal educational trajectories</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The higher education system in Ukraine is undergoing profound reforms related to the transition
to a competency-based approach and the updating of state standards. The new standards no longer
define program learning outcomes (PLOs), but only outline integral competencies and a list of
general and professional competencies. The formulation of SLOs is entrusted directly to the
developers of educational programs, which, on the one hand, increases the autonomy of
educational institutions, but on the other hand, creates the challenge of ensuring transparent and
reasonable correspondence between SLOs and the competencies defined by the standards.</p>
      <p>In such conditions, the content of educational disciplines becomes crucial. Disciplines are
carriers of knowledge and skills that, through the formation of SLOs, ensure the achievement of
graduate competencies. Gaps or duplications in course topics or imbalances in their structure
directly affect the quality of training, even if formally the program covers all the necessary PRN
and competencies. In this regard, it is important to find formalization tools that can assess the
quality of educational content not only at the level of an individual course, but also in the context
of the entire educational program.</p>
      <p>Traditional tools, such as knowledge graphs and ontological models, effectively model semantic
relationships, but are limited in expressing compositional and complex transformations between
elements of the educational process. Category theory, which emerged as a mathematical apparatus
for describing abstract structures and relationships, is increasingly being used in computer science,
logic, and system modeling. Its potential lies in its ability to formalize compositions, mappings
between structure levels, and consistent transformations, making this approach promising for the
educational sphere. The use of the categorical apparatus opens up opportunities for accurate
modeling of dependencies between the topics of the educational component, program learning
outcomes, and competencies, as well as for identifying critical nodes and gaps in the educational
content.</p>
    </sec>
    <sec id="sec-2">
      <title>2. The current state of research on the problem</title>
      <p>
        The issues of formalization and evaluation of educational programs are actively researched in
education, computer science, and applied mathematics. Modern approaches use network models,
ontologies, and knowledge graphs, which allow structuring educational content and reflecting the
connections between its components [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ]. Such tools provide visualization of educational
programs and partial quantitative analysis, but they are limited in expressing compositional and
multilevel representations between learning outcomes, program outcomes, and competencies.
      </p>
      <p>
        The use of mathematical methods for modeling and structuring educational content is one of
the leading areas of contemporary research. Examples include the analysis of educational programs
through network models [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], the development of curricular analytics for quantitative program
evaluation [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], and the construction of models for formalizing the interaction between educational
content and student learning trajectories [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Although most of the work focuses on mathematics
education, similar approaches are beginning to be actively implemented in the field of information
technology [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ], in particular for evaluating the effectiveness of courses using Bayesian networks
[
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and optimizing the integration of IT into digital education [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>The following abbreviations are used in Figure 1: TAD is an academic discipline topic; CLO is a
learning outcome; PLO is program learning outcome; Comp is competency.</p>
      <p>
        In this context, ontological models and knowledge graphs, which have proven to be effective
tools for organizing educational content [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ], play an important role. They allow formalizing the
conceptual apparatus of a discipline, reflecting hierarchical and semantic relationships between
concepts, and creating visual knowledge maps for navigation and search. In modern research, these
approaches are used to build domain ontologies of courses [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], model curricula and syllabi [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ],
support educational processes [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], and integrate educational materials into knowledge graphs
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
      <p>Despite this, in the context of a competency-based approach, ontologies and knowledge graphs
reveal a number of limitations. They are mostly declarative and do not describe the procedural
aspect of the formation of results and competencies, nor do they take into account the sequence or
alternatives of educational trajectories. Graph structures do not provide a strict compositional
logic, which makes it impossible to formally describe educational paths. The relationships between
the different levels of the educational structure, shown in Figure 1, are established by experts and
cannot be verified for consistency at. In addition, ontologies do not have built-in mechanisms for
quantitative assessment of program coverage or balance.</p>
      <p>
        These limitations necessitate the use of more formalized models capable of describing
compositional relationships and mappings between different levels of the educational process. Such
possibilities are provided by category theory, which provides a rigorous mathematical apparatus
for modeling structures and relations. Its fundamental principles are set out in the classic works of
Mac Lane [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] and Awodey [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. In computer science, the categorical apparatus is actively used to
formalize programming languages and data types [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. Further research [
        <xref ref-type="bibr" rid="ref17 ref18">17, 18</xref>
        ] emphasizes that
categories provide a natural way to describe compositional structures, which creates the basis for
their application in educational processes.
      </p>
      <p>The key constructs of category theory—categories, functors, and natural transformations—allow
for the systematic modeling of multilevel educational structures. Subjects can be interpreted as
objects, logical dependencies between them as morphisms, and reflections in learning outcomes
and competencies as functors. Natural transformations, in turn, open up opportunities for
comparing different teaching strategies or learning scenarios.</p>
      <p>
        Of particular importance is the concept of Olog [
        <xref ref-type="bibr" rid="ref19 ref20">19, 20</xref>
        ], which demonstrates how knowledge
can be represented as a category with morphisms corresponding to semantic relations and form
mappings between different ontological structures. This brings the categorical approach closer to a
tool for modeling educational content.
      </p>
      <p>Thanks to this, category theory expands the possibilities of analysis: it allows not only to
formally describe the structure of educational content, but also to quantitatively assess the
coverage of competencies by topics, identify duplications or gaps, and explore the variability of
educational trajectories. Thus, the categorical approach emerges as a promising direction for
systematic assessment of the quality of training at the level of disciplines and educational
programs.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Application of category theory to describe educational programs</title>
      <p>We will apply category theory to describe educational programs in the form of a strict
mathematical structure, where objects are interpreted as topics or results, and morphisms as logical
dependencies between them. This approach allowed the authors to perform a formal check of the
consistency and coverage of the programs. Despite its novelty, this model operates exclusively with
binary relations: the presence or absence of a connection. It does not take into account the
variability of influences inherent in the real educational process.</p>
      <p>
        To account for the fuzziness in modeling educational systems, methods based on fuzzy set
theory are gaining increasing attention [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. In pedagogical analytics and educational research,
they are used to describe uncertainty in student knowledge assessments, in the formulation of
learning outcomes, and in the construction of individual educational trajectories [
        <xref ref-type="bibr" rid="ref22 ref23">22, 23</xref>
        ]. However,
these approaches usually remain at the level of individual fuzzy logic methods and are not
integrated into the overall structural model of the educational program.
      </p>
      <p>
        A promising direction for combining structural and fuzzy approaches is the use of fuzzy
categories. The idea was first proposed in works that generalize classical category theory by
introducing degrees of membership for morphisms [
        <xref ref-type="bibr" rid="ref24 ref25">24, 25</xref>
        ]. In computer science, phase categories
are used to model fuzzy databases, intelligent systems, and formalize uncertainty in algorithms [
        <xref ref-type="bibr" rid="ref26 ref27">26,
27</xref>
        ]. Such models allow you to simultaneously preserve composability and introduce a quantitative
measure of the strength of the connection.
      </p>
      <p>
        Despite the existence of developments in the field of mathematics and computer science, there
have been no attempts to apply phase categories directly to the modeling of educational programs
[
        <xref ref-type="bibr" rid="ref28">28</xref>
        ]. This creates a scientific gap: there is no formalized toolkit that would simultaneously take into
account both the multilevel structure of the educational process and the fuzziness of the
connections between its elements.
      </p>
      <p>Thus, analysis of the literature shows that:
1. Classical categorical models provide a rigorous apparatus for describing educational
structures, but do not take into account uncertainties.
2. Fuzzy logic methods allow working with fuzzy estimates, but do not integrate into the
structural description of programs.
3. Phase categories have the potential to combine both approaches, creating a generalized
model for analyzing educational programs.
3.1.</p>
      <sec id="sec-3-1">
        <title>Basic definitions</title>
        <p>
          Category. A category is a fundamental structure of category theory that generalizes the concepts
of sets and functions, focusing on the relationships between elements [
          <xref ref-type="bibr" rid="ref29 ref30">29, 30</xref>
          ]. It allows modeling
systems where not only individual components are important, but also the ways they interact. In
an educational context, a category can represent the structure of a discipline: topics as objects, and
logical or educational dependencies between them as morphisms. This makes it possible to
formalize the sequence of studying the material, identify cycles or alternative paths, which is
critical for a competency-based approach where the emphasis is on the integration of knowledge.
        </p>
        <p>Definition 1. Category C consists of:
1. A set of objects Obj (C )
2. A set of morphisms HomC ( A , B ) for each pair of objects A , B ∈ Obj (C )
3. The composition operation of morphisms: ∘:HomC(B,C)×HomC(A,B)→HomC(A,C)
4. Identity morphisms idA ∈ HomC(A,A) для кожного A∈Obj©.</p>
        <sec id="sec-3-1-1">
          <title>These elements satisfy the axioms: 1. 2.</title>
          <p>Associativity: for all f∈Hom(A,B), g∈Hom(B,C), h∈Hom(C,D): h∘(g∘f)=(h∘g)∘f.</p>
          <p>Unity: for every f∈Hom(A,B): idB∘f=f=f∘idA.</p>
          <p>In a pedagogical context, objects of a category are interpreted as topics or modules of a
discipline, and morphisms as logical or educational dependencies between them. The composition
of morphisms reflects the possibility of constructing educational trajectories through the sequential
mastery of topics.</p>
          <p>For example, let’s imagine a simple category for the discipline “Mathematics”: objects—
“Arithmetic,” “Geometry,” “Algebra”; morphisms—“dependency: Arithmetic → Algebra” (because
basic operations are necessary for equations). Composition allows us to create the trajectory
“Arithmetic → Geometry → Algebra,” which models logical progress in learning. This approach
helps to identify “critical nodes”—topics on which many others depend—and optimize the program
to avoid gaps.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Theoretical foundations of phase categories</title>
      <p>Classical category theory operates with objects and morphisms that either exist or do not exist.
This ensures rigor, but in the case of educational programs, it proves insufficient: the influence of a
subject on learning outcomes cannot always be described as binary. For example, one topic may
almost completely shape a certain outcome, another may only partially shape it, and a third may
shape it indirectly.
4.1.</p>
      <sec id="sec-4-1">
        <title>Phase sets</title>
        <p>
          To describe such situations, the apparatus of fuzzy sets [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] is used, in which each element is
assigned a degree of membership μ∈ [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ]. In a pedagogical context, μ can reflect the strength of
influence or the level of reliability of an expert assessment.
4.2.
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>Fuzzy category</title>
        <p>The phase category Cf generalizes the classical category by introducing a degree of membership for
each morphism. Thus, instead of the statement “there is a morphism from A to B,” we have “there
is a morphism from A to B with degree μ.
Example 1. Interpretation in education.
1.</p>
        <p>Objects: subject topics, learning outcomes (CLO), program outcomes (PLO), competencies
(Comp).</p>
        <p>Morphisms: relationships “provides,” “contributes,” “corresponds,” with an attached degree
μ showing the intensity of influence.
4.3.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Composition of morphisms</title>
        <p>Composition in the phase-category preserves the logic of the classical category, but takes into
account weaker links. A typical method is the minimum rule: μ(f∘ g)=min(μ(f), μ(g)).</p>
        <p>This means that the contribution of a topic to competence through intermediate results cannot
exceed the weakest link in the corresponding chain.</p>
        <p>Example 2. If the topic “Agile methodologies” with an intensity of μ=0.9 forms the CLO “uses
Scrum/Kanban,” and this CLO with an intensity of μ=0.7 corresponds to PLO11, then the total
contribution of the topic to PLO11 is 0.7.
4.4.</p>
      </sec>
      <sec id="sec-4-4">
        <title>Consistency with the classical model and composition axioms in phase categories</title>
        <p>
          Phase category Cf generalizes the classical category by allowing morphisms to have degrees of
membership μ ∈  [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ]. If all μ ∈  {0,1}, the phase category reduces to the classical category, where
morphisms are binary (either present or absent). However, to guarantee the rigor of the
phasecategorical approach, it is necessary to prove that the composition of morphisms in phase
categories satisfies the axioms of a category: associativity and unity. In this subsection, we formally
prove these axioms using the composition rule μ(f∘g)=min(μ(f), μ(g)), and illustrate their application
in an educational context.
        </p>
        <p>Assessing the quality of educational programs in modern higher education is a complex,
multilevel process that involves verifying the compliance of programs with state standards, professional
requirements, and stakeholder expectations. To formalize the relationships within education, we
will apply category theory according to the scheme shown in Figure 1.</p>
        <p>This model allowed us to present educational content in the form of a rigorous mathematical
structure and enabled a quantitative analysis of its consistency.</p>
        <p>However, this approach has limitations related to the binary nature of representations: each
relationship between elements of the educational program was interpreted as either present or
absent. In real life, relationships are rarely so clear-cut. The impact of a single subject on learning
outcomes can be significant or only partial; the formulation of outcomes often contains elements of
uncertainty; expert assessments of the alignment of program outcomes with competencies are
subjective and vague. As a result, the classical categorical model does not fully reflect the
complexity and variability of the educational process.</p>
        <p>
          To overcome this limitation, the article proposes using fuzzy categories, which generalize
classical categories by introducing degrees of membership of relations μ∈ [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ].
        </p>
        <p>In such a model, each morphism is assigned not only the fact of existence, but also a numerical
indicator of the strength or reliability of the connection. This allows formalizing the fuzziness
inherent in both the description of learning outcomes and expert assessments of their achievement.</p>
        <p>The purpose of this work is to develop a phase-categorical model for evaluating educational
programs that:
1. Preserves the compositional and rigorous nature of the categorical approach.
2. Takes into account the vagueness and unevenness of the connections between educational
elements.
3. Creates a basis for the development of software with support for analytics and
visualization.
4.4.1.</p>
      </sec>
      <sec id="sec-4-5">
        <title>Definition of a phase-category</title>
        <p>
          Let Cf be a phase-category consisting of:
1. A set of objects Obj(Cf ), which in an educational context are interpreted as topics (Ci),
learning outcomes (CLOj), program outcomes (PLOm), or competencies (Compm).
2. The sets of phase morphisms HomCf(A,B)⊆ [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ] for each pair of objects A,B∈ Obj(Cf), where
μ(f)∈ [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ] is the degree of membership of the morphism f: A→ B.
3. Morphism composition operations: for f: A→ B, g: B→ C, the composition g∘ f: A→ C is
defined as μ(g∘ f)=min (μ(f),μ(g)).
4. Identity morphisms: for each A∈  Obj(Cf), there exists idA:A→ A with μ(idA) = 1.
        </p>
        <p>These elements must satisfy the axioms of the category: associativity of composition and unity
of identity morphisms.</p>
        <p>Lemma 1: Associativity of composition. For any morphisms f: A→B, g: B→C, h: C→D in
the phase category Cf, the following holds</p>
        <p>h∘ (g∘ f)=(h∘ g)∘ f,
i.e.</p>
        <p>μ(h∘ (g∘ f))=μ((h∘ g)∘ f).</p>
        <p>Proof: Consider the composition of morphisms in a phase category. According to the
composition rule:</p>
        <p>μ(g∘ f)=min (μ(f),μ(g)).</p>
        <p>Then for the left side of the axiom:</p>
        <p>h∘ (g∘ f):A→D, μ(h∘ (g∘ f))=min (μ(h),μ(g∘ f))=min (μ(h), min (μ(f),μ(g))).</p>
        <p>
          Since the min operation is associative on [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ], we have:
        </p>
        <p>min (μ(h), min(μ(f), μ(g)))=min (min (μ(h), μ(g)), μ(f)).</p>
        <p>For the right side:</p>
        <p>(h∘ g)∘ f:A→D, μ((h∘ g)∘ f)=min (μ(h∘ g),μ(f))=min (min (μ(h), μ(g)), μ(f)).</p>
        <p>Since both sides are equal in terms of associativity min, then:</p>
        <p>μ(h∘ (g∘ f))=μ((h∘ g)∘ f).</p>
        <p>Therefore, the associativity axiom is satisfied.</p>
        <p>Example 3 in a pedagogical context: Let the objects in category CTopics be topics of the
discipline “Software Product Development Technology” (C1: Software Life Cycle, C2: Development
Methodologies, C3: Architectural Solutions), and the morphisms be:
1. f: C1→ C2, μ(f)=0.9 (the life cycle strongly influences methodologies).
2. g: C2→ C3, μ(g)=0.7 (methodologies partially determine architecture).
3. h: C3→ C4 , μ(h)=0.8 (architecture affects documentation).
4. Composition g∘ f:C1→ C3, μ(g∘ f)=min (0.9,0.7)=0.7.
5. h∘ (g∘ f):C1→ C4, μ(h∘ (g∘ f))=min (0.8, 0.7)=0.7.</p>
        <p>6. (h∘ g)∘ f:C1→ C4, μ(h∘ g)=min (0.8, 0.7)=0.7, μ((h∘ g)∘ f)=min (0.7, 0.9)=0.7.</p>
        <p>The equality μ(h∘ (g∘ f))=μ((h∘ g)∘ f)=0.7 confirms associativity, and the value μ=0.7 shows that the
strength of the relationship is limited by the weakest link (methodology → architecture).</p>
        <p>Lemma 2: Uniqueness of identical morphisms. For any morphism f: A→ B in phase
category Cf, the following holds</p>
        <p>idB∘ f=f, f∘ idA=f,
that is</p>
        <sec id="sec-4-5-1">
          <title>Similarly:</title>
          <p>μ(idB∘ f)=μ(f), μ(f∘ idA )=μ(f).</p>
          <p>Proof: By definition, μ(idA) = 1 for any A ∈  Obj(Cf). Consider the composition:
μ(idB∘ f)=min (μ(idB), μ(f))=min (1,μ(f))=μ(f).
μ(f∘ idA )=min (μ(f), μ(idA))=min (μ(f), 1)=μ(f).
Since μ(idB∘ f)=μ(f) and μ(f∘ idA )=μ(f), the unity axiom is satisfied.</p>
          <p>Example 4 in a pedagogical context: Let in category CCLO objects are learning outcomes
(CLO1: Applies Scrum/Kanban, CLO2: Develops technical specifications), and the morphism f:
CLO1→CLO2, μ(f)=0.6 (Scrum partially affects technical specifications). Then:
idCLO2∘ f: CLO1→CLO2, μ(idCLO2∘ f)=min (1, 0.6)=0.6=μ(f);
f∘ idCLO1 : CLO1 →CLO2, μ(f∘ idCLO1 )=min (0.6, 1)=0.6=μ(f).</p>
          <p>This confirms that identical morphisms act neutrally, preserving the degree of connection.
4.4.2.</p>
        </sec>
      </sec>
      <sec id="sec-4-6">
        <title>Consistency with the classical model</title>
        <sec id="sec-4-6-1">
          <title>If μ(f)∈ {0,1} for all morphisms, then:</title>
          <p>μ(f)=1 corresponds to the presence of a connection (classical morphism)
μ(f)=0 corresponds to its absence.</p>
          <p>The composition μ(g∘f)=min (μ(f), μ(g)) reduces to the classical one: if μ(f)=1, μ(g)=1, then
μ(g∘f)=1; if at least one μ=0, then μ(g∘f)=0. Identical morphisms with μ(idA )=1 correspond to
classical idA. Thus, the phase category is a generalization of the classical one, preserving its axioms.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Phase-categorical model of the educational process</title>
      <p>The proposed model aims to formalize the relationships between subject topics, learning outcomes,
program outcomes, and competencies, taking into account the vagueness and unevenness of their
influences. It generalizes the previous categorical model by using phase categories, which allows
describing not only the structure but also the strength of the relationships.
5.1.</p>
      <sec id="sec-5-1">
        <title>Different levels of the model</title>
        <sec id="sec-5-1-1">
          <title>The model is constructed as a sequence of four categories:</title>
          <p>CTopics—category of discipline topics.</p>
          <p>CCLO—ategory of course learning outcomes.</p>
          <p>CPLO—category of program learning outcomes.</p>
          <p>CComp —category of competencies defined by higher education standards.</p>
          <p>The objects in each category correspond to specific elements of the curriculum, and morphisms
describe their internal dependencies (for example, logical transitions between topics or
interrelationships between competencies).
5.2.</p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>Phase functors</title>
        <p>
          To establish correspondences between the levels of the model (described in subsection 4.1: CTopics,
CCLO, CPLO, CComp), phase functors are introduced, which generalize classical functors by taking into
account the degrees of membership μ ∈  [
          <xref ref-type="bibr" rid="ref1">0,1</xref>
          ] for each mapping. This allows modeling fuzzy
relationships, such as the partial contribution of a topic to the learning outcome or the subjective
reliability of the program outcome’s correspondence to competence. Phase functors preserve
composability and category axioms (associativity and unity), as proven in subsection 3.4, but add a
quantitative measure of the strength of the relationship.
        </p>
        <p>Definition of a phase functor. Let Cfand Dfbe two phase categories. The phase functor Ff:
Cf→ Df is defined as:
1.
2.</p>
        <sec id="sec-5-2-1">
          <title>Mapping of objects: for each object A∈ Obj(Cf), Ff(A)∈ Obj(Df). Morphism mapping: for each morphism f: A→ B with μ(f)∈ [0,1], there exists a morphism</title>
          <p>
            Ff(f): Ff(A)→Ff(B) with μ(Ff (f))∈[
            <xref ref-type="bibr" rid="ref1">0,1</xref>
            ], where μ(Ff (f))=μ(f) (or another function that preserves
order, but in our model – direct transfer for simplicity).
          </p>
          <p>Composition preservation: for f: A→B, g: B→C, μ(Ff(g∘f))=min(μ(Ff(f)), μ(Ff(g)))
=min(μ(f),μ(g)).
4. Preservation of identity morphisms: μ ( F f (id A))= μ (id F f ( A))= 1.</p>
        </sec>
        <sec id="sec-5-2-2">
          <title>Three phase functors are introduced in our model:</title>
          <p>1. F0: CTopics→ CCLO, which reflects the topics of disciplines in the learning outcomes of
disciplines (CLO).
2. F1: CCLO→ CPLO, linking learning outcomes to program outcomes (PLO).
3. F2 : CPLO→ CComp, which reflects program outcomes in competence (Comp).</p>
          <p>
            Each mapping Fi is assigned a degree of membership μ(Fi(f)) ∈  [
            <xref ref-type="bibr" rid="ref1">0,1</xref>
            ], which characterizes the
strength or reliability of the corresponding relationship. For example, if the topic “Agile
methodologies” strongly influences the CLO “uses Scrum/Kanban” (μ=0.9), but the CLO only
partially corresponds to the PLO “project management” (μ=0.7), then the composition is limited to
min (0.9, 0.7)=0.7.
5.3.
          </p>
        </sec>
      </sec>
      <sec id="sec-5-3">
        <title>Proving the preservation of axioms for phase functors</title>
        <p>Phase functors preserve category axioms, as shown in Section 3.4 for composition of morphisms.
Here we prove that the phase functor Ff preserves associativity and unity under transfer.</p>
        <p>Lemma 3: Preservation of associativity. Let f: A→ B, g: B→ C, h: C→ D in Cf.
Then Ff(h∘ (g∘ f)) = Ff((h∘ g)∘ f).</p>
        <p>Proof:</p>
        <p>On the left side: μ(Ff(h∘ (g∘ f)))=μ(h∘ (g∘ f))=min (μ(h), min(μ(g), μ(f)))=min(μ(h), μ(g), μ(f)). From
the right: similarly, min(min(μ(h), μ(g)), μ(f))=min(μ(h), μ(g), μ(f)). The equality holds by the
associativity of min.</p>
        <p>Lemma 4: Preservation of unity. Let f: A→ B.</p>
        <p>Then Ff(idB∘ f)=Ff(f) and Ff(f∘ idA)=Ff(f).</p>
        <p>Proof:
μ(Ff(idB∘ f)) = min (1,μ(f)) = μ(f) = μ(Ff(f)). Similarly, for f∘ idA. ■</p>
        <p>These proofs confirm that phase functors are a correct generalization of classical ones,
preserving mathematical consistency.</p>
        <p>Example 5 of application in an educational context. Consider the phase functor F0: CTopics→
CCLO for the discipline “Software Product Development Technology.” Objects: topics C1 (Software
Life Cycle), C2 (Development Methodologies); CLO: CLO1 (Understanding the Life Cycle),
CLO2(Applying Agile). Morphism f: C1→C2, μ(f)=0.8 (the life cycle partially determines the
methodologies). Then F0(f): CLO1→CLO2, μ(F0(f))=0.8, which reflects a fuzzy influence.
5.4.</p>
      </sec>
      <sec id="sec-5-4">
        <title>Diagram of functor mappings</title>
        <p>To visualize phase-functor mappings, a diagram is provided (Figure 2), where edges with weights μ
illustrate the strength of connections between model levels. The diagram shows the complete chain
from topic C2 to competency SC10 via CLO and PLO, with composition μ(F)=min(μ(F0), μ(F1), μ(F2)).</p>
        <p>Figure 2 illustrates phase-functor mappings between model levels. Each functor Fi is labeled
with a weight μ indicating the strength of the link (e.g., μ(F0) = 0.9 for a strong influence of the
topic on CLO). The composition F(dotted arrow) shows the overall path from topic C2 to
competency SC10, where μ(F)=0.7 is limited by the weakest link (F1. This allows for visual analysis
of imbalances; for example, if μ(F1)&lt;0.5, then the entire chain is considered weak, signaling a gap in
the program.</p>
        <p>Phase functors provide flexibility to the model, allowing for the integration of expert
assessments or automated calculations of μ (e.g., based on NLP analysis of syllabi).
5.5.</p>
      </sec>
      <sec id="sec-5-5">
        <title>Weight coefficients of interactions between functor mappings</title>
        <p>Determining the weight of edges is a separate important and complex task. Its solution requires the
use of different approaches or the development and justification of new methods. Various
approaches can be proposed to determine the weight of edges:</p>
        <sec id="sec-5-5-1">
          <title>1. Expert</title>
          <p>2. A posteriori
3. Test
4. Axiomatic
5. Combined—as a justified combination of the four approaches mentioned above.</p>
          <p>We will briefly describe the content and directions of research related to the above approaches
to determining the numerical values of weight coefficients of mutual influences between functor
mappings, schematically shown in Figure 2.</p>
          <p>
            The expert approach is the most acceptable today, since this area of research is insufficiently
developed and the best tool in such cases is expert judgment and adequately developed expert
technologies [
            <xref ref-type="bibr" rid="ref31">31</xref>
            ].
          </p>
          <p>
            The a posteriori approach consists in a posteriori determination of the level of influence on
Comp competencies through CLO and PLO based on the known results of applying the
phasecategorical model of the educational process proposed by the authors to specific educational
programs implemented in specific higher education institutions [
            <xref ref-type="bibr" rid="ref32">32</xref>
            ].
          </p>
          <p>
            The test approach can be applied to already implemented and operating educational programs by
testing students who have mastered the relevant programs and formally received documentary
confirmation of this [
            <xref ref-type="bibr" rid="ref33 ref34">33, 34</xref>
            ].
          </p>
          <p>
            Note: Testing of students can be carried out both during their studies and for graduates of
higher education institutions [
            <xref ref-type="bibr" rid="ref35">35</xref>
            ]. Testing can be applied to students of different courses and
different levels of academic achievement. In this case, it is necessary to apply clustering methods
[
            <xref ref-type="bibr" rid="ref36">36</xref>
            ] to preliminarily reduce the dispersion when analyzing the results obtained.
          </p>
          <p>
            The axiomatic approach is based on the a priori use of expert judgments and consists in the
preliminary determination of the level of influence depending on the “weight” of the components,
i.e., the number of results, disciplines related to the educational program in force at the higher
education institution [
            <xref ref-type="bibr" rid="ref37">37</xref>
            ].
          </p>
          <p>The combined approach is a reasonable combination of the four approaches mentioned above, or
the use of only some of these four.
5.6.</p>
          <p>Interpretation of phase reflections
1. If μ is close to 1, the relationship almost completely determines the correspondence
between the elements (for example, the topic directly shapes a specific learning outcome).
2. If μ has an intermediate value, the relationship is partial or depends on additional
conditions (e.g., the topic contributes to the outcome only in combination with others).
3. If μ is low (e.g., μ &lt; 0.3), the influence is weak or indirect.
5.7.</p>
        </sec>
      </sec>
      <sec id="sec-5-6">
        <title>Composition in the phase model</title>
        <p>Thanks to the compositional nature of the categories, it is possible to trace the contribution of
topics to the final competencies through all intermediate levels. The corresponding degree of
belonging is calculated as a minimum across all links:</p>
        <p>μtopic→Comp= min(μtopic→CLO, μCLO→PLO, μPLO→Comp).</p>
        <p>This reflects the principle that “the strength of a chain is determined by its weakest link.” Thus,
even if the connection between the topic and the learning outcome is strong, but the subsequent
reflection in competence is weak, the overall contribution of the topic to competence will be
limited.
5.8.</p>
      </sec>
      <sec id="sec-5-7">
        <title>Weight maps</title>
        <p>The result of building the model is a set of “weight maps” between all levels of the educational
process. They can be represented as adjacency matrices with weights μ or as graphical diagrams
where the thickness of the edges is proportional to the strength of the connection. Such maps
provide a transparent visualization of the coverage of competencies and allow you to identify:</p>
        <sec id="sec-5-7-1">
          <title>1. the topics with the greatest contribution to competencies. 2. critical “weak spots” in the program. 3. duplication or imbalance in the structure of learning outcomes.</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Example of the application of the phase-categorical model</title>
      <p>To demonstrate how the phase-categorical model works, let us consider the program learning
outcome PLO11 of the educational program “Computer Science.” In the classical category model,
this outcome is linked to a number of subject areas through learning outcomes (CLO). However,
the links are interpreted as binary—either present or absent. The use of phase categories allows
each link to be given a numerical assessment of its strength of influence.
6.1.</p>
      <sec id="sec-6-1">
        <title>Initial data</title>
        <p>The model uses three subject areas that are part of different educational components (EC):</p>
        <sec id="sec-6-1-1">
          <title>1. EC21 “Agile methodologies.”</title>
          <p>2. EC28 “Software Documentation.”
3. EC31 “Requirements Engineering.”</p>
          <p>Each topic is reflected in the corresponding learning outcomes (CLO), which in turn are linked
to PLO11. For each reflection, experts determined the degree of relevance μ, which reflects the
strength of influence.
6.2.</p>
        </sec>
      </sec>
      <sec id="sec-6-2">
        <title>Assignment of weighting coefficients</title>
        <p>Topic “Agile methodologies” → CLO “applies Scrum/Kanban” (μ=0.9).</p>
        <p>Topic “Software Documentation” → CLO “develops technical specifications” (μ=0.6).
Topic “Requirements engineering” → CLO “specifies requirements” (μ=0.8).
CLO “uses Scrum/Kanban” → PLO11 (μ=0.7).</p>
        <p>CLO “develops technical specifications” → PLO11 (μ=0.5).</p>
        <p>CLO “specifies requirements” → PLO (μ=0.9).
6.3.</p>
      </sec>
      <sec id="sec-6-3">
        <title>Calculation of phase compositions</title>
        <p>The total contribution of the topic to PLO11 is determined as the minimum of the values μ on the
path “topic → CLO → PLO11”. Results obtained:</p>
        <p>Agile methodologies: min (0.9, 0.7)=0.7.</p>
        <p>Software documentation: min (0.6, 0.5)=0.5.</p>
        <p>Requirements engineering: min (0.8, 0.9)=0.8.</p>
        <p>Thus, the topic “Requirements engineering” has the greatest contribution to the formation of
PLO11, while “Software documentation” plays a supporting role.
6.4.</p>
      </sec>
      <sec id="sec-6-4">
        <title>Reflection in competence</title>
        <p>Next, we will consider the reflection of PLO11 in the competence of the educational program. For
example, PLO11 can form:
1. SC10 “Ability to apply software engineering methods” (μ=0.8).
2. SC15 “Ability to engage in project activities” (μ=0.6).</p>
        <p>Then the contribution of topics to competence is calculated using the same logic:
1.
2.
3.
4.
5.
6.</p>
        <p>Agile methodologies → SC10: min (0.7, 0.8)=0.7.</p>
        <p>Agile methodologies → SC15: min (0.7, 0.6)=0.6.</p>
        <p>Software documentation → SC10: min (0.5, 0.8)=0.5.</p>
        <p>Software documentation → SC15: min (0.5, 0.6)=0.5.</p>
        <p>Requirements engineering → SC10: min (0.8, 0.8)=0.8.</p>
        <p>Requirements engineering → SC15: min (0.8, 0.6)=0.6.
6.5.</p>
      </sec>
      <sec id="sec-6-5">
        <title>Visualization</title>
        <p>To illustrate the results, a “phase map” was constructed in the form of a weighted graph, where the
nodes correspond to topics (Ci), learning outcomes (CLOj), program outcomes (PLO11), and
competencies (SC10, SC15), and the thickness of the edges is proportional to μ (Figure 3). An
alternative representation is an adjacency matrix, where the cells reflect the strength of the
connection.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Analytical results</title>
      <p>Testing the phase-categorical model using the example of PLO11 allowed us to draw a number of
important analytical conclusions that cannot be identified in the classical binary model.
7.1.</p>
      <sec id="sec-7-1">
        <title>Identification of critical topics</title>
        <p>The calculated membership values showed that the topic “Requirements Engineering” has the
greatest contribution to the formation of PLO11 and related competencies (μ=0.8). This information
is valuable for curriculum design, as it allows us to identify the disciplines and topics that play a
key role in achieving the target results.</p>
      </sec>
      <sec id="sec-7-2">
        <title>Identification of weakly related elements</title>
        <p>The topic “Software Documentation” showed a weak influence on PLO11 (μ=0.5), which may
indicate the auxiliary nature of this content block. In the classical model, this connection would be
marked as “present,” but the phase approach allows us to record its low intensity and classify it as
secondary.
7.3.</p>
      </sec>
      <sec id="sec-7-3">
        <title>Balance analysis</title>
        <p>Comparing the weight contributions between topics allows us to assess the balance of the program.
It was found that PLO11 is formed mainly due to the topic “Requirements Engineering,” while other
topics have a less pronounced influence. This indicates an imbalance, which can be both positive
(focus on key competencies) and negative (risk of underestimating auxiliary skills).</p>
        <p>Table 1 shows the adjacency matrix for the discipline “Software Product Development
Technology,” which quantitatively describes the relationships between topics, CLOs, PLOs and
competencies. For example, the value μ=0.8 for C4→SC10 indicates a strong contribution of the topic
“Requirements Engineering” to the competency “Software Engineering Methods,” while μ=0.5 for
C3→SC10 reflects a weaker connection for “Software Documentation.” In both cases, the model
allows for a clear identification of strong and weak contributions, which is the basis for analyzing
balance and identifying gaps in the program (see subsection 6).
7.4.</p>
      </sec>
      <sec id="sec-7-4">
        <title>Gap analysis</title>
        <p>The aggregated values of μ for competencies showed that some of them have low total coverage
(&lt;0.5). This indicates potential gaps in the program that need to be addressed by introducing
additional topics or revising existing learning outcomes. For example, in the case of SC15 (“Ability
to engage in project activities”), the value μ=0.5–0.6 indicates insufficient development of this
competency.
C2: Agile methodologies</p>
        <sec id="sec-7-4-1">
          <title>C3: Software documentation</title>
        </sec>
        <sec id="sec-7-4-2">
          <title>C4: Requirements Engineering</title>
        </sec>
        <sec id="sec-7-4-3">
          <title>CLO1: Uses Scrum/Kanban</title>
        </sec>
        <sec id="sec-7-4-4">
          <title>CLO2: Develops technical</title>
          <p>specifications</p>
        </sec>
        <sec id="sec-7-4-5">
          <title>CLO3: Analyzes requirements</title>
        </sec>
        <sec id="sec-7-4-6">
          <title>PLO11: Project Management</title>
        </sec>
        <sec id="sec-7-4-7">
          <title>SC10: Software engineering </title>
          <p>methods
SC15: Project activities
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0</p>
        </sec>
      </sec>
      <sec id="sec-7-5">
        <title>Comparison with the classical model</title>
        <p>In the classical categorical-binary model, all three topics are equally considered to “ensure” PLO11.
In contrast, the phase model showed a qualitatively different picture:</p>
        <sec id="sec-7-5-1">
          <title>1. it identified a theme with a dominant influence.</title>
          <p>2. it showed weak and secondary connections.
3. it made it possible to quantitatively assess the balance and identify gaps.</p>
          <p>This confirms that the phase-categorical model is a significant improvement on the classical
approach and allows for more accurate and relevant analytics to ensure the quality of educational
programs.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>8. Discussion</title>
      <p>
        The proposed phase-categorical model creates new opportunities for the analytics of educational
programs, combining the rigor of the categorical approach with the flexibility of fuzzy set theory
[
        <xref ref-type="bibr" rid="ref38 ref39">38, 39</xref>
        ]. The use of degrees of connection intensity eliminates the limitations of binary models,
which is especially important for programs where individual topics have different weights in the
formation of competencies. Compositional structure makes it possible to trace the influence from a
topic to a competency through several levels of generalization without losing information about
weak links. At the same time, the model remains compatible with classical categorical logic, which
guarantees the preservation of formal rigor.
      </p>
      <p>
        However, the use of phase categories is associated with a number of challenges. The key issue is
the subjectivity of expert assessments when assigning weight coefficients, as different experts may
interpret the significance of topics or results differently. Also, the lack of uniform methodological
recommendations for scaling within the interval [
        <xref ref-type="bibr" rid="ref1">0,1</xref>
        ] can lead to ambiguous results. An additional
0
0
0
0
0
0
0
0
limitation is the complication of computational procedures as the number of elements increases,
which requires the creation of effective algorithms and specialized visualization tools.
The software implementation of the model has particular promise. Its architecture may include
modules for collecting data from syllabi and curricula, a database of weighting coefficients, an
algorithmic block for calculating phase compositions, and means of visualizing the results in the
form of graphs, heatmaps, or adjacency matrices. In addition to expert input of coefficients, it is
possible to automatically determine their values using NLP analysis of syllabi or statistics on
student academic performance. In this form, the model can be integrated into education quality
management systems, accreditation platforms, and intelligent learning systems.
      </p>
      <p>
        An important area of application is the support of adaptive learning. If weight coefficients are
updated based on individual student performance, it becomes possible to form personal educational
trajectories aimed at strengthening poorly developed competencies. This opens up the prospect of
using phase categories not only in the context of auditing educational programs, but also in the
design of adaptive learning technologies [
        <xref ref-type="bibr" rid="ref40 ref41 ref42 ref43">40–43</xref>
        ]. Thus, the proposed approach combines
theoretical rigor, analytical flexibility, and practical significance, forming a promising direction in
the development of educational analytics tools.
      </p>
    </sec>
    <sec id="sec-9">
      <title>9. Conclusions</title>
      <p>The article presents a generalization of the categorical model of educational programs through the
application of phase categories. The proposed approach allows for the consideration of the
vagueness and varying intensity of the connections between topics, learning outcomes, program
outcomes, and competencies.</p>
      <p>The study showed that:
1. Phase categories provide a formalized apparatus for describing uncertainty in
representations of the educational process, while preserving the compositional and rigorous
nature of classical categorical logic.
2. Using the example of the PLO11 program outcome, it was demonstrated that the model
allows identifying critical topics with the greatest contribution to the formation of
competencies, revealing weak and secondary connections, and performing gap analysis.
3. A comparison with the binary categorical model confirmed that the phase approach
provides a much more accurate and flexible representation of the educational program.
4. The developed model creates a basis for practical implementation in the form of software
that can support the audit of educational programs, visualization of competency coverage,
and the construction of adaptive educational trajectories.</p>
      <p>Further research directions include:
1. Developing algorithms for automated determination of weighting coefficients based on
student performance statistics and NLP analysis of syllabi.
2. Integration of the model into learning management systems (LMS) and accreditation
platforms.
3. Conducting comparative studies of different educational programs and international
standards to assess the universality of the approach.</p>
      <p>Declaration on Generative AI
While preparing this work, the authors used the AI programs Grammarly Pro to correct text
grammar and Strike Plagiarism to search for possible plagiarism. After using this tool, the authors
reviewed and edited the content as needed and took full responsibility for the publication’s content.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Heileman</surname>
          </string-name>
          , et al.,
          <article-title>Curricular Analytics: a Data-Driven Approach to Curriculum Evaluation and Redesign</article-title>
          , in: ASEE Annu.
          <year>Conf</year>
          . &amp;
          <string-name>
            <surname>Expos</surname>
          </string-name>
          ., Salt Lake City, USA,
          <year>2018</year>
          ,
          <fpage>1</fpage>
          -
          <lpage>12</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>J.-B. LaGrange</surname>
          </string-name>
          ,
          <article-title>Analyzing Curricula with Graph Theory</article-title>
          , ZDM Math. Educ.,
          <volume>53</volume>
          (
          <year>2021</year>
          )
          <fpage>1129</fpage>
          -
          <lpage>1142</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Tuzón</surname>
          </string-name>
          , et al.,
          <source>Complex Networks Approach to Curriculum Analysis and Physics Education, Phys. Rev. Phys. Educ. Res.</source>
          ,
          <volume>21</volume>
          (
          <issue>1</issue>
          ) (
          <year>2025</year>
          )
          <fpage>010161</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hnatiienko</surname>
          </string-name>
          , et al.,
          <article-title>An Intelligent Cloud-based System for Conduction of an Enrollment Campaign</article-title>
          ,
          <source>in: Information Technologies and Security (ITS</source>
          <year>2022</year>
          ), vol.
          <volume>3503</volume>
          ,
          <year>2022</year>
          ,
          <fpage>161</fpage>
          -
          <lpage>176</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hnatiienko</surname>
          </string-name>
          , et al.,
          <article-title>Methods of Identifying the Correlation of Ukrainian Scientific Paradigms based on the Study of Defended Dissertations, in: Information Technology and Implementation (IT&amp;I 2023)</article-title>
          , vol.
          <volume>3646</volume>
          ,
          <year>2023</year>
          ,
          <fpage>64</fpage>
          -
          <lpage>75</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kardan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Speily</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bahrani</surname>
          </string-name>
          ,
          <article-title>Modeling the Effectiveness of Curriculum in Educational Systems using Bayesian Networks</article-title>
          , arXiv preprint,
          <year>2015</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.1506.02794
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>O.</given-names>
            <surname>Shkvyr</surname>
          </string-name>
          , et al.,
          <source>Mathematical Modeling of Information Technology Integration in Digital Education: A Regional Perspective</source>
          , Math. Model. Eng. Probl.,
          <volume>10</volume>
          (
          <issue>1</issue>
          ) (
          <year>2023</year>
          )
          <fpage>24</fpage>
          -
          <lpage>33</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hnatiienko</surname>
          </string-name>
          , et al.,
          <source>Some Aspects and Prospects of Artificial Intelligence Application in Educational Processes of the Agricultural Sector of the Economy, in: Applied Information Systems and Technologies in the Digital Society (AISTDS</source>
          <year>2024</year>
          ), vol.
          <volume>3942</volume>
          ,
          <year>2024</year>
          ,
          <fpage>26</fpage>
          -
          <lpage>43</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hnatiienko</surname>
          </string-name>
          , et al.,
          <source>Determining the Effectiveness of Scientific Research of Universities Staff, in: Information Technology and Interactions (IT&amp;I</source>
          <year>2020</year>
          ), vol.
          <volume>2833</volume>
          ,
          <year>2021</year>
          ,
          <fpage>164</fpage>
          -
          <lpage>176</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Boyce</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pahl</surname>
          </string-name>
          ,
          <article-title>Developing Domain Ontologies for Course Content</article-title>
          ,
          <source>in: Proc. 3rd IEEE Int. Conf. Adv. Learn. Technol.</source>
          ,
          <year>2003</year>
          ,
          <fpage>402</fpage>
          -
          <lpage>406</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Rani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. V.</given-names>
            <surname>Srivastava</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O. P.</given-names>
            <surname>Vyas</surname>
          </string-name>
          ,
          <article-title>An Ontological Learning Management System</article-title>
          ,
          <source>Comput. Appl</source>
          . Eng. Educ., Wiley Online Library,
          <volume>24</volume>
          (
          <issue>2</issue>
          ) (
          <year>2016</year>
          ). doi:
          <volume>10</volume>
          .1002/cae.21742
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>V.</given-names>
            <surname>Tkachenko</surname>
          </string-name>
          , et al.,
          <source>Ontological Approach in Modern Educational Processes, in: Cybersecurity Providing in Information and Telecommunication Systems</source>
          , vol.
          <volume>3654</volume>
          ,
          <year>2024</year>
          ,
          <fpage>73</fpage>
          -
          <lpage>82</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C.</given-names>
            <surname>Christou</surname>
          </string-name>
          , et al.,
          <article-title>An Ontology for Representing Curriculum and Learning Material (Curriculum KG Ontology)</article-title>
          ,
          <source>arXiv preprint</source>
          ,
          <year>2025</year>
          . doi:
          <volume>10</volume>
          .48550/arXiv.2506.05751
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mac</surname>
          </string-name>
          <string-name>
            <surname>Lane</surname>
          </string-name>
          ,
          <article-title>Categories for the Working Mathematician</article-title>
          , 2nd ed., New York: Springer,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Awodey</surname>
          </string-name>
          , Category Theory, 2nd ed., Oxford: Oxford Univ. Press,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Pierce</surname>
          </string-name>
          , Basic Category Theory for Computer Scientists, Cambridge, MA: MIT Press,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Arbib</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. G.</given-names>
            <surname>Manes</surname>
          </string-name>
          , Arrows, Structures, and Functors: The Categorical Imperative, New York: Academic Press,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>W.</given-names>
            <surname>Lawvere</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Schanuel</surname>
          </string-name>
          , Conceptual Mathematics: A First Introduction to Categories, Cambridge: Cambridge Univ. Press,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>D. I. Spivak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. E.</given-names>
            <surname>Kent</surname>
          </string-name>
          ,
          <article-title>Ologs: A Categorical Framework for Knowledge Representation</article-title>
          , Purdue e-Pubs,
          <year>2012</year>
          . https://arxiv.org/abs/1102.1889
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>D. I. Spivak</surname>
          </string-name>
          ,
          <article-title>Category Theory for the Sciences</article-title>
          , Cambridge, MA: MIT Press,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>L. A.</given-names>
            <surname>Zadeh</surname>
          </string-name>
          , Fuzzy Sets, Inf. Control,
          <volume>8</volume>
          (
          <issue>3</issue>
          ) (
          <year>1965</year>
          )
          <fpage>338</fpage>
          -
          <lpage>353</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>S.-M. Chen</surname>
            ,
            <given-names>C.-H.</given-names>
          </string-name>
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>J.-S.</given-names>
          </string-name>
          <string-name>
            <surname>Pan</surname>
          </string-name>
          ,
          <article-title>Fuzzy Logic Applications in Education and Learning</article-title>
          ,
          <source>Int. J. Fuzzy Syst</source>
          .,
          <volume>13</volume>
          (
          <issue>2</issue>
          ) (
          <year>2011</year>
          )
          <fpage>75</fpage>
          -
          <lpage>85</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>C.</given-names>
            <surname>Kahraman</surname>
          </string-name>
          (Ed.),
          <source>Fuzzy Logic in Its 50th Year: New Developments, Directions and Challenges</source>
          , Cham: Springer,
          <year>2016</year>
          , 404 p.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Šostak</surname>
          </string-name>
          , Fuzzy Categories, Czechoslovak Math. J.,
          <volume>28</volume>
          (
          <issue>3</issue>
          ) (
          <year>1978</year>
          )
          <fpage>469</fpage>
          -
          <lpage>480</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>U.</given-names>
            <surname>Höhle</surname>
          </string-name>
          , Monoidal Closed Categories, Weak Topologies and
          <string-name>
            <given-names>Generalized</given-names>
            <surname>Logics</surname>
          </string-name>
          , Fuzzy Sets Syst.,
          <volume>104</volume>
          (
          <issue>1</issue>
          ) (
          <year>1999</year>
          )
          <fpage>3</fpage>
          -
          <lpage>28</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>R.</given-names>
            <surname>Bělohlávek</surname>
          </string-name>
          ,
          <source>Fuzzy Relational Systems: Foundations and Principles</source>
          , New York: Kluwer Academic / Plenum Publishers,
          <year>2002</year>
          , 320 p.
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <surname>I. Stubbe</surname>
          </string-name>
          ,
          <article-title>Categorical Structures Enriched in a Quantaloid: Categories, Distributors and Functors</article-title>
          ,
          <source>Theory Appl</source>
          . Categ.,
          <volume>14</volume>
          (
          <issue>1</issue>
          ) (
          <year>2005</year>
          )
          <fpage>1</fpage>
          -
          <lpage>45</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>R.</given-names>
            <surname>Zulunov</surname>
          </string-name>
          , et al.,
          <source>Mathematical Models of the Modern Educational Space: Virtual Communication, Processing of Natural Language Information</source>
          , Normalization of Speech Signal,
          <source>in: Cybersecurity Providing in Information and Telecommunication Systems (CPITS 2025)</source>
          , vol.
          <volume>3991</volume>
          ,
          <year>2024</year>
          ,
          <fpage>223</fpage>
          -
          <lpage>338</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>B.</given-names>
            <surname>Fong</surname>
          </string-name>
          ,
          <string-name>
            <surname>D. I. Spivak</surname>
          </string-name>
          , Seven Sketches in Compositionality: An Invitation to Applied Category Theory, Cambridge: Cambridge Univ. Press,
          <year>2019</year>
          , 338 p.
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>B.</given-names>
            <surname>Milewski</surname>
          </string-name>
          ,
          <source>Category Theory for Programmers, Version 98b71ac</source>
          ,
          <year>2023</year>
          . https://bartoszmilewski.com/
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hnatiienko</surname>
          </string-name>
          ,
          <article-title>Methodological Framework for Addressing Manipulation in the Use of Expert Technologies for Decision-Making Challenges</article-title>
          ,
          <source>in: Information Technologies and Security (ITS</source>
          <year>2023</year>
          ), vol.
          <volume>3887</volume>
          ,
          <year>2023</year>
          ,
          <fpage>146</fpage>
          -
          <lpage>162</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hnatiienko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Snytyuk</surname>
          </string-name>
          ,
          <article-title>A Posteriori Determination of Expert Competence under Uncertainty</article-title>
          ,
          <source>in: Information Technologies and Security (ITS</source>
          <year>2019</year>
          ),
          <year>2019</year>
          ,
          <fpage>82</fpage>
          -
          <lpage>99</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>V.</given-names>
            <surname>Tsyganok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Kadenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Andriichuk</surname>
          </string-name>
          ,
          <article-title>Simulation of Expert Judgements for Testing the Methods of Information Processing in Decision-Making Support Systems</article-title>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Autom</surname>
          </string-name>
          . Inf. Sci.,
          <volume>43</volume>
          (
          <issue>12</issue>
          ) (
          <year>2011</year>
          )
          <fpage>21</fpage>
          -
          <lpage>32</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>M.</given-names>
            <surname>Povidaychyk</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Povidaychyk</surname>
          </string-name>
          ,
          <article-title>Modern Computer Technologies for Testing Students' Knowledge, Sci</article-title>
          . Bull. Uzhhorod Natl.
          <source>Univ. Ser.: Pedagogy. Social Work</source>
          ,
          <volume>21</volume>
          (
          <year>2011</year>
          )
          <fpage>160</fpage>
          -
          <lpage>163</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hnatiienko</surname>
          </string-name>
          , et al.,
          <article-title>Application of Expert Decision-Making Technologies for Fair Evaluation in Testing Problems</article-title>
          , in: Information Technologies and
          <string-name>
            <surname>Security (ITS</surname>
          </string-name>
          <year>2020</year>
          ), vol.
          <volume>2859</volume>
          ,
          <year>2021</year>
          ,
          <fpage>46</fpage>
          -
          <lpage>60</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>H.</given-names>
            <surname>Hnatiienko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Suprun</surname>
          </string-name>
          ,
          <article-title>Fuzzy Set Objects Clustering Method using Evolution Technologies</article-title>
          ,
          <source>in: Information Technologies and Security</source>
          , vol.
          <volume>2318</volume>
          ,
          <year>2018</year>
          ,
          <fpage>129</fpage>
          -
          <lpage>138</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>O.</given-names>
            <surname>Voloshyn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mashchenko</surname>
          </string-name>
          ,
          <article-title>Decision-Making Models and Methods: Teaching Manual for Students of Higher Education Closing</article-title>
          , 3rd ed., Kyiv: Liudmyla Publ.,
          <year>2018</year>
          , 292 p.
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>C.</given-names>
            <surname>Marsala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bouchon-Meunier</surname>
          </string-name>
          ,
          <article-title>Interpretable Monotonicities for Entropies of Intuitionistic Fuzzy Sets or Interval-Valued Fuzzy Sets</article-title>
          ,
          <source>in: Joint Proc. 19th World Congr. IFSA, 12th Conf. EUSFLAT, 11th Int</source>
          . Summer
          <string-name>
            <surname>School</surname>
            <given-names>AGOP</given-names>
          </string-name>
          , Atlantis Press,
          <year>2021</year>
          ,
          <fpage>48</fpage>
          -
          <lpage>54</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>A.</given-names>
            <surname>Voloshin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Gnatienko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Drobot</surname>
          </string-name>
          ,
          <article-title>A Method of Indirect Determination of Intervals of Weight Coefficients of Parameters for Metricized Relations between Objects</article-title>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Autom</surname>
          </string-name>
          . Inf. Sci.,
          <volume>35</volume>
          (
          <issue>1-4</issue>
          ) (
          <year>2003</year>
          ). doi:
          <volume>10</volume>
          .1615/JAutomatInfScien.v35.
          <year>i3</year>
          .
          <fpage>30</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>T.</given-names>
            <surname>Babenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hnatiienko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Vialkova</surname>
          </string-name>
          ,
          <article-title>Modeling of the Integrated Quality Assessment System of the Information Security Management System</article-title>
          ,
          <source>in: Information Technology and Interactions (IT&amp;I-2020)</source>
          , vol.
          <volume>2845</volume>
          ,
          <year>2021</year>
          ,
          <fpage>75</fpage>
          -
          <lpage>84</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>I.</given-names>
            <surname>Hanhalo</surname>
          </string-name>
          , et al.,
          <article-title>Adaptive Approach to Ensuring the Functional Stability of Corporate Educational Platforms under Dynamic Cyber Threats</article-title>
          ,
          <source>in; Cybersecurity Providing in Information and Telecommunication Systems</source>
          , vol.
          <volume>3991</volume>
          (
          <year>2025</year>
          )
          <fpage>481</fpage>
          -
          <lpage>491</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>V.</given-names>
            <surname>Buriachok</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Sokolov</surname>
          </string-name>
          ,
          <article-title>Implementation of Active Learning in the Master's Program on Cybersecurity, Advances in Computer Science for Engineering and Education II, vol</article-title>
          .
          <volume>938</volume>
          (
          <year>2020</year>
          )
          <fpage>610</fpage>
          -
          <lpage>624</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -16621-2_
          <fpage>57</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>V.</given-names>
            <surname>Buriachok</surname>
          </string-name>
          , et al.,
          <article-title>Implementation of Active Cybersecurity Education in Ukrainian Higher School</article-title>
          , Information Technology for Education,
          <source>Science, and Technics</source>
          , vol.
          <volume>178</volume>
          (
          <year>2023</year>
          )
          <fpage>533</fpage>
          -
          <lpage>551</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>031</fpage>
          -35467-0_
          <fpage>32</fpage>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>