<!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 />
    <article-meta>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Serhii Lienkov</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Viacheslav Podlipaiev</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Igor Tolok</string-name>
          <email>igortolok@72gmail.com</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Igor Lisitsky</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleksii Fedchenko</string-name>
          <email>a_fedchenko@ecomm.kiev.ua</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nataliia Lytvynenko</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Svitlana Kuznichenko</string-name>
          <email>skuznichenko@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Central Research Institute of Armament and Military Equipment of the Armed Forces of Ukraine</institution>
          ,
          <addr-line>Povitroflots'kyy Avenue, Kyiv, 03049</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dept.of Information Technologies Odessa State Environmental University</institution>
          ,
          <addr-line>Odessa</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Research Institute of Geodesy and Cartography</institution>
          ,
          <addr-line>Velyka Vasyl'kivs'ka Str., Kyiv, 03150</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Following research article describes the conditions for the formation of interactive knowledge bases, that are based on the formation of growing pyramidal networks in the analysis of textual narratives. The stability conditions of knowledge systems on the basis of their representation in the format of logical-linguistic models are determined. The authors also determined the conditions of atypical representation of linguistic constructs knowledge in the process of their transformation into a system. The use of lambda-calculus notation for the formation of stable logical-linguistic models of narrative descriptions is proposed.</p>
      </abstract>
      <kwd-group>
        <kwd>1 logical-linguistic model</kwd>
        <kwd>growing pyramidal networks</kwd>
        <kwd>concepts</kwd>
        <kwd>linguistic constructs</kwd>
        <kwd>term</kwd>
        <kwd>knowledge</kwd>
        <kwd>narrative</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The use of modern information in the activities
of various specialists today is quite deep
interdisciplinary. Moreover, the use of various
information resources in solving applied problems
requires the availability of service-developed
interactive knowledge bases. And the
effectiveness of their use depends on the truth of
the content, which is determined by the
information component.</p>
      <p>The practical main part of productive
knowledge today is concentrated in the form of
text descriptions. At best, these narratives have
their digital image in the form of their presentation
in the formats of various editors and means of
displaying texts in computer systems. However,
these digital images don’t have interactive
services. Therefore, it’s quite important to create
intelligent services that can turn these texts into
structurally organized knowledge bases.</p>
      <p>There is already the problem of using a large
number of narratives, which should sufficiently
expand intertextual connections. It allows to
create a digital image of knowledge systems used
in a single display format.</p>
      <p>The first stage of the process of transforming
narrative descriptions into the format of
interactive knowledge bases that are able to
interact with each other is the formation of
logical-linguistic models of text descriptions.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Research results and analysis</title>
    </sec>
    <sec id="sec-3">
      <title>2.1. The constructive of logicallinguistic models formation</title>
      <p>
        The information base of any interactive
knowledge system consists of different data types
[
        <xref ref-type="bibr" rid="ref1 ref2">1,2</xref>
        ]. These data have certain functional
properties and form a rather complex structure of
interdependent relations. Moreover, the very
information base of systems of this class is dual in
nature - the data that make it up have certain
logical relationships on the one hand, and also
some of them are certain concepts and linguistic
constructs (hereinafter concepts) on the other
hand, so data have linguistic attributes [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The
functionality of these data is displayed in the form
of symbolic and numerical formulas, and we
present certain sequences of computational
operations [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ]. The linguistic structures of these
data are presented in the form of a sequence of
certain words in the form of sentences, statements,
etc. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        However, it should be noted that everything
related to the data will be presented through the
concept of the term [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. It follows that each
sequence of symbols of finite length (SSFL),
including numbers, as well as their representation
in the form of formulas, can be considered as a
rule and can also be represented as a term. From
these formulas-rules it’s possible to form in the
future certain linguistic structures of the formal
kind that are displayed according to the syntax
defined for them.
      </p>
      <p>
        Further we will consider the final sequences of
characters that are plural in nature, that is, they
can be combined into plurals on certain grounds.
Moreover, these sets can be represented as
hierarchically related classes. Each such class
includes sequences that have at least one common
property [
        <xref ref-type="bibr" rid="ref1 ref3">1, 3</xref>
        ]. Such classes of SSFLs with
properties form the certain topology, and
therefore they can be represented as trees [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ].
One of such tree types is a growing pyramidal
network (GPN) [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ]. Their attractiveness is the
ability to automatically divide the SSFL into
appropriate classes based on the specified
properties of each SSFL.
      </p>
      <p>
        The condition that SSFLs are divided into
classes according to certain properties defines
them as intentional [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], that is those that have
signs-meanings, that we will define as the
contexts of SSFLs. Then SSFLs that have a
defined non-empty set of contexts will be defined
as concepts and denoted by the variables
x, y, z,... and the classes they form with letters
X ,Y , Z,... and so on. The presence of certain
contexts in SSFL-concepts will be represented
according to the notation of  -calculus
(lambdacalculus), namely - X   [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. The bracket   is
called “context holes”. It’s clear that the presence
of the hole determines that the concepts aren’t
connected. Once we determine the term that can
fill the hole, we get the connected SSFL terms.
      </p>
      <p>
        Then all classes formed by SSFL concepts are
extensional [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. We’ll define properties of
SSFLconcepts by the letter r , and set of properties
through R .
      </p>
      <p>
        The hierarchical structures formed from SSFL
in the form of GPN are marked trees. Their labels
are SSFL concepts, that are class names, and
SSFL-concepts, which aren’t extensional, that is
have only one semantic meaning. SSFL-concepts
that have only one meaning can’t be reduced, that
is broken down into simpler concepts. Such SSFL
concepts will be defined in the future as terminal
[
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ].
      </p>
      <p>
        All SSFL-concepts form a certain set of names
 , that are labels of all GPN nodes. Under such
conditions, GPN is unique to the set of Bohm trees
[
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1-3</xref>
        ]. That is, the topology of the interaction of
SSFL sets concepts can be represented as a set of
 - labeled trees formed by GPN nodes.
      </p>
      <p>  X1, X 2 ,..., X n , a1, a2 ,..., am , (1)
where X i – class of SSFL-concepts, a j –
terminal node (the non-extensional
SSFLconcept).</p>
      <p>
        Having determined the property classes
R1, R2,..., Rm , that implement the division of all
GPN concepts into classes, and determine the
relationship between the concepts, we obtain the
corresponding GPN. According to [
        <xref ref-type="bibr" rid="ref4 ref5 ref6">4-6</xref>
        ], each
GPN is a taxonomy.
      </p>
      <p>
        Based on the condition formulated at the
beginning, namely that an arbitrary type of SSFL
is a term, it can be argued that all names of
SSFLconcepts can form the set of terms  , that’s
represented in the notation of lambda calculus [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
This allows us to consider all SSFL-concepts and
their meanings nominally. This condition is met
on the basis that all the SSFL-concepts presented
in expression (1) aren’t related by a strict ordering
relationship. Moreover, when we move on to the
GPN, it’s always possible to distinguish many sets
of SSFL-concepts, that also aren’t related to the
relationship of strict ordering.
      </p>
      <p>
        We’ll note also one more constructive property
of GPN. Nodes that are hierarchically
interconnected can form truth statements that can
be calculated. Thus, based on the construction of
the GPN from SSFL-concepts, a certain system of
knowledge in terms of  -terms is formed. Its
information base consists of certain linguistic
structures formed from SSFL-concepts, that are
terms. The values of these terms required for
calculations are determined in the process of
assigning them the appropriate contexts. This
process is interactive. According to [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], each term
representing the certain SSFL-concept will be
represented in the form of the Bohm tree of the
form (1). Then we can say the following - there is
a meta-procedure that can turn the whole set of
linguistic constructs into GPN, which is a
composition of Bohm trees, that in turn is also a
composition of many  -terms, formed by
SSFLconcepts of the same GPN. Therefore, in fact, the
set of  -terms can be represented as a certain
interactive knowledge base (IKB).
      </p>
      <p>
        It’s clear that both functional data and
linguistic structures that make up an interactive
system of knowledge, that we present in the form
of a set of  -terms, have certain relationships
with each other, that is in a certain way logically
and functionally characterize each other.
Therefore, it’s most effective for further
consideration of the information base of arbitrary
IKB to present in aggregate form, which is
implemented in the form of the logical-linguistic
models (LLM) class. This class of models is
implemented on the basis of predicative
representation of information structures of
arbitrary type [
        <xref ref-type="bibr" rid="ref10 ref11 ref12 ref13 ref14 ref15 ref7 ref8 ref9">7-15</xref>
        ]. This allows us to consider
them together in an arbitrary sequence without
defining the relationship strictly and not strictly.
Also, all LLM objects are atypical. This
atypicality provides the definition of procedures
that can jointly process the entire complex data
structure that make up the information base of
interactive knowledge systems. Then the whole
set of such data will be defined as a separate class
of atypical data, that allows to interpret as nominal
[
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ].
      </p>
      <p>The predicativeness of the linguistic constructs
of IKB, as the composition of Bohm trees,
determines the nature of the formation of
statements from the nodes of these trees.
Moreover, the formation of GPN as the
composition of Bohm trees is also predictive.</p>
      <p>However, the process of LLM formation is
realized on the basis of determining the order
relation over certain sets of  -terms, that leads to
the loss of the nominal value of their terms. It
gives the calculation of the contextual meanings
of the terms semantic nature and thus implements
an interactive act of interaction with the
information base.</p>
      <p>X1, X 2 ,..., X n , a1, a2 ,..., am   </p>
      <p>
      (2)
 X 1, X 2 ,..., X n , a1, a2 ,..., am ;</p>
      <p>X 1 , X 2  ,..., X n   
 X 1B, X 2 D,..., X n V , P  ;
  U x1,x2 ,...,xn ,a1,a2 ,...,am ,
(3)
(4)
where  - the smallest element of all
SSFLcontext values; B, D,V , P - context values.</p>
      <p>Expressions (2) - (4) reflect the generalized
metaprocedure of IKB formation on the basis of
definition of context values of SSFL-concepts and
their transformation.</p>
      <p>The introduction of the smallest value of the
context and the definition of the contexts
themselves passively determines the order
relation over the set of  -terms, and thus creates
the conditions for the formation of the GPN  .
That is, expressions (2) - (4) are recursive.</p>
      <p>
        It can then be argued that an arbitrary LLM has
a nonempty structure of relationships between
SSFL-concepts, which has a hierarchical form and
can be represented as a tree. LLM is also an open
structure. This means that the information base,
the logical and linguistic characteristics of which
it represents, can be supplemented at any time
with the latest concepts and their relationships.
The open nature of LLM determines that this class
of models has the property of inductance. That is,
their graph model in the form of a tree can grow
due to the latest concepts and their relationships.
One of the effective types of graph models of
LLM is a growing pyramidal network (GPN) [
        <xref ref-type="bibr" rid="ref4 ref5">4,
5</xref>
        ]. Their positive distinguishing feature is the fact
that an arbitrary GPN is equivalent to an arbitrary
taxonomy of narrative description [
        <xref ref-type="bibr" rid="ref1 ref2 ref6">1, 2, 6</xref>
        ].
      </p>
      <p>
        The attributes of the concepts that make up the
GPN nodes can be contexts that describe their
semantics; belonging to a certain thematic class,
that is determined by their semantics; relations
between concepts, etc. That is, the inductive
process of forming the new nodes of the GPN can
be represented as a sequence of statements that are
formed on the basis of the contexts of each
inductively active concept. Thus, in the process of
forming GPN, as a structural reflection of LLM,
the formation of logical expressions of a certain
set of statements is realized. Using the attributes
of each concept of these statements, it’s possible
to form a formal expression in the form of a record
of the algebra of statements calculus [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. And the
names in this expression will be the names of
concepts. This determines that the GPN is
structurally unique in the formula of the algebra
of expressions, which is formed in terms of the
concepts of the GPN, that are propositional
variables, using logical operations: conjunction
“  ”, disjunction “V ”, negation “  ” and
following “  ”.
      </p>
    </sec>
    <sec id="sec-4">
      <title>2.2. The operational components of text transformation processes</title>
      <p>All constructs of LLM, namely: statements,
chains of knots of GPN, logical formulas are
certain terms. Linguistic constructs from terms
have an atypical representation and can also have
a propositional character, that determines the
nominal value of SSFL-concepts, which are
interpreted by formulas in the notation of
statements algebra. Moreover, contexts that
semantically define concepts that are
propositional variables also characterize these
concepts as dichotomous. This means that each
statement that is formed on the basis of the
concepts of the GPN is characterized by one of
two meanings, that is to answer arbitrary
questions in the format of “YES” or “NO”.</p>
      <p>For expressions (1) - (4), this means that they
are significant in the case of “YES”, and may not
be taken into account in the case of “NO”. That is,
provided that the contexts of the GPN form a true
expression formula (2) - (4), an interactive
knowledge base is formed. If there is a case of
“NO”, which means that the true statements
haven’t been formed, IKB or a fragment of these
GPN isn’t implemented.</p>
      <p>This greatly simplifies the formation of a
training sample for an interactive knowledge
system. It can be based on concepts whose
significance in relation to the question of
belonging to certain classes is true. That’s, to the
question of the existence of the certain certainty
that the concept of GPN belongs to certain class
or group of classes, we will always get the answer
“YES”. But it is clear that when the latest concepts
are included in the GPN, we will receive answers
not only “YES” but also “NO”. And this
determines the conditions for expanding the
training sample of the intelligent system.</p>
      <p>
        According to the homotopy type theory [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ],
GPN is unilateral to the decision tree. Therefore,
the representation of the GPN in the form of
formulas with propositional variables, that are the
concepts of the GPN, can be represented in the
form of the certain decision tree. Each formula of
propositional variables and logical operations that
is formed when interacting with the LLM of the
interactive knowledge base is determined by the
hierarchy of the classification structure of the
subject of interaction. Depending on the attributes
of the concepts of active LLM, we obtain the
value of belonging of the propositional variable to
certain classes of concepts, and thus form a formal
notation in the notation of the statements algebra
and further in the form of GPN.
      </p>
      <p>
        The atypical nature of expressions (1) - (4),
including the case of defining the contexts of
SSFL using propositional variables, means that
the type of meaning of these contexts isn’t
important for calculations. They can be both
numerical and non-numerical. Moreover, the
logical expressions from propositional variables
are quite stable to the order of their positioning in
the formal expression, so they can occupy an
arbitrary position in the record. Also, the values
that they receive in the calculation don’t require
determining the relationship of strict or non-strict
order. That’s, transformations (2) - (4) are always
able to determine the truth and objectivity of LLM
values [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
      </p>
      <p>Thus, the GPN is the primary LLM taxonomy
of the narrative of the document being processed.
The training sample, which is the primary basis of
the process of machine learning of the interactive
knowledge base, is formed from the concepts of
this narrative. Then formed on this basis, the GPN
provides a systematic reflection of all the
narratives that make up the primary information
base of the interactive knowledge system. The
systemology of the interactive knowledge base
follows from the systemology of LLM and GPN.
This provides a complete and correct
interpretation of the properties of all the concepts
that make it up. And as a consequence, it
implements the solution of problems of
classification of concepts that determine the latest
nodes of GPN, diagnosing the states of all
concepts on the basis of the formation of logical
formulas in the notation of the statements algebra.
Also, the systemology and dichotomy of
propositional expressions from the concepts of
GPN create conditions for predicting the presence
of certain properties in the newly formed nodes of
GPN.</p>
      <p>Prediction in our view of LLM can have a
truncated form of expression (2), which is
supplemented by a representation of the form (6),
namely:
X1, X 2 ,..., X n , a1, a2 ,..., am   </p>
      <p>
        
      (5)
 X 1, X 2 ,..., X n , a1, a2 ,..., am ,
   ,
(6)
where the contexts for all SSFL-concepts are
defined. In this case, the set of  -terms includes
certain functional expressions that implement
predictive calculations [
        <xref ref-type="bibr" rid="ref12 ref16">12, 16</xref>
        ].
      </p>
      <p>The decision tree, that is based on the
relationship between the concepts of the GPN, is
a composition of Bohm trees, and can be
converted into a propositional expression. Its
elementary expressions, within the conditions of
the specific problem, take the meaning of “true”
or “denial”. The calculation of these values is
realized on the basis of determining the degree of
belonging of the attributes of the new concepts to
the characteristic descriptions that make up the
contexts of the educational sample.</p>
      <p>Expressions (5) - (6) define not only different
functionalities, but also the systemic stability of
the latest concepts of GPN. To do this, the
procedure of discretization of  -terms set is
determined, which implements the definition of
the corresponding numerical scales, that consist of
intervals characteristic of the contexts values of
SSFL-concepts in a particular state. These
procedures also take into account the frequency
distribution of concepts in different classes,
thereby increasing their classification features in
the GPN, and as a consequence, systemic
accuracy. Another consequence is the formation
of more effective propositional expressions with
the use of the latest concepts of the GPN, which
are unique to the decision tree, and as a result
define more stable systemic rules.</p>
      <p>
          BT M   U x1,x2 ,...,xn , (7)

 a1, a2 ,..., am
where BT (M ) according to [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] - the marked tree,
M - the term which has solvability, that is all
statements formed from its SSFL -concepts are
true.
      </p>
      <p>Thus, the interactive system of knowledge,
that is implemented on the basis of the formation
of GPN in the process of processing documents
and narratives, is determined by the high stability
of the systemic features of the GPN concepts and
their relations. This is ensured by the following
procedural interpretation of the properties of the
GPNs themselves, as certain objects of a complex
hierarchical structure.</p>
      <p>1) Formation of propositional expressions in
the notation of the algebra expressions that
determine the classes of GPN concepts based on
the optimal definition and selection of attributes
combinations that are significant in the interval of
a certain scale. At the same time, due to the
application of the operation “negation”, the
procedure of minimizing the descriptions length
of each class defined in the GPN is also
implemented.</p>
      <p>2) Reliable classification of all concepts
included in the training sample for GPN, and as a
consequence of the formation of propositional
expressions that dynamically reveal the patterns
of both relevant classes of concepts and the
relationship between them, while regulating the
compactness of the training sample, excluding
quality assessment of patterns, that were
discovered.</p>
      <p>3) Defining the membership function, which
implements the mechanisms of fuzzy logic in
calculating the characteristic characteristics of
GPN concepts and their classes, and obtaining
clear and fuzzy levels of reliability and their
ranks, the validity of attribute features of concepts
and their properties and relationships, including
zero value type “I don’t know”.</p>
      <p>All these procedural actions ensure the
formation of GPN and on its basis LLM, that
determines the functional structure of the
interactive knowledge system. Based on them, the
linguistic-semantic and conceptual analysis and
processing of multilingual natural-language
narrative descriptions are realized in the
environment of the specified system. The
selection of linguistic constructs of different
length and complexity, identification and
selection of intercontextual relations for all
concepts that determine the semantic features of
GPN and LLM, including the educational sample,
is provided.</p>
      <p>GPN and as a consequence of LLM, that are
built on the basis of the above-described machine
learning procedures, are characterized by the
property of inductance. The further development
of GPN, based on the encapsulation of new
concepts, also expands the set of propositional
expressions, that are in fact certain linguistic
constructs, built on the application of logical
operations to disordered elementary records
statements that don’t have logical operators
inside.</p>
      <p>This is functionally represented by expressions
(2) - (7). When forming Bohm trees of the form
(4) under conditions that the contexts of their
nodes determine only the true values, we
implement recursion from expressions (2) - (4).</p>
      <p>The identification of intercontextual relations
in the process of the latest concepts encapsulation
and further inductive growth of the pyramidal
network, realizes the discovery of new statements
as systems of knowledge. The intercontexts of the
relationship are revealed through the logical
operation “conjunction”, and the direct growth of
GPN is realized by the use of logical operations
“disjunction”, “negation” and “following” both
direct and reverse.</p>
      <p>
        If we apply the rule of Godel's theorem on
incompleteness [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], we can determine that no
matter how many concepts aren’t encapsulated in
GPN and LLM, and no matter how many of their
contexts in GPN aren’t related, GPN, LLM and
interactive knowledge system are never will be
complete. The result is the formation of
indeterminate nodes, which are the result of
applying the “conjunction” operation to selected
sets of the training sample.
      </p>
      <p>All undefined nodes are concepts of complex
structure. Their concepts, like linguistic
constructs, have logical operations inside them
and can therefore take the form of complex
statements. Then such concepts can also be
presented in the form of propositional
expressions, that are able to define and classify the
latest concepts with a complex structure.</p>
      <p>Also, uncertainty concepts based on the use of
inductance properties implement the clustering
procedure, that provides identification of
semantically equivalent concepts and their
classes. The degree of this equivalence is
determined based on the application of the
membership function. Depending on the
significance of the degree of equivalence, the
concepts of uncertainty either form the newest
class or are included in an existing thematic class.</p>
      <p>After all, the measure of equivalence allows us
to apply the rule of logical inference “following”
by analogy. With a predetermined degree of
equivalence, it’s possible to draw conclusions
about the belonging of new concepts and their
classes to those already defined, and also to
determine the degree of certain statements
validity that are formed on the basis of concepts
whose contexts are relevant.</p>
    </sec>
    <sec id="sec-5">
      <title>3. Conclusions</title>
      <p>The methodology and formation of growing
pyramidal networks constructively ensures the
transformation of narrative texts into the format of
interactive knowledge bases. GPNs are able to
determine the conditions for the stability of
information databases of interactive knowledge
systems, to implement the transformation into
their formats of unstructured narrative
descriptions of various types, from scientific
articles to catalogs of scientific and technical
products, monographs and more.</p>
      <p>The conceptual basis of such transformations
in the form of atypical expressions provides the
implementation of intellectual services for
processing narratives by means of
linguisticsemantic and conceptual analysis with their
subsequent transformation into the format of
logical-linguistic models and interactive
knowledge bases.</p>
    </sec>
    <sec id="sec-6">
      <title>4. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>V.</given-names>
            <surname>Voevodsky</surname>
          </string-name>
          ,
          <source>Univalent Foundations of Mathematics: Proceedings of Logic, Language, Information and Computation</source>
          ,
          <source>WoLLIC</source>
          <year>2011</year>
          , in: Lev D. Beklemishev, Ruy de Queiroz (Eds.),
          <source>Lecture Notes in Computer Science</source>
          , volume
          <volume>6642</volume>
          , Berlin, Heidelber, Springer,
          <year>2011</year>
          , p.
          <fpage>311</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -20920-8.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>Homotopy</given-names>
            <surname>Type</surname>
          </string-name>
          <string-name>
            <surname>Theory</surname>
          </string-name>
          : Univalent Foundations of Mathematics, Princeton: Institute for Advanced Study,
          <year>2013</year>
          , 603 p.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>van</surname>
            <given-names>Dalen</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dirk</surname>
          </string-name>
          (
          <year>2013</year>
          ).
          <article-title>Logic and Structure</article-title>
          . Universitext. Berlin: Springer. doi:
          <volume>10</volume>
          .1007/978-1-
          <fpage>4471</fpage>
          -4558-5.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Dybjer</surname>
            ,
            <given-names>Peter</given-names>
          </string-name>
          &amp; Kuperberg,
          <string-name>
            <surname>Denis.</surname>
          </string-name>
          (
          <year>2012</year>
          ).
          <article-title>Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation</article-title>
          .
          <source>Ann. Pure Appl. Logic</source>
          .
          <volume>163</volume>
          .
          <fpage>122</fpage>
          -
          <lpage>131</lpage>
          .
          <fpage>10</fpage>
          .1016/j.apal.
          <year>2011</year>
          .
          <volume>06</volume>
          .021.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>V.</given-names>
            <surname>Gladun</surname>
          </string-name>
          ,
          <article-title>Processes of formation of new knowledge, Sophia</article-title>
          ,
          <source>SD "Teacher 6"</source>
          ,
          <year>1994</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>O.</given-names>
            <surname>Strizhak</surname>
          </string-name>
          ,
          <article-title>Transdisciplinary integration of information resources (Information Technology)</article-title>
          ,
          <source>PhD thesis</source>
          ,
          <source>The National Academy of Sciences of Ukraine, Inst. of Telecommunications and Global. inform. Space</source>
          , Kyiv,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Dymarsky</surname>
          </string-name>
          <article-title>Ways to embody the predicative relationship: Acta Linguistica Petropolitana, in: Proceedings of the Institute of Linguistic Research of the Russian Academy of Sciences</article-title>
          , in: N. N. Kazansky (Eds.), T. XI.
          <article-title>Part 1, Categories of nouns and verbs in the system of functional grammar</article-title>
          , in: M. D.
          <string-name>
            <surname>Voeikova</surname>
          </string-name>
          , E. G. Sosnovtseva (Eds.), Nauka,
          <year>2015</year>
          , pp.
          <fpage>41</fpage>
          -
          <lpage>62</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Understanding</given-names>
            <surname>Predication</surname>
          </string-name>
          . Series:
          <article-title>Studies in Philosophy of Language</article-title>
          and Linguistics / Edited By Piotr Stalmaszczyk // Peter Lang: Frankfurt am Main, Bern, Bruxelles, New York, Oxford, Warszawa, Wien,
          <year>2017</year>
          . - 292 pp. DOI: https://doi.org/10.3726/b11243.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>О.</given-names>
            <surname>Kulbabska</surname>
          </string-name>
          ,
          <article-title>Modern interpretations of the category of predication in linguistics, Ukrainian language</article-title>
          , №
          <volume>1</volume>
          ,
          <year>2009</year>
          , p.
          <fpage>61</fpage>
          -
          <lpage>73</lpage>
          . ISSN 1682-3540.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Ivanova</surname>
            <given-names>K.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vanhoof</surname>
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Markov</surname>
            <given-names>К.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Velychko</surname>
            <given-names>V</given-names>
          </string-name>
          . Introduction to the
          <source>Natural Language Addressing International Journal "Information Technologies &amp; Knowledge"</source>
          .
          <year>2013</year>
          . Volume
          <volume>7</volume>
          , Number 2. p.
          <fpage>139</fpage>
          -
          <lpage>146</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N. B.</given-names>
            <surname>Cocchiarella</surname>
          </string-name>
          ,
          <article-title>Philosophical Perspectives on Formal Theories of Predication</article-title>
          . In: Handbook of Philosophical Logic.
          <article-title>Synthese Library (Studies in Epistemology</article-title>
          , Logic, Methodology, and
          <source>Philosophy of Science)</source>
          , volume
          <volume>167</volume>
          , Springer, Dordrecht,
          <year>1989</year>
          , pp.
          <fpage>253</fpage>
          -
          <lpage>326</lpage>
          . doi.org/10.1007/
          <fpage>978</fpage>
          -94-009-1171-
          <issue>0</issue>
          _
          <fpage>3</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>V.</given-names>
            <surname>Velichko</surname>
          </string-name>
          ,
          <article-title>Logical-linguistic models as a technological basis of interactive knowledge bases</article-title>
          ,
          <source>International Journal "Information Models and Analyses"</source>
          , volume
          <volume>8</volume>
          , number 4,
          <year>2019</year>
          , pp.
          <volume>3</volume>
          <fpage>25</fpage>
          -
          <lpage>340</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>O.</given-names>
            <surname>Stryzhak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dovgyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Popova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Chepkov</surname>
          </string-name>
          ,
          <article-title>Transdisciplinary Principles of Narrative Discourse as a Basis for the Use of Big Data Communicative Properties</article-title>
          , in: Arai K. (Eds)
          <article-title>Advances in Information and Communication</article-title>
          ,
          <source>FICC 2021, Advances in Intelligent Systems and Computing</source>
          , volume
          <volume>1364</volume>
          , Springer, Cham,
          <year>2021</year>
          . doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -73103-8_
          <fpage>17</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>O.</given-names>
            <surname>Stryzhak</surname>
          </string-name>
          et al.
          <article-title>Decision-making System Based on The Ontology of The Choice Problem</article-title>
          ,
          <source>J. Phys.: Conf. Ser</source>
          .
          <year>1828</year>
          012007,
          <year>2021</year>
          . doi:
          <volume>10</volume>
          .1088/
          <fpage>1742</fpage>
          -
          <lpage>6596</lpage>
          /
          <year>1828</year>
          /1/012007.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Dovgyi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Stryzhak</surname>
          </string-name>
          ,
          <article-title>Transdisciplinary Fundamentals of Information-Analytical Activity</article-title>
          , in: M.
          <string-name>
            <surname>Ilchenko</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Uryvsky</surname>
          </string-name>
          , L. Globa (Ed.),
          <source>Advances in Information and Communication Technology and Systems. MCT 2019, Lecture Notes in Networks and Systems</source>
          , volume
          <volume>152</volume>
          , Springer, Cham,
          <year>2021</year>
          . doi.org/10.1007/978-3-
          <fpage>030</fpage>
          -58359-
          <issue>0</issue>
          _
          <fpage>7</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gonchar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Strizhak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Berkman</surname>
          </string-name>
          .
          <article-title>Transdisciplinary consolidation of information environments</article-title>
          , Communication, №
          <volume>1</volume>
          (
          <issue>149</issue>
          ),
          <year>2021</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>9</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>