6 INFORMATIONAL LOGIC IV INFORMATICA 2/89 Keywords: logic of information, transformation rules, Anton P. Zeieznikar informational modus iskra Delta In this part of the essay the following topics of the informational logic (IL) are discussed: transformational rules of IL and a surveying conclusion concerning the formal IL. Various informational modi of informational transformation are presented. This part of the essay includes also the concluding remarks which concern IL in its entirety (references [15], [16], [17], and this essay). Within transformational rules of IL, the following rules and modi are determined and examined: uniform and non-uniform informational substitution, informational replacement, and modus informationis with the topics as informational implication, informational modus ponens, modus tollens, modus rectus, modus obliquus, modus procedendi, modus operandi, modus possibilitatis, modus necessitatis, and further rules of Informing and the openness of introducing new transformational rules. INFORMACIJSKA LOGIKA IV. V tem delu spisa se obravnavata še dve naslovni poglavji informacijske logike (IL): transformacijska pravila IL in pregled sklepov, ki zadevajo IL. Prikazanih je nekaj informacijskih modusov informacijske transformacije. Ta del spisa vključuje tudi sklepne opombe, ki se nanašajo na celoten spis o IL (na navedbe [15], [16], [17] in na ta spis). V okviru transformacijskih pravil IL se opredeljujejo in raziskujejo tale pravila: uniformna in neuniformna informacijska substitucija, informacijska zamena in modus informationis z naslovi kot so informacijski modus ponens, modus tollens, modus rectus, modus obliquus, modus procedendi, modus operandi, modus possibilitatis, modus necessitatis in dalje pravila informiranja in odprtost uvajanja novih transformacijskih pravil. II.4. TRANSFORMATION RULES OF INFORMATIONAL LOGIC Information is the fuel of cognition. At its most basic level, information is a matter of structure interacting under laws. The notion of information thus reflects the (relational) fact that a structure is created by the impact of another structure. The impacted structure is an encoding, in-some concrete form, of the interaction with the impacting structure. Information is, essentially, the structural trace in some system of an interaction with another system; it is also, as a consequence, the structural fuel which drives the impacted system's subsequent processes and behavior. Radu J. Bogdan [13] 81 II.4.0. Introduction By transformation rules, informational formulae can be transformed into different ones, which might have simpler, more complex, and also essentially different form and meaning in regard to the previous formulae. It is not always quite clear if formatting, axiomatizing, and transforming approaches can be separated from each other in a strictly evident or clear way. For instance, operations of informational particularization and universalization can have formatting as well as axiomatizing and transforming nature. Within IL, transformation rules transform axioms and already transformed formulae (iwffs) in a uniform, non-uniform, and modal (conditional, dependent, ontological, possible, necessary, true, false, random, etc.) way. 7 In regard to the uniform and non-uniform substitution there is nothing essentially new to saying. A uniform substitution of variables in a formula is the most common mood of substitution in mathematical formulae. With uniform substitution all variables of the same type will at a time be replaced by a determined formula. In the case of a non-uniform substitution this principle can be violated, thus, in some occurrences a variable will be replaced by a given formula and some not. In. this way, non-uniform substitution offers more freedom as compared with uniform substitution. The next possibility of substitution is the so-called informational replacement. In this case, a formula in a given formula can be replaced by another formula. Such a replacement can be uniform as well as non-uniform which depends on particular occurrences of a formula. As we shall see, the approach of informational replacement can lead to ambiguities when occurrences of distinct formulae overlap each other. In such cases strict rules of substitution must be determined to enable, for instance, substitutions in a parallel or simultaneous manner. The most diverse transformation of formulae is possible by the use of the so-called informational modi. These various kinds of transformation, of information in general and of iwffs in particular, can be marked simply by modus informationis (MI). MI belongs to the central notions which concern informational transformation rules. MI. is in fact a metainformational transformation rule, which by itself as an informational formula (iwff) can be, for instance, non-uniformly particularized, universalized, or- informationally modified (by formatting, axiomatizing, and transforming). When particularizing or universalizing the so-called modus informationis, the following modi can be observed: modus ponens, modus tollens, modus rectus, modus obliquus, modus vivendi, modus procedendi, modus operandi, modus possibilitatis, modus necessitatis, etc. Various kinds of informational transformation arise within Informing of information with its arising, and various transforming principles are simply adopted with the embedded (incoming) information. Thus, transformational modi can be understood as essential, existential, and arising phenomena of the entire informational realm.. The main characteristics of any informational modus is the so-called- informational extraction (coming into existence) of an arising informational part, which follows as an informational consequence from the current state of a relevant informational phenomenon. This process of extraction of information may concern very different notions, such as implication in traditional logic, detachment in modal logic, modus vivendi under circumstances of survival, modus operandi under circumstances of a possible success, etc. Particular informational modi appear to be only intentional, believing, teleological, etc. mechanisms of informational arising from an antecedent, conditioning, basic, causal, etc. into a consequent, resultant, rlon-basic, sequential, etc. informational relevance. To shortly summarize the possibilities of iwffs transformation we can state the following: A set of informational transformation rules (ITR) licenses various informational operations on informational axioms and also on iwffs obtained by previous application of the ITRs. The iwffs obtained by applying of ITRs will be called informational theorems. An iwff is either an informational axiom or informational theorem of a given informational system. Within this system, an iwff is often called informational thesis. II.4.1. Rules of Uniform and non-Uniform Informational Substitution II. 4.1.0. Introduction Substitution belongs to the most general procedures of replacement of variables by formulae within symbolic formulae. A variable, or generally a symbol, is simply replaced by another sequence of symbols (formula) throughout a given formula or only some of variable occurrences are replaced while others are left unchanged. In fact, the process of substitution can be strictly determined or can be free in regard to the replacements of occurrences of a variable. In the first case we have to do with the so-called uniform, and in the second case with the so-called non-uniform substitution. II.4.l.l. Rules of Uniform Substitution • within an IWFF For uniform substitution (without particularization and universalization) it is possible to state the following rule: [Transformation Rule]DF1: We can adopt the following ITR of the uniform informational substitution: the result of a uniform replacing of any informational variable (the operand as well as the operator one) in an informational thesis by any iwff and sub-iwff, respectively, is itself an informational thesis. This rule can be formalized in the following way: let uS be the operator of uniform substitution and q> an iwff in which operand and operator variables r), ... , £ occur, so that it is possible to write the functional form 9(5, rj, ... , Let arbitrary iwffs «, p, ... , y tie given and let token be the delimiter, .which marks the end of 6-operation. Then the result of the operation of uniform substitution is as follows: 1Vi ••■ 1 K .y „. . u6«, p.....r ^ ••• - = (a, P, • • • , Y) Instead of this symbolism of substitution we can use the informational one, for instance, «< P/ • • • - Y l=s f), ... , i lu and used in several previous definitions, might be viewed as the most primitive form of MI. If information a implies information p, then this fact within IL may sound as a rule, that the occurrence of a within an iwff can be replaced by ¡3 . Of course, the notion, of informational implication embraces also several forms of the so-called mathematical implications, for instance, the so-called substantial (material), primitive, traditionally logical, effectively logical, effectively true, critical, basic implication, etc. Further, informational implication as an iwff of the form a ¡3 has to be understood as a particularization of the most general formula of Informing a ¡= ¡3. However, formula a $ ¡3 has to be understood as universalization of, for instance, known mathematical (logical) forms of implication. II. 4.3. 3. The Case of Informational Modus Ponens Common sense had almost no inkling that physical reality is mathematical. Why would it be better off when it comes to the formal character of cognition? Radu J. Bogdan [13] 118 Modus ponens concerns, for instance, one of the very elaborated and practiced rule of formula transformation in mathematics. It is the most known modus in mathematical theories. In fact, it is a modus of limited reasqning or strict inference which uses the so-called disjunctive syllogism, where affirming one of given possibilities excludes other" possibilities and vice versa. In this section we shall determine various informational possibilities of the so-called informational modus ponens. 10 [Transformation Rules] : Let us determine the traditional and most common rule of modus ponens! Let a and (3 be informational entities and let be the operator of informational implication. The rule is the following: cc, a * p P To be more precise, this rule can be rewritten as (a A (a 4> p)) => (3 which comes closer to the iwff of IL. But it must be kept in mind that the traditional logic deals with truth and falsity, and so the traditional interpretation of modus ponens within IL would be ((((a hj,) a ((a * p) hj,) ))=T) => (¡3 hp)) t=T This formula enables the understanding of the so-called detachment of (3 (or extraction of [3 from the antecedent of modus ponens) as a true informational entity within the informational realm of a ^ ¡3. ■ The meaning of the last formula is that modus ponens, in its entirety, informs true or that it is by itself a true proposition. The detachment of ¡3 means, that (3 informs true and that on account of this truth it can be recognized as a valid proposition. However, two presumptions must be true, namely, that a informs true and that the formula a £ (3 in this particular case informs true (this yields that the conjunction of a and a (3 informs true too) . Let us now show further possible informational universalization of modus ponens in the last definition! This could be a regular way how from a particular case (traditional modus ponens) a more universal case can be obtained. DF5 [Transformation Rules] : Let us rewrite the basic formula of modus ponens in the following manner: (1) (« HA(a K, (3)) K, P This formula has up to now not been essentially different from the traditional formula. The next step can be its radical universalization by replacing all explicit operators in the formula by the most universal operator (la) (a (a M)) NP This formula says that a in some way informs the process a p and that the entire process a (= (a P) finally informs p. It means simply that the entire process a )= (a k P) informs one of its components, namely {3 . This result is a pure consequence of the radical universalization of modus ponens. Simultaneously, this universalization shows the essential point of modus ponens, namely, that no other component than (3 is informed by the process a )= (a \= P) so far. It means that, for instance, a must remain as it is or at least must not be informed by a t= (a (= P). This universalization shows evidently the problem which could appear in case of a real, living information where the Informing to a has to be blocked (inhibited) against the Informing of a (= (a p). This request can be expressed explicitly by the attributed formula (modus) (lb) (a h («> (3)) Y « ■ [Transformation Rules]DF6: As a rule, modus ponens informs true in its details and in its entirety, as shown in DP4 [Transformation Rules] . Let us rewrite this rule in the following (postfix) manner: (2) ((((a |=T) ((a k^ P) t=T)) hT) (P f=T>) f=T The symmetric (prefix) version of (2) would be (3) hT ((t=T ((f=T a) (t=T (« Kj, P)))) kj, (NT P )) The next step can be a radical universalization of formulae (2) and (3) in the following way: (2a) ((((a n> n ((« n p) 1=)) n h (P N> h (3a) (fc ((^ «) |= (f= (« N P>))) t= (N P)) These formulae tell that Informings of a, where a informs (a |=) and is informed (|= «), inform the Informing of the process a h P an<* that entire Informings of processes (a ((a t= P) |=) and (}= a) |= (}= (a ^ p)), respectively, finally inform Informings of p (p h and f= P< respectively). Similarly to (lb) in the previous definition, the following two formulae can be attributed to (2a) and (3a), respectively: (2b) (((a |=) h ((a t= p) |=)) t=) V (« H (3b) (|= ((}= a) (= (]= (a |= p)))) & (h a) ■ In some cases it could be useful to introduce the so-called extraction (separation, detachment) line to improve the visibility of an informational modus. In modus ponens it would be, for instance, a A (a £ p) a A (a ❖ p) or | = P P instead of the traditional expression. We see how formulae of informational modi are becoming iwffs and can be understood as such. We have to keep in mind that modi are informational rules for transforming other informational formulae. In this respect the meaning of the extraction operation (line of detachment) is, for instance, 'affirms', 'asserts1, 'maintains1, 'puts_out_to_interest', 'considers', etc. Thus, operation of informational extraction can be understood as an informational particularization. EYl [Transformation Rules] : Within informational logic it is possible to construct an infinite set of informational modi ponens. Let us list some characteristic examples! The first example is, for instance, 11 the modus ponens of belief, where (=B is the informational operator of believing. There is: f=B «< Nr (« * P) This rule says: if a is believed and if a ^ (3 is believed, then ¡3 is believed. To be consequent to resulting from our believing, we have to attribute to this formal believing implicitly the following: t=B (l=B l=B (a =*> P)) and Ct=B (hB hB (« => P)) / P)) We certainly have to believe the entire antecedent as it is composed and we have to believe in modus ponens (of believing). Informational operator '/' was introduced to replace the usual detachment operation. A similar example' can be constructed for the case of knowledge, where \=K a, (=R (a * p) etc. However, we can still put the question what would the so-called modus ponens of Informing be. ■ II. 4.3.4. The Case of Informational Modus Tollens Without a clear teleological hold on distal .targets, and a clarification of what this means, we might only get proximal semantics, and we do not want that. For if proximal semantics makes sense, then my entire approach to semantic information doesn't. Hence the urgent need for modus tollens. Radu J. Bogdan [13] 100 In general, the modus tollens invalidates, negates, or informationally abolishes a piece of complex information and, in this respect, represents an informational transformation which can be understood as, in some sense, opposite to informational transformation by modus ponens. Of course, modus tollens can be used in traditional theories as a rule of negation. In fact it is a modus of limited reasoning or strict inference which uses the so-called hypothetical syllogism: negating the consequent causes negation of the antecedent. DF7 [Transformation Rules] : First, let us define the traditional modus tollens! Let a and ¡3 be informational entities, => the operator of informational implication, and -l the symbol of logical negation. By these terms, the rule of traditional modus' tollens is the following: a p, ip This rule can be logically rewritten into ((« => p) A (-1 p)) (h «) and represents an iwff of lb. However, there is a slight difference when comparing modus ponens and modus tollens, due the appearance of operator -i. Thus, instead of the first interpretation of modus tollens by the formula of detachment, it could be also a =i> p, p n -i a This is due to P -i a, where the meaning of -i is the following: =D£ ('negates' V 'negate' V 'is_negated_(by)' V 'are_negated_(by)') By modus tollens the consequent negates the antecedent. In terms of traditional logic, modus tollens has to be understood through categories of truth and falsity (at least of some parts of the formula). Thus, a traditional interpretation of modus tollens becomes (((((« => P) }=T) A ((p -.) t=T)) Nt) => ((-1 «) hp)) hp This formula gives the detachment (i «) f=T out of the premise of modus tollens. But, in a certain case, it is possible to explicate the non-informing nature of components which bear the operation of negation -i, for instance (((((a * P) t=T) A (p IA,,)) f=T) * ((/T a)) ¡=T We have only combined n and into a universal operator which can again be particularized for a certain case. ■ The meaning of the last formula is that modus tollens, in its entirety, informs true. The detachment of oc |/T means that a does not inform true. Prior to this, two presumptions have to be true, namely that a ❖ p informs true and that (3 does not inform true. Now, . it is possible to show further informational universalization of modus tollens. Similar. to the [Transformation DF5 Rules] we can construct the following rule: npo [Transformation Rules] : Let us rewrite the basic formula of modus tollens in the following manner: (1) Hoc 13) (=A (p -,)) (-i a) This formula of modus tollens has up to now not been essentially different from the traditional formula. The next step of its modification can be its radical universalization by the replacement of all particularized explicit operators in the formula by the most universal operators h and -i a (la) ((«hP) 1= (P h (h oc) 12 This formula tells that the process a }= (3 informs, in some way, the process |3 Y anc^ that the entire process (a p) (p |?i) informs the process Y a which concerns one of the components of the process a [= p, namely, a. This result is a pure consequence of the radical universalization of traditional modus tollens. Simultaneously, this universalization shows the essential point of modus tollens, namely, that no other component than the process Y a is informed by the process (oc [= p) ^ ((3 Y) . This universalization shows the problem which arises in case of a real, living information, where the Informing to |3 Y has to be blocked (inhibited) against the Informing of the process (a ^ (3) j= (p . This request can be expressed explicitly by the attributed formula (modus) (lb) ((a (= 0) ¡= (p |*)) & ((3 Y) ■ df9 [Transformation Rules] : As a rule, modus tollens informs true in its details and in its entirety, as shown in DF7 [Transformation Rules] . This is a fact which roots in the usual true-false categorization of the traditional logic. Let us rewrite this rule in the following (postfix) manner: (2) (((((a k, P) |=T) ((P k,) hj>> l=T) k, ((k, a) Kp)) Kji The symmetric (prefix) version of (2) is (3) Nij> (NT ((K,. (« P)) l=A (Nt (P k,))) k, (hp (k, «))) The next step can be a radical universalization of formulae (2) and (3) in the following way: (2a) (((({a M) NO bo N)) N N ((I* «) N ) t= (3a) (= (l= (((= (« > P)) Y (t= (P Y) )) y= ((= (N a))) These formulae tell that Informings of the process a Y p, where a (= p informs ( (« (= p) f=) and is informed ((= (a p)), inform the Informing of the process p Y and that the entire Informings of processes (((a (= p) k ((p \t) (=)) )z and |= ((J= (a |= p)) |= ((= (p fci))), respectively, finally inform Informings (Y a) [= and {Y a), respectively. The first of these integral informational entities informs and the second is informed. Similarly to (lb) in the previous definition, the following two formulae can be attributed to (2a) and (3a), respectively: (2b) ((((a |= p) tO t= UP Y) H) t=) ¥ ((a Y P) t=) (3b) (|= (0= (a \= p)) |= (l= (p |*))) Y (f= (« h P>> ■ We have to mention again that operators and Y can be non-uniformly replaced by particularized operators and that operators of the type Y can b'e understood as any informational operators of particular non-Informing. Thus, f= and Y are in general not operators which exclude exactly each other, but have to be understood as operational variables belonging to various particular classes. Instead of the traditional expression of modus tollens we can use also expressions (a ^ p ), p -1 (a p), P n or -1 a -1 a Expressions of these kind explicate clearly the extraction or detachment operation, which in the context of modus tollens can be particularized (in the second case) or universalized (in the first case). EX 2 [Transformation Rules] : Within IL we can construct an infinite set of informational modi tollens. Firstly, this infiniteness follows from the unforeseeable possibilities of particularization and universalization of appearing informational operators in a formula (iwff) representing modus tollens. Secondly, as we have learned from several previous cases, a distinct formula of modus tollens can be developed through consideration (introducing) of various forms of Informings of operand variables and processes. This procedure of formula development can lead to a more and more complex expression and the stopping of complexness can be impacted by distinct circumstances (semantics, modus vivendi) in the phase of formula development. Let us look at some of these possibilities. The first two examples are, for instance, the modi tollens of belief, where ^=B and are informational operators of believing and non-believing. There is: Nb (« » P), hB (i P) and l=B (« » p), hB (p -0 t=B ("i a) f=B (-1 a) or also (« » p) (-> P) l=B and (<* => P) hB> (P -0 ha (1 «) |=B (n a) t=B The first rule says: if it is believed that a implies p and if it is believed that p is negated, then it is believed that a is negated. The second rule says: if it is believed that a implies p and if it is believed that p negates, then it is believed that a is negated (informationally in an implicit manner by p). The third rule says: if information 'a implies P' believes (or is believable) and if information 'p is negated' believes (is believable), then information 'a is negated' believes (is believable). The fourth rule says: if information 'a implies P' believes (or is believable) and if information 'p negates' believes (is believable), then information 'a is negated' (informationally in an implicit manner by p) believes (is believable). EX1 Similarly to [Transformation Rules] it is possible to express the belief into modus tollens for the upper four cases in the following way: yb ((nb ((hb (« * p)> a (J=b (1 P)))) / (k «))) 13 i=b (0=b ui=b (« => p)) a (t=r (p -0))) / (\=B (n a))) (((((a * p) t=B) A (("I p) (=g)) \=B) / tC-i.a) f=B)) hB (((((a p) |=b) a ((p -0 |=g)) |=b) / ((i a) f=Bn We certainly have to believe the entire antecedents as they are composed (by the operators A) and we have to believe the upper rules of modus tollens. Informational operator '/' replaces the usual operation of detachment. In the following examples we shall examine the informational connectedness of truth, belief, knowledge, awareness, and their counterparts (for instance: falsity, doubt, illiteracy, unconsciousness). [Transformation Rules]EX4: In the previous example we could recognize some semantic similarity existing among informational processes concerning truth, belief, knowledge, and awareness. For instance, in the case of the definition of information a, ('a is_information') ((a|=) v (|= a) V (=j a), v (am) ex3 [Transformation Rules] : The next two examples of modus tollens we. are going to examine concern knowledge and awareness. The traditional form of modus tollens of knowledge is, for instance, f= (a * p), K hp] This formula has .the following meaning: if.it is known that a implies p and if it is known that p is negated, then it is known that a is negated. However, we can interpret the operator as 'it_is_not_known' or 'it_does_not know'. Thus, the basic formula of modus tollens of knowledge can be rewritten into the form it is possible, in a concrete case, to particularize this definition in a non-uniform manner into (« ¡=T) v (|=B oc) v hk oc) v (oc =ia) or, for instance, expressing it in the form of a parallel metaphysical system H- Ihj/ lf=B Hr =IIK H =IIA This could be a natural parallel metaphysical process in which informational cooperation of truth, belief, knowledge, and awareness is coming into existence. Certainly, this can occur not only in the cases in which transformations of modus tollens are taking part. I=K (« * p), Mk P ^ The meaning .of this formula is the following: if it is known that a implies p and if p is not known, then a is also not known. As ^ and can be particularized in a non-uniform way, the meaning of the operator variable can cover a broad informational realm, which might not have any relation to the opposition of a particular operator belonging to the type . A similar reasoning is possible in case of the so-called awareness (^=A) and unawareness (j?*A) . The traditional form of modus tollens of awareness is ^A <« => P>. ¡=A ^ P> hA (h a) Let us interpret the meaning of this formula: if 'it is aware' (= 'it is consciously evident') that a implies p and if 'it is aware' that p is negated, then 'it is aware1 that a is negated. The awareness of -i p and -i a can in a particular case be interpreted as unawareness of p and a, respectively. In this case, from the awareness that a implies p and that p is unaware follows that a is unaware. Thus, formula « sounds quite reasonably. within the domain of modus tollens it was possible to observe operational combinations (concatenations) concerning operators of Informing and non-Informing. We can explain the following examples: (f=B a) 'it is informed true' that a is believed; f=T a) 'it is informed true' that a is not believed; (Hb «) 'it is not informed true1 that a is believed; (|^B a) 'it is not informed true' that a is not believed; t=0 ((= a) it is believed that a ¿is informed true'; f=B (|?;T a) it is believed that a ¿is not informed true'; a) it is not believed that a ¿is informed true'; (oc) it is not believed that oc ¿is not informed true1 Some operationally split cases can be of particular interest. For instance, ([=T a) a 'is informed true' informs believable; (Kp «) a 'is informed true' does not inform believable;. . (fcp a) a 'is. not informed true' informs believable; (frj a) a 'is not informed true' does not inform believable; (« ^B) cc informs believable informs true; (a t=B) a informs believable does not inform true; f^g) Kj a informs unbelievable informs true; 14 (« « informs unbelievable does not inform true Etc. We can see how particular cases can be operationally reduced. If information informs believable and true, then it can be reduced to inform simply true or simply believable. For instance, Nt 0=r «)< I=r (1=t a), (t=T a) (a (=B) f=T "T vrB '' ""B rT '' vrT ' rB' could be reduced either into a and (=B a or into a and a t=B As soon as we have an operator which informs in an untrue or unbelievable manner, a combination of "concatenated" or split operators can be reduced to inform simply untrue or simply unbelievable. For instance, formulae of the above cases f=T <£b a), ¡¿T a We see how in this case it is meaningful to explicate the belief of the true Informing of T at the beginning of the process of IMO. The last formula of IMO is read in the following way: if it is believed that information t informs true and if the negation of information t implies an absurd informational entity a, then t does not inform true. In this case, the implication of absurdity by negation of t causes an untrue Informing of t. The last formula can be rewritten in a logically complete iwff: hT (S=T CCNt ((f=B (((t N V (M)> (=!>})) A (hj ((it) => ((a fcj,) v (fcj, a))))) / (j=T (((T H V T))))) where '/'is the operator of detachment. ■ II. 4. 3. 7. The Case of Informational Modus Procedendi Informational modus procedendi is a mood of informational detachment by which a goal information is coming into the process of Informing. The Latin procedo has the meaning of to go forth or before, advance, make progress; to continue, remain; and to go on. When informationally proceeding, the process has to go forward by showing the goal in advance. As an informational process, modus procedendi runs on according to a goal information, where this goal information informs, for instance, a motor, behavioral, or Simply an acting information and, finally, when the goal is exhausted, elapses. There exist an infinite number of possibilities how to structure and organize goal-directed informational systems. The task of a modus procedendi could be, for instance, how to extract a goal structure and organization from a complex living or artificial informational system, to bring this goal informational structure and organization to the surface, for instance to the logical or conscious level. This could be a senseful informational process of hidden informational goals identification and their use in various life and technological strategies. API 7 [Transformation Rules] : Let y be a goal information, where ^ is its goal Informing. Now, let us have the following definition of a goal operand variable: ('y is_goal-expressing_information') C(T ht> v (hc Y>> Let a be information (for instance, motor or behavioral operand variable) which must approach or at least consider the goal information, or, as we usually say, must be informed by y- We can conclude that in some informational elements a has to become inf ormationally similar to y, thus, a y. This expression is read as follows: a becomes goal-similar to Y- Under this circumstances « is information approaching to the goal and y is information which informs a. We can now express informational modus procedendi (IMPr) in the following, traditional form: <£, Y Kj; « a y Let us analyze this informational modus! The essential informational entity of the consequent is the operator This operator has to answer the question, how much has a already approached Y- In this way, modus procedendi has extracted the relation of informational similarity between « and Y- In the antecedent, y does not arbitrarily inform a, but it has to inform a particularly by the structure and organization of (£. In this respect modus procedendi seems to be much more complex than the previous modi have been. It evidently concerns some parts of Informing of y (the antecedent of IMPr) as well as of a (the consequent of IMPr). II.4.3.8. The Case of Informational Modus Operandi The reason such an internal selectivity is a major condition on semantic information is that a tokened information structure counts as semantic only if its shape and function in a system can be explained, under appropriate types of regularities, relative to some distal properties, The information structure must therefore be shaped inside the system, by its architecture and modus operandi, in ways which can be explained only by appeal to semantic considerations. Radu J. Bogdan [13] 98 In .Latin, modus operandi means a method of operating or proceeding. This meaning comes 17 near to the concept of algorithm, which is a method of procedure. Evidently, the informational modus operandi (IMOp) has to answer the question what is the aim or essence of informational operation within an informational complex or what is the subject of operation. Thus, IMOp has to extract the operational information, and in regard to this it has to explicate the Informing of information which, in general, informs and is informed. Informational modus operandi reveals the nature of Informing of information. By this explication it becomes informationally known how a certain information informs and is informed. IMOp discovers the informing of information and, in this respect, it is an informat ional tool for the identification of Informing. How does an information function? How does it produce informational effects on itself and on informationally involved information? How does it arise and how does it cause arising of other information? How are this informational effects particularized? Informational modus operandi delivers answers to this questions in the form of its consequent. The task of IMOp is, for instance, to discover the algorithm of data processing. However, information cannot be reduced to data, which are static informational entities, which are a collection of operative and informative data. The question is what puts and keeps information in its operation. What are operational operators as concerned their informational structure and organization? DFl 3 [Transformation Rules] : What is Informing 55" (or 3 ) of information a? Informing 3 is nothing else but an informational functionality g of a, thus, 3 = 3(a) In this sense, Informing 3 is an implicit informational operator of a which is a product of a and which as an active part of information produces a. In this respect, the basic definition of information a can be expressed also as ('a is information1) =, Df a, a |=g « C, © C 3 The cyclic complexity of a's cyclic parallel Informing 3, considering its counter-Informing C£ and informational embedding ©, can be chosen as follows: a lba 3, a, 3 |f-g 3, a, a, 3 |(-g CC, a Ik- Y< a, 3, Y |k, ; ta ihg(a) «; a |Fa 3(ß) ; a, 3(a) |f-g(a) 3(ß), p, a, 3(a) |hg(a) S and a., ß, ... , Y H $, r), ... , £ can enormously grow. Identification of appearing inter-informational forms of Informing calls for particular rules of informational modus operandi. II. 4. 3.9. The Case of Informational Modus Vivendi How could the vital goal of staying alive or that of enjoying oneself shape any sort of information? Vital goals are satisfied only when active, specific goals are. Radu J. Bogdan [13] 92 Informational modus vivendi concerns information of life in environmental, individual, populational, and social circumstances. Several levels and sorts of life information can certainly be distinguished. The basic living information present everywhere where the living arises may be marked as autopoietic information a. This information may be compared to basic informational fuel of which any higher living informational forms and processes are composed and aggregated. This informational fuel includes the most elementary and primitive informational lumps, living informationally related and unrelated in their biological environment and out of which, during a life cycle, higher and more complex informational forms and processes would come into existence. We can imagine, for instance, how in a living being its total information called metaphysics H is permanently arisinq out of informational lumps within its autopoietic system, wnere a is coming into existence, changing, and vanishing. This metaphysics n represents a life related informational form and process of autopoietic information a. In these circumstances, a together with stimulus or sensory information a enables the coming of metaphysics pi into existence. Through life processes, a and a structure and organize (jl, thus, as we say, inform pi. In general, a, a |= n At first, this process could be seen as an initial process of metaphysical development of a living unit. As soon as p. begins to develop, it begins to impact a being's autopoietic system, i.e., its autopoietic information a, and it begins to filter and modulate metaphysically the sensory information <7. So, to the initial process, the process h t= a, <7 can be attributed. Further, an essential part of metaphysics (jl is the so-called behavioral or motor information p, by which a being performs its acting (intelligent deciding) within its autopoietic system and in its environment. In processes of life all informational occurrences of a living being interact, so, a general living system can be demonstrated informationally in the form a, d, pi, p (= a, a-, n, p This informational system can be decomposed into basic interacting parallel processes, for instance, 19 a IN ot, a IN a, a ||= (A, a |J= p, o- IN a, cr IN cr, a |N tx, a IN (3, ix IN a, (x IN a, n |N n, pi |N P, p IN p IN g V-) h This formula is a particularization of modus (2), where a |= was substituted by a (=, cr \= and a by a, a. This modus has the semantic value in showing the impact of antecedent Informings on consequent Informing of p.. As in previous cases, this modus can be conjoined with the axiom (4a) (((a |=) 1=) V (|= (a |=)) V ((^ a) J=) v (t= (1= a)) v ((a \=) (=) v 0= (