Belief Changes and Cognitive Development: Doxastic Logic LCB

We present the logic LCB which is expressed in a propositional language constantly enriched by new atomic expressions. Our formal framework is the propositional doxastic logic KD45 with the belief operator B , extended by the C operator, to be read it changes that ... . We describe the changing beliefs of an agent who uses progressively expanding language. The approach presented here allows us to weaken pragmatic objections to the so-called principle of negative retrospection accepted in KD45 and the problem of logical omniscience . In what follows, we present the expanding propositional language used in our formalism, interpreted using an epistemic version of Kripke semantics. Next, we give a syntactic characterization of logic LCB and prove the soundness and completeness of LCB in respect to our semantics. Finally, we compare the idea of expanding language with the notion of agent awareness and we relate our formalism to two epistemic temporal logics.


Introduction
Our aim is to describe the changing beliefs of an agent who uses a progressively expanding language. We choose as the formal framework the propositional doxastic logic KD45 with a primary operator B, to be read: it is believed that ... . We extend its vocabulary with the C operator for change, to be read: it changes that ... . It is assumed that modality C has properties described within the logic of change LC (Ś więtorzecka 2008; Ś więtorzecka and Czermak 2012). LC deals with the notion of change as primitive, which is used also to characterize temporal notions such as immediate succession and durability (Ś więtorzecka and Czermak 2015).
Our attempt is motivated, primarily, by the simple observation that beliefs, in contrast to knowledge, are not always veridical and so may be subject to change. A consistent agent who is unable to verify his beliefs, might take into account, that his beliefs are changing for some reason. Our intention is to provide a formalism that can capture these relationships between beliefs and their variability in a situation of limited access to knowledge about the reality.
The second component we introduce to the assumed doxastic logic is related to a more basic epistemological issue than that of an agent's updating his beliefs. We are also interested in simulating changes that occur in connection with the agent's cognitive development. In general, the extension of cognitive experiences leads to an enrichment of the agent's conceptual apparatus (a system of concepts) and hence to the enrichment his language. That is, the agent may expand his linguistic tools by adding new expressions to his language. At the same time, however, he may not know if certain sentences containing these new expressions are actually true. As a result, he may have to update his convictions by using sentences which did not previously belong to his language. The idea of an expanding language comes from the logic of change LC. We believe that it brings a philosophical profit, when it is used to our doxastic doxastic background. 1 Let us note, that it can be used to weaken pragmatic objections to the so-called principle of negative retrospection accepted in KD45. Given our approach, the negative retrospection principle does not apply to formulas outside of the current language of the agent, e.g., it does not apply to formulas that will belong to his language in connection with some new cognitive circumstances. The same happens with the rule of attaching B, treated as expressing the so-called problem of logical omniscience of an agent. In our semantics, even formulas which are logically valid but do not belong to the agent's current language do not enter into the subjects of his beliefs.
The result of our research is modal logic LCB expressed in a propositional language which is constantly enriched by new atomic expressions. This formalism is the marriage of KD45 and LC, in which a number of relationships between modalities B and C are taken into account. In setting up LCB, we have ensured that the difference between beliefs-in-changes and changing-of-beliefs is maintained. Additionally, we want to capture at least two relationships which reflect the selfawareness of an agent who decides to change his beliefs or to keep his beliefs constant. The first condition we mean is, that the constant believing in A implies the belief in the constancy of A. Secondly, we want to capture the circumstances where an agent decides to change his point of view regarding his lack of belief in A (and this does not imply that he believes in not-A), then in result he believes in A.
We order our considerations in the following way. We present the expanding propositional language used in our formalism, interpreted in a certain epistemic version of Kripke semantics (1). Next, we give a syntactic characterization of the logic LCB (2). In (3), we prove the soundness and completeness of LCB in respect to our semantics. Finally, we sketch some remarks on the comparison of the proposed approach with two other approaches known in the literature (4). We will compare the idea of expanding language used in LCB with the concept of general awareness used in the logics of awareness. We will also relate our formalism to the epistemic temporal logic of linear time.

The Family of n-languages and Their Interpretation
Let us consider the set of atomic sentences At n used by an agent who expresses beliefs relating to state n of his cognitive development (his conceptual apparatus). For any n; j 2 N we use a n j to symbolize atomic sentences with respect to state n. At n is defined as follows: where J is the set of natural numbers or its initial segment and the same is with K.
In every At nþ1 there is at least one new atomic sentence which is not a member of At n .
Elements of At n are called n-atoms.
As previously mentioned, operators B, C are read respectively as: it is believed that ... (or the agent believes that ...); it changes that ... .
We define an n-language as follows: Definition 1 (n-language) An n-language comprises formulas built of n-atoms, classical logical connectives, and operators C, and B.
If a formula A belongs to n-language, we say that A is of level n. We also call an n-language: language of level n.
Because of our definition of At n , every formula of level n is also a formula of level n þ 1.
The minimal level of a formula A (Lv(A)) is the highest upper index in the set of atoms occurring in the formula A.
Actually, the minimal level of a formula A is the language level at which formula A occurs for the first time (the first language of the agent in which A occurs). So, for example, formula a 3 j^a 4 n has the minimal level 4, and it is not a formula of any language of levels 1, 2, and 3.
Let us interpret our language in a certain kind of structures of possible worlds. The intended interpretation combines elements of the original LC semantics (Ś więtorzecka 2008) and a doxastic version of possible worlds semantics for KD45 (Fagin et al. 1995). The LC interpretation deals with the so-called histories of changes (we call them LC-histories) which may be described as left-limited, endless sequences of possible worlds. The latter are sets of atomic expressions, possibly updated by new atoms. We also consider histories of changes which are left-limited, infinite sequences but are formed from non-empty sets of possible worlds. The subsequent sets of possible worlds are domains of doxastic accessibility relations. At the same time we follow the doxastic way of talking about possible worlds from (Fagin et al. 1995, 64). We keep the distinction between one real world and other worlds, which are possible states of the agent's beliefs about the real world. The possible states are not verifiable by the agent due to the lack of their access to the real world. We enrich the introduced distinction of possible worlds, assuming that the real world may be described more and more fully, because the agent has richer and richer conceptual apparatus. In this situation, we speak about the actual world relativized to the n level of the agent's cognition and about the states of his beliefs which are equally possible from the perspective of this actual world. Components of both the actual world and the agent's states of beliefs may be subject to dichotomic changes.
Let w be the actual world, which comprises certain propositions of the nlanguage, as true in w. Every n-world u consisting of propositions believable by the agent in view of the objective truths in w, stands in a doxastic accessibility relation to the world w. We say that such states are possible with respect to the agent's beliefs and assume that all propositions believable from the perspective of the actual world w belong to these states. The expansion of the language of level n to the language of level n þ 1 results in updating the n-worlds (both n-actual world and npossible states) to n þ 1-worlds.
After expanding of the n-language to n þ 1-language, the agent has access to updates of all his n-worlds: if the world u was accepted as believable with respect to w at level n and if w is updated to w 0 and u is updated to u 0 (i.e., w 0 ; u 0 are n þ 1worlds), then u 0 is accessible from w 0 at n þ 1.
In our approach we take into account the fact that the agent's conceptual apparatus grows, and thus the agent may consider new possible states that he could not describe before (because his language was too poor).
These introductory remarks are captured more precisely by the following definition: . . .g is a set of language levels; 2. W ¼ fw; u; . . .g is an infinite set of possible worlds; 3. d: L ! 2 W is a function that assigns to each language level n a set of those possible worlds, which the agent can describe in his n language. d fulfills the following conditions: 8 n2L 9 w2W ðw 2 dðnÞÞ; ðd1Þ 4. u : W ! W is a updating function. u fulfills the following condition: 5. every B n dðnÞ Â dðnÞ is a relation between possible worlds describable in the n-language, such that: B n is serial, transitive, and Euclidean in dðnÞ Â dðnÞ; ðBÞ 6. the functions d, u, and B are connected as follows: Condition (d1) states that for each level n there is at least one possible world describable in the agent's n-language. Following (d2), we can say that for every possible world, there are no two different states of cognition which entirely describe w. In other words, a complete description of every world w 2 dðnÞ can only be given by formulas of n-language. For every world w, function u assigns the world which is the update of w. According condition (u), when the agent expands nlanguage, then every possible world w 2 dðnÞ must be updated to another possible world describable in his new n þ 1-language.
Note, that from conditions (d2), and (u) we get acyclicity for u. Every B n is a doxastic accessibility relation between n-worlds with properties that are semantic counterparts of KD45 axioms.
Finally, condition (duB) states that the agent has access to all updates of his possible worlds.
We shall now introduce the notion of a history of changes.
Definition 3 (History of changes) For any B-structure, the history of changes is H ¼ hB; wi, where w ¼ S n w n and every w n : dðnÞ ! 2 At n is a function which assigns to every possible world w 2 dðnÞ a subset of atoms of level n.
Let us take hL; W; di, with dðnÞ being a singleton for every n. If we consider C fragments of our n-languages, LC-history is a structure hhL; W; di; wi (cf. Ś więtorzecka and Czermak 2015).
If w 2 dðnÞ, then we denote w as w n . The quantifier 8 w n is restricted to the domain dðnÞ of possible worlds.
We define satisfaction as follows: Definition 4 (Satisfaction) If a m j is a formula of level n (i.e. when m nÞ, then: 1. B; w; w n n a m j iff a m j 2 w n ðw n Þ: If A, B are formulas of level n then: 2. B; w; w n n :A iff B; w; w n 6 n A; 3. B; w; w n n A^D iff B; w; w n n A and B; w; w n n D; 4. B; w; w n n A _ D iff B; w; w n n A or B; w; w n n D; 5. B; w; w n n A ! D iff B; w; w n 6 n A or B; w; w n n D; 6. B; w; w n n CA iff ðB; w; w n n A and B; w; w nþ1 6 nþ1 AÞ or ðB; w; w n 6 n A and B; w; w nþ1 Þ nþ1 AÞ; 7. B; w; w n n BA iff 8 u n ðw n B n u n ¼) B; w; u n n AÞ: For any formula A with LvðAÞ ¼ k and n\k, the expression: B; w; w n n A is not defined. This simulates a situation in which our agent cannot consider as senseful these expressions which will be added to his linguistic apparatus only after further cognitive development. Indexes occurring in any formula are meant to inform us about the beginning of the process of assigning truth values to the formula. As we see our proposition is close to a hybrid approach, because in syntax we operate with symbols from the metalanguage. However, in general, our approach is not a hybrid logic because we do not introduce to our language nominals or variables (open to binding) for states.
We shall now define the notions of H-truthness and logical truth.
We always consider truthness of formula A, in some history H of changes starting from the minimal level of A.
Definition 6 (Logical truth) A formula A is logically true iff A is H-true for every history H of changes.

Axiomatization
Our formalism is based on classical logic. Schemes of specific axioms are ordered in the following groups: • describing KD45 properties of B: :BA ! B:BA ð5Þ • describing LC properties of C: A^:CA^CD ! CðA ! DÞ ð C 3Þ :A^:D^CA^CD ! CðA^DÞ ð C 4Þ • describing the relationships between C and B: :BA^C:BA ! Bðð:A ! CAÞ^ðA ! :CAÞÞ ðCB1Þ We accept the following primitive rules: modus ponens, extensionality for the equivalence: and two rules of adding modalities B and :C: where M 2 fB; :Cg: ðgenMÞ Later we will also use symbol D for disbelief in negation introduced via the following equivalence DA $ :B:A: The system described above is the logic of changing beliefs LCB. Schemata: (K), (D), (4), and (5) are intended to express respectively: belief closure principle, consistency of the agent's beliefs, and his positive and negative introspection. Together with rule (genB), they characterize logic KD45, which is considered in the literature as a fairly adequate logical frame for description of doxa knowledge (cf. Fagin et al. 1995, 59-60, 105). C operator describes dychotomic changes from A to :A or conversely. Its syntactic properties are essentially different from modality B. C versions of schemata K; D; 4; 5, as well as schema T are not theses of LC or LCB. In contrast to B, in our logic we get the equivalence CA $ C:A ((C1), (rep)). LC logic is neither monotonic nor anti-monotonic, and so the rules ' A ! D ¼) ' CA ! CD and ' A ! D ¼) ' CD ! CA are also not admissible in LCB.
The last schemata describe changes of beliefs and their connection with beliefs about change. To describe that the agent is self-aware in relation to his beliefs, we assume in (CB1) that a change of the agent's unbelief in A (to a belief in A) always results in belief in A; and in (CB2) we assume that the lack of change of belief in A is associated with belief in the non-change of A.
Rule (genB) expresses the idea that the agent always accepts theses expressed in his current language. Rule (gen:C) says that logical theses do not change.
Referring to our initial intuitions we note that beliefs-in-changes are not equivalent to changing-of-belief, and so the formulas

Soundness and Completeness of LCB
We begin by proving the adequacy of our formalism for the given semantics.
Theorem 1 (Soundness) If A is an LCB theorem, then A is logically true.
Proof The logical truth of all LC axioms (C1), (C2),(C2), (C4), and admissibility of (gen:C) can be proved in analogical way as in (Świętorzecka and Czermak 2012, 5-6). For axiom (CB1) we assume that there are B; w; w; n such that B; w; w n n :BA^C:BA and B; w; w n 6 n Bðð:A ! CAÞ^ðA ! :CAÞÞ. We obtain w n R n c n and B; w; c n n :A^:CA or B; w; c n n A^CA and next B; w; uðc n Þ nþ1 :A. From the assumption we have B; w; w n n :BA and B; w; w n n C:BA, we obtain B; w; uðw n Þ nþ1 BA. We have w n B n c n , therefore from (duB) we obtain uðw n ÞB nþ1 uðc n Þ, and so with B; w; uðw n Þ nþ1 BA we get B; w; uðc n Þ nþ1 A, which gives a contradiction.
For axiom (CB2) we assume that there are B; w; w; n such that B; w; w n n BA^:CBA and B; w; w n n :B:CA. We obtain w n B n c n and B; w; c n n CA. Now by assumption we have B; w; w n n BA, thus using w n B n c n we have B; w; c n n A, therefore with B; w; c n n CA we obtain B; w; uðc n Þ nþ1 :A. By assumption we have B; w; w n n BA and B; w; w n n :CBA, thus we have B; w; uðw n Þ nþ1 BA. We have w n B n c n , thus from (duB) we obtain uðw n ÞB nþ1 uðc n Þ and next with B; w; uðw n Þ nþ1 BA we get B; w; uðc n Þ nþ1 A, which gives a contradiction. h In the next step, we show completeness of LCB in our semantics using the Henkin style. We proceed in a similar way as Hughes and Cresswell (1968, 155-158), but we use the notion of a maximally n-consistent set.
Definition 7 (Maximal LCB n-consistency) A set X is maximally LCB n-consistent iff X is LCB consistent, all elements of X are formulas of level n, and for every formula A of level n: if A 6 2 X, then X [ fAg is LCB inconsistent.
In what follows, consistent and inconsistent sets are to be understood as LCB consistent and inconsistent. Similarly, a maximally n-consistent set is to be understood as maximally LCB n-consistent.
For any n-consistent sets we have the following variants of the Lindenbaum lemma: Lemma 1 If a set X is consistent, and all elements of X are formulas of level n, then there exists a set Y such that X Y and Y is maximally n-consistent.
Lemma 2 If a set X is consistent and all elements of X are formulas of level n, then there exists a set Y, such that X Y, and Y is maximally n þ 1-consistent.
Lemmas 1 and 2 can be proved in the standard way. We take two enumerations (denoted in the same way): A 1 ; A 2 ; . . ., for the first lemma formulas of n-language, for the second lemma formulas of n þ 1-language. We define two sequences (for the first sequence we take enumeration of n-language, and for the second we take selected n þ 1-enumeration): L 0 ¼ X, L kþ1 ¼ L k [ fA kþ1 g if L kþ1 is consistent, if not, then L kþ1 ¼ L k . Now, we define the sum of the first sequence, and the sum of the second and we prove that they are respectively maximally n-consistent and maximally n þ 1-consistent.
For operators C and B we have the following lemmas: Lemma 3 If X is maximally n-consistent, then fA : A^:CD 2 Xg [ f:E : EĈ E 2 Xg is maximally n-consistent set.
Lemma 4 If X is maximally n-consistent, and DA 2 X then set fAg [ fE : BE 2 Xg is consistent.
In case of Lemma 3 we need to use (gen:C), (C1), (C2) (C3), and (C4) (see fact 6 for logic LCS4 2 (Ś więtorzecka and Czermak 2015, 519-520). Proof of Lemma 4 is standard: we need only (K), (genB), and (B=D). Now we interpret maximally n-consistent sets as possible worlds of level n. Let us assume that a formula A with LvðAÞ ¼ k is not an LCB theorem. In this case f:Ag is consistent.
Using Lemma 1, we construct a k-maximally consistent set w k 0 with :A 2 w k 0 . We build H Ã based on w k 0 , and show that formula A is false in H Ã . We define the following sequence: Definition 8 (sequence W k ; W kþ1 ; . . .) (s1) We construct W k so that: (a) w k 0 2 W k ; (b) 8 u k 2W k ðDA 2 u k ¼) 9 s k 2W k ðfAg [ fD: BD 2 u k g s k , and s k is a maximally k-consistent set); (s2) W nþ1 is such that: (a) 8 w n 2W n 9 w nþ1 2W nþ1 ðfA: A^:CA 2 w n g [ f:E: E^CE 2 w n g w nþ1 , and w nþ1 is maximally n þ 1-consistent); (b) 8 u nþ1 2W nþ1 ðDA 2 u nþ1 ¼) 9 s nþ1 2W nþ1 ðfAg [ fE: BE 2 u nþ1 g s nþ1 , and s nþ1 is maximally n þ 1-consistent set).
Correctness of this definition is guaranteed by Lemmas 1, 2, 3, and 4. Conditions (s1) and (s2) from Definition 8 guarantee that for w n 2 W n with n ! LvðAÞ: w n is a maximally n-consistent: ðn À maxÞ Now we define: b ¼ hL; W; d; u; fB n g n2L i; where 1. L ¼ fk; k þ 1; k þ 2; . . .g is the set of language levels, 2. W ¼ S n W n , 3. dðnÞ ¼ W n , 4. u : W ! W is such that fA: A^:CA 2 w n g [ f:E: E^CE 2 w n g uðw n Þ and uðw n Þ is maximally n þ 1-consistent: ðu b Þ 5. B n dðnÞ Â dðnÞ is such that wB n u () fA: BA 2 wg u and w; u are maximally n À consistent. ðB b Þ Lemma 5 In the structure b conditions (d1) and (d2) are fulfilled.
Proof From the definition of sequence W k ; W kþ1 ; . . . we know that at every level n ! k there is at least one possible world. As a result of our expanded language, we obtain that no possible world w n can occur on more than one level; w n is maximally n-consistent, thus it occurs only at level n. Therefore conditions (d1) and (d2)  Proof The definition (u b ) guarantees that any w n is maximally n-consistent, and uðw n Þ is maximally n þ 1-consistent, and therefore uðw n Þ 2 dðn þ 1Þ, and thus condition (u) is fulfilled. h Lemma 7 In structure b condition (B) is fulfilled.
Proof First, note that for any B n , if wB n u, then w, and u are maximally n-consistent and therefore w; u 2 dðnÞ. For any B n , because of (D), (4), (5), and (B b ), it is the case that B n is serial, transitive and Euclidean. This can be proved in the standard way. h Lemma 8 In structure b condition ðduBÞ is fulfilled.
Theorem 2 (Completeness) If A is logically true, then A is an LCB theorem.
Proof Assume that formula A with LvðAÞ ¼ k is not an LCB theorem. Using Lemma 1 we can construct a k-maximally consistent set w k 0 with :A 2 w k 0 . Using sequence W k ; W kþ1 ; . . . we define: b ¼ hL; W; d; u; fB n g n2L i: Because of Lemmas 5, 6, 7, and 8, conditions (d1), (d2), (u), (B), and (duB) are fulfilled in b.
Using (n-max), (u b ), and (B b ), we obtain that for every w n and for every formula B, and formula D of level n, we have: B 2 w n () :B 6 2 w n and also B^D 2 w n () B 2 w n and D 2 w n . Connectives _; !; $ have standard properties in every w n .
For every n ! k, w Ã n : dðnÞ ! 2 At n is a function such that for each atom a j i with j n and every w n 2 dðnÞ: a j i 2 w Ã n ðw n Þ () a j i 2 w n : We now define w Ã ¼ S n w Ã n and history H Ã ¼ hb; w Ã i and prove by induction that for every formula A of an n-language, and every possible world w n , we have: b; w Ã ; w n n A () A 2 w n : Given that :A 2 w k 0 , we obtain b; w Ã ; w k 0 6 k A. Thus A is false in H Ã and therefore A is not logically true. h

LCB, Agent's Awareness and Temporal Beliefs
As we have already noted, the idea of an expanding language combined with the logical background KD45 allows us to weaken a critical standpoint regarding the principle of negative retrospection and the rule responsible for assigning logical omniscience to the agent. The desire to reduce the effect of logical omniscience, as well as the belief in closure axiom K, were motivations for introducing the notion of awareness to logical considerations about knowledge and belief in (Fagin and Halpern 1988). In fact, this approach can also be used in discussions about the limitation of other modal principles used in epistemic versions of other modal logics, and so one can address it to the axiom 5. The general idea of this project is to restrict the agent's beliefs to those propositions that the agent is aware of. These propositions are explicitly believed. All explicitly believed propositions are also implicitly believed by the agent, but not conversely. Implicit beliefs are a subject of epistemic versions of the assumed modal logic, while explicit beliefs are restricted to formulas that the agent has in his consciousness. The logic of general awareness is the weakest epistemic logic of this kind. In its original formulation it is expressed in a standard propositional language formed out of propositional variables: p, q, ... (Prop), classical truth connectives, and two modal operators, noted here as B and A to be read respectively as: the agent implicitly believes that ... and the agent is aware of .... The considered logic, which we call LA, is based on classical propositional logic. It is characterized by K, the rule (genB), and the specific axioms introducing the notion of explicit belief The logic LA may be extended in two directions. One can strengthen its K modal basis, so, e.g., extend it to KD45. On the other hand, it may be extended by new specific axioms describing different possible interrelations between A, B, and B e (cf. Schipper 2015, 87). In order to compare the idea of awareness with our formalism, let us add symbol A to the vocabulary of every n-language. Operator B is now read as it is implicitly believed that .... LA expressed in our expanding language is a sublogic of LCB extended by ðA0Þ. The strength of B-fragment of LCB compared to LA results from additional modal axioms for operator B. In our case, there are accepted axioms of the shapes D, 4, and 5.
Comparing our formalism and the general awareness approach from the semantic perspective generates some further interesting observations. The LA language, in its original formulation, is interpreted in a standard possible worlds semantics (Fagin and Halpern 1988, 52). Following this interpretation, there is considered a tuple M ¼ hS; A; B; vi, where S is a set of states; B is a serial, transitive, and Euclidean relation on S; AðsÞ For is the set of formulas that the agent is aware-of in s; function v : Prop ! 2 S , from the set of atomic propositions, to the power set of states is a valuation.
Satisfaction is defined as follows: 1 The relation fulfills standard conditions for classical connectives. Let us transfer the main idea of this interpretation to LCB semantics. We extend the notion of our B-structure to B A ¼ hL; W; d; u; fB n g n2L ; fA n g n2L i; ðB A Þ where every A n is a function from dðnÞ to the power set of the formulas of nlanguage, i.e A n ðw n Þ fA: A is a formula of n-languageg, for every n.
Definition of a history w is now addressed to the B A structure and it is understood in the same way as in Definition 3. Satisfaction is extended by the following condition for every formula A with lvðAÞ n: 5. B A ; w; w n n AA iff A 2 A n ðw n Þ.
The next condition guarantees the logical validity of (A0): 6. B A ; w; w n n B e A iff A 2 A n ðw n Þ and 8 u n ðw n B n u n ¼) B; w; u n n AÞ.
We may now compare the notion of awareness and our idea of expanding language following one of two possible paths. If the conceptual state of the agent is to be identified with his awareness, then it is natural to accept that for every A with lvðAÞ n: A 2 A n ðw n Þ, and so from (6) and (5), we reach the equivalence of the notions of explicit and implicit beliefs, that is, the distinction between them trivializes. The second possible solution is to decide that there can be some nformulas which are outside of the agent's awareness in n. In this case, we keep the distinction between n-state of conceptual development of the agent and his awareness. This way of speaking could give a new perspective on epistemic considerations, especially if we consider such a formalization to describe the agent's internal logic in connection with the external logic of his wiser observer. Here we wish only to flag such an issue based on linking our concept of an expanding language and the awareness approach. We leave it open in our work.
Let us look at one more comparison of LCB logic, which may be interesting from the perspective of the relation between modalities of belief and change. Because of the relationship between LC and the linear temporal logic LTL, it is quite natural to compare LCB with certain epistemic extensions of LTL studied in, (Halpern et al. 2004). We focus on two one-agent systems based on LTL, characterizing the notion of knowledge as S5 modality, with axioms expressing the so-called principle of perfect recall and principle of no learning (cf. Halpern et al. 2004, 681-683). These latter principles are expressed with the use of the temporal operator for next, it is the case that ... and the epistemic operator K, which is to be read as the agent knows that .... They are of the following shapes: In distributive systems (see Fagin et al. 1995, 109-122) investigated in (Halpern et al. 2004), axiom (KT2) is understood in such a way that the agent's state at time m þ 1 contains at least as much information as his state at time m (c.f Fagin et al. 1995, 136). We can say that the agent can only reject any possibilities that he previously considered. In turn, ðKT2Þ and ðKT5Þ taken together state that the agent does not learn, because all possibilities he has been taking into account are constantly the same. Our exposition is based on the fact that the logic of change LC formulated in the language enriched by the operator with definition A $ ðA $ :CAÞ ð =CÞ is equivalent to -fragment of LTL extended by the equivalence CA $ ðA $ : AÞ: ðC=Þ The proof of this fact may be reconstructed on the basis of comparative considerations of LCS4 and LTL, discussed in (Ś więtorzecka and Czermak 2015, 520-523). Following notation used in (Halpern et al. 2004), we name the extension of LTL, describing epistemic modality K by axioms of S5 as S5 U , and we considerfragments of S5 UþKT2 and S5 UþKT2þKT5 . Expectations addressed to knowledge are now reduced to the so-called weak S5 requirements characterizing beliefs. Logic, we mean is -fragment of LTL, with KD45 axioms for B, called here KD45 .
We focus on the following B-versions of KT2 and KT5: BA ! B A: On our approach, the way in which we understand the above implications remain in contrast with the intuitions mentioned in the case of (K2) and (K5).
Concerning schema ðKT5Þ, we claim that it does not describe the situation wherein the agent is not learning. Because the language is expanding, the agent can always discover new possibilities (new states). In the actual state of the agent's beliefs, he has access to updates of his previous beliefs. We could say that the agent adapts his possible worlds to the current state of his belief expressed in the current language.
Finally, it is worth noting that the addition of ðKT2Þ to LCB would narrow the class of B structures to those that meet the condition w nþ1 B nþ1 v nþ1 ¼) 9 w n ;v n ðw n B n v n and uðwÞ ¼ w nþ1 and uðv n Þ ¼ v nþ1 Þ: In our semantics, this would mean that the agent cannot consider new possible states, despite the increasingly richer language at his disposal. In other words, the agent could not take advantage of the idea of an expanding language.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http:// creativecommons.org/licenses/by/4.0/.
Funding Research has been carried out within the project Theories of Epistemic and Ontic Modalities with the Primitive Concept of Change. Extensions of the Logic of Change LC (2017/25/N/HS1/02779) financed by The National Science Centre (NCN), Poland.