1 Introduction
Semantics is one of the most challenging aspects of cognitive architectures. The Cognitive Theory of True Conditions (CTTC) is a proposal to describe the modeltheoretic semantics of symbolic cognitive architectures and to develop decisionmaking processes based on modeltheoretic semantics [2, 3]
. The main idea behind the CTTC is that the perceptual space is a set of formal languages that denote elements of a model embedded in a quotient space of the physical space. At this moment, the mathematical formulation of the CTTC is using the
multioptional manysorted past present future(MMPPF). structures. Also, the CTTC proposes a hierarchy of three formal languages to describe them.This article improves the previous characterization of the MMPPF structures and the hierarchy of the formal languages [2, 3]. The article is divided in three sections. The first section gives the mathematical definitions of MMPPF structures. The second section defines a hierarchy of three formal languages to describe an MMPPF structure. The last section addresses the semantics of the three formal languages of the hierarchy.
2 Multioptional Manysorted Past Present Future structures
A MMPPF structure is a nested structure of possible worlds. In other words, each world of the structure also contains another possible worlds structure. Thus, they are more complex than the classical structures of possible worlds used in temporal logics. This section includes the definitions of the MMPPF structure, temporal perspective structure, and state structure and its axioms. An MMPPF structure is constructed using temporal perspectives structures, and a temporal perspective structure is constructed using state structures. Thus, we define firstly a state structure, after a temporal perspective structure and finally an MMPPF structure. After the definitions, the axioms of the MMPPF structure are provided.
A state structure is a manysorted structure, and it is denoted by . Its definition is the following:
where the domains are



where

where

the functions are
and the relations are
where
The definition of an structure of temporal perspective, , is
where its domains are the following:

Each element of is denominated moment of time. Each moment of time is a set defined in the following way:
Being the constant denoted by the temporal perspective , the elements of a moment of time, , where , , , , and , fulfill the following:

If then

If then

If then
Each element of a moment of time is denominated reality.


It must be noted that the number of moment of times is the same to the number of elements that has


Associated with we use an auxiliary function, , which projects a part of an element that belongs to , to do definitions. The function is defined in the following way:
where .
The functions are the following:




where

where


and the relation is defined as follows:
Each fulfills that .
An MMPPF structure is formally defined as the tuple
where its domains are
its functions are





where

The following axioms define an MMPPF structure:

First Axiom
The first axiom determines that an essence element has assigned a value of any property if and only if is assigned to an object.

Second Axiom
The second axiom determines that a place of the space is assigned to an object if and only if it has assigned any value of any other property.

Third Axiom
The third axiom determines the relation between and .

Fourth Axiom
The fourth axiom ensures that an action acts independently of the assignment by .

Fifth Axiom
The fifth axiom determines that an essence element is only assigned to an object.

Sixth Axiom
The sixth axiom determines that the dependencies set is coherent with the changes from to .

Seventh Axiom
The seventh axiom determines that if state succeed state , it is because the objects can produce changes that generate from .

Eighth Axiom
The eight axiom determines that only assigns actions to an object when they modify that object.

Ninth Axiom
The ninth axiom determines that domains do not change from one temporal perspective to other.

Tenth Axiom
The tenth axiom determines in what period of time a temporal moment and its reality condition are situated.

Eleventh Axiom
The eleventh axiom determines that the change of reward and aversion sensation is coherent with the actions that the object carries out.
3 Formal languages to the MMPPF structures
The section defines three formal languages to describe an MMPPF structure: the perceptive language, the extended perceptive language and the categorical language. They are denoted , and respectively.
3.1 The perceptive language of MMPPF
The elements of the alphabet of the language are the following symbols:

A constant symbol for each element of

A constant symbol for each element of of

A constant symbol for each element of of each .

Two constant symbols, and , for the elements of

Three hybrid operators :, and

A constant symbol for each

A constant symbol for each

Four connectives , and .

Auxiliary symbols: and .
It must be noted that in the alphabet there are neither any kind of variables nor elements to design elements of the set .
A tuple of symbols is denoted as .
The language has the following three kinds of atomic formulas:

Type I: where


, ,



Type II: where


, ,


Type II: where


, ,


Any atomic formula is a well formed formula (wff).
The following rules determine when a wff combined with an atomic formula constitute a wff:

A wff and an atomic formula constitute a wff if and

A wff where and an atomic formula constitute a wff if any of the following conditions is fulfilled:

and

and

and

and


A wff where and an atomic formula constitute a wff if any of the following conditions is fulfilled:

and

and

and

and


A set of atomic formulas ,…, are a wff is a wff there are not a and where and .

A set of atomic formulas ,…, are a wff is a wff there are not a and where .
Finally, is a wff if and are wffs.
3.2 The extended perceptive language of MMPPF
is a language of description to MMPPF structures with a higher level of abstraction than . The definition of the requires the definition of the alphabets of metainformation , , , , and . These alphabets can be assigned to an object from its description in . Thus, the atomic formulas of can be built from formulas of . The rules to built a wff of are the same that the rules defined in .
The metainformation alphabet
The metainformation alphabet has two elements that are denoted by and . Thus,
The elements of the metainformation alphabets are relations. Thus, their definitions are the following:
Each element of is named momentary state. Using , a qualitative state is given to an object in a moment of time to the property. It describes whether an object has a specific quality without naming the specific value. Then, a functor of the language is defined, which maps each object in a moment of time and in relation to a property into the metainformation alphabet . It is denominated momentary state of the property and denoted by , which is defined in the following way:
where and a temporal situator.
The following formula can be built using the functor :
Thus, , which belongs to , is built from .
The metainformation alphabet
The metainformation alphabet has three elements that are denoted by , y . Thus,
As the elements of the metainformation alphabets are relations, their definitions are the following:
where
and
It is denominated temporal state of the property to the functor that is defined in the following way:
where
and
and
Using the functor , the following formula can be built:
Thus, , which belongs to , is built from .
The metainformation alphabet
The metainformation alphabet has three elements that are denoted by , and . Thus,
The elements of the metainformation alphabets are relations. Thus, their definitions are the following:
where
Previously to define the function that assigns elements of to the objects, it is necessary to define a function that assigns to each element essence the value that has in a specific dimension of a specific property. The function is denoted by and its definition is the following:
where
It is denominated temporal state of the component of the property to the functor that is defined in the following way:
where
and
and
Comments
There are no comments yet.