the following detailed description is of the best currently contemplated modes of carrying out the invention . the description is not to be taken in a limiting sense , but is made merely for the purpose of illustrating the general principles of the invention , since the scope of the invention is best defined by the appended claims . the computer - implemented method uses the laws of form ( lof ) calculus of indications , a mathematical theory created by george spencer brown , for computing on the forms resulting from distinctions made by human actors ; forms represent words meaning . the lof calculus of indications is a pure formal system and would be appreciated by those with skill in the art . in accordance with the lof convention of intention : the intent of a symbol or chain of symbols is limited to the use allowed to it ; in other words , what is not allowed is forbidden . the lof calculus of indications brings both arithmetic laws and algebraic initials that support several mathematical interpretations : lof calculus of indications was initially interpreted for boolean logics by george spencer brown ; boolean logics is used for computing the truth value of formal declarative sentences ; lof calculus of indications was extended by francisco varela to introduce a third truth value , to encompass the occurrence of self - referential situations , which entails the abandonment of the law of excluded middle ; ternary logics is used for computing the truth value of formal interrogative sentences ; and for processing cycles of computation ; lof provides an arithmetic to bunch theory developed by eric c . r . hehner ; a bunch is not a set : a bunch is an unordered and unpackaged collection of elements , which allows duplication of elements ; bunches are used to define sets by their content ; bunch theory is used for computing the multiple reality values of formal naming sentences ; lof calculus of indications extended to bunch theory can itself be extended to encompass the category theory , which was introduced by eilenberg & amp ; mac lane to formalize transformations between mathematical objects sharing the same structure ; category theory is used for computing upon changing values ( either truth or reality values ) of formal functional sentences ; and to formalize the computation process itself . the computer - implemented method uses arithmetic and algebraic mechanisms , together with the lof calculus of indications ; in the present document , the following algebraic notations are used : the greek letters ( α , β , γ , δ , φ , κ , η , ω , υ , σ , . . . ) refer to any symbol or chain of symbols ; the formal arithmetic and algebraic writings are : packaging a symbol or a chain of symbols is writing it with a left “[” on its left , and a right “]” on its right ; for example : calling 2 symbols or chains of symbols is writing them separated by a space ; for example : calling the 2 chains of symbols , “ me ” and “ too ”, is writing the call “ me too ”; changing a symbol or chain of symbols into another symbol or chains of symbols , is writing them separated by a “ ” ( rightwards wave arrow ): “ ” stands for the words “ is changed to ”, i . e . “ α β ” means “ α is changed to β ”; the arrow indicates the direction of the change : α is the source ; β is the target ; rewriting a symbol or a chain of symbols is changing it by replacing whole or part of it , in accordance with a rewriting rule ; for example , a rewriting rule of equivalence can be written as a 2 - sides equation : the left side , and the right side of that equation have the same value ; in any symbol or chain of symbols in which the left side of the equation appears , it can be rewritten “ on the spot ” into that symbol or chain of symbols by the right side of the equation , without changing the value of the symbol or chain of symbols . according to one method , a computer implemented method of determining the meaning of formal language constructs occurring in written texts is provided , the method comprising the steps of : providing an alphabet and a set of symbols for constructing lexical elements , and syntactic elements built on the alphabet , lexical elements , and symbols ; determining a sort of value , an arity , a notation , and a type for each syntactic element , to provide well - formed syntactic elements and meaningless syntactic elements ; building formal definitions from the typed well - formed syntactic elements , and determining a type for each definition to provide a list of terminologies , assertions , theorems , questions & amp ; answers ; and building formal glossaries as ordered sets of formal definitions ; providing to an actor at least one formal glossary , and its related minimal lexicon ; parsing , verifying and normalizing each formal definition from the formal glossary , to provide a list of defined lexical elements and undefined lexical elements ; allowing an actor to refer , search , cluster or select written texts , from defined lexical elements contained within minimal lexicons and appearing within the written texts ; acquiring questions from an actor , wherein each question is a set of formal texts containing at least one well - formed syntactic element ; parsing , verifying and normalizing each well - formed syntactic element in the questions ; retrieving , for each defined lexical element contained within the questions , all the applicable formal definitions from the formal glossary ; applying the formal definitions to the defined lexical elements in the questions in accordance with an interpretation process having at least one critical algorithm ; providing the values to the actor ; coding each question and its meaningful value as a new questions & amp ; answers definition ; and saving these new definitions in the formal glossary , which turns the formal glossary into a new intelligent glossary . the step of constructing lexical and syntactic elements may be performed by the steps of : selecting an alphabet containing at least lowercase letters , uppercase letters , and digits ; selecting from the set of symbols , three primary symbols i . e . the symbols : “⊥”, “@” and “[ ]”; calling primary value , a primary symbol used singly ; calling ordinary symbols , all other symbols from the set of symbols ; including :— definition symbols , i . e . the symbols : “|−”, “≈”, and “;”;— change symbol , i . e . : “ ” ( rightwards wave arrow );— deactivation symbol , i . e . “‘ ’” ( simple quote );— any other symbols , such as parentheses , linguistic symbols , logic symbols , arithmetic symbols , quantifiers , and function symbols ; calling word , a chain of lowercase letters , coding natural languages words , i . e . : nouns , adjectives , verbs , and adverbs ; calling number , a chain of digits , coding natural whole numbers ; calling elements the group consisting of primary values , words , numbers , and arrows ; calling arrow , an element ( the target ) separated from either an element or an arrow ( the source ) by a change symbol ; calling identifier , a chain of letters or digits beginning by an uppercase letter ; calling lexical elements the group consisting of words , identifiers , and ordinary symbols ; selecting variable symbols in the group consisting of uppercase letters used singly ; calling syntactic elements the group consisting of symbols , words , numbers , identifiers , arrows , and variables . a notation — which is a data attribute — may be assigned to each syntactic element that is a symbol , this may be performed by the steps of : assigning a prefix notation for a symbol that is attached to the beginning of its arguments ; for example : “ ” is a prefix symbol in “ ( x = x )”; assigning a postfix notation for a symbol that is attached at the end of its arguments ; for example : “!” is a postfix symbol in “ 2 !”; assigning a infix notation for a symbol that is inserted between its arguments ; for example : “+” is an infix symbol in “ 2 + 2 ”; assigning a circumfix notation for a unary symbol that is placed around ( bracketing ) its arguments ; for example : “[ ]” is a circumfix symbol in “[ 1 2 ]”. the step of assigning a sort of value — which is a data attribute — to each syntactic element may be performed by steps of : selecting sorts of value in the group consisting of truth - values ( true , false , unknown ) and reality - values , sub - sorted into numerical , non - numerical reality ; determining if that sort of value — truth or reality — is either a fixed or changing value ; assigning a unique sort of value — to each ordinary symbol , according the usual sort of value of its arguments and results ; for example : “+” is a fixed numerical reality valued symbol ; processing primary symbols as syntactic elements with polymorphic sorts , namely : used singly or with truth - valued syntactic elements , they have truth values ( fixed or changing ); used with reality - valued syntactic elements , they have reality values ( fixed or changing ). the step of assigning an arity — which is a whole number — to each syntactic elements , may comprise the steps of : assigning an arity equal to zero to elements , variables , and identifiers ; assigning to each ordinary symbol , an arity equal to the number of authorized arguments ; for example : “+” is a 2 - arity infix symbol in “ 2 + 2 ”; computing the arity of primary symbols intangled inside or around other syntactic elements , in accordance with their position in regards to the syntactic elements , namely :— assigning an arity equal to 1 to a circumfix primary symbol “[ ]”; for example : in the chain “[[ ]]”, the inner “[ ]” is a 0 - arity symbol , and the outer [ ]” is a 1 - arity symbol ;— assigning an arity equal to 2 to an infix primary symbol “⊥”; for example : in ( the chain “⊥⊥⊥”, the inner “⊥” is a 2 - arity symbol , and the 2 outer “⊥” are 0 - arity symbols . there may be the steps of assembling a unique symbol concatenated with only 0 - arity syntactic elements , respecting the sort of value , arity and notation of the symbol ; such a well formed syntactic element is called atomic ; for example , x + 1 is atomic ; a standalone element is atomic ; for example , 1 is atomic ; assembling a unique symbol concatenated with other well - formed syntactic elements , atomic or non - atomic , respecting the sort , arity and notation of the unique symbol , and using parentheses to disambiguate the order of evaluation of syntactic elements ; such a well - formed syntactic element is called non - atomic ; calling all other forms of syntactic elements “ ill - formed ”, and therefore “ meaningless ”, as their value is not computable by the present computer implemented method ; calling “ the head ”, the unique symbol of a well - formed syntactic element , atomic or non - atomic , and calling “ the body ”, the rest of the well - formed syntactic element ; the head and the body of a standalone element are the same ; calling “ the sort of value of a well - formed syntactic element ”, the sort of value of the head of that well - formed syntactic element ; calling “ bound ”, an occurrence of a variable , which is in the body of a quantifier or a function symbol in a well - formed syntactic element ; otherwise , the occurrence of that variable is called “ free ”; calling “ ground ”, a well - formed syntactic element which contains no free variables ; otherwise it is called “ non - ground ”; calling “ literal ”, a well - formed syntactic element which contains only elements , and primary symbols ; otherwise it is called “ non - literal ”; a literal is ground . the critical algorithm utilized in the interpretation process may be the formula calculation algorithm ( fca ), the add definition algorithm ( ada ); and the equation resolution algorithm ( era ). well - formed syntactic elements may be typed as : instructions , which contain at least one symbol of definition , wherein instructions are sub - typed as : injunctions , built on two formulas , the indicative part ( the right - hand formula ) and the body ( the left - hand formula ) surrounding the infix symbol of definition “≈”; a multiple injunction is coded as “ β 0 ≈ γ 0 ; β 1 ≈ γ 1 ; . . . ”; definitions , built on an expression — the pre - condition , and an injunction , simple or multiple , separated by the infix symbol of definition “|−”; a definition is coded as a three - part pattern form , namely : “ α |− β ≈ γ ”, when constituted with a pre - condition α , and a simple injunction , “ β ≈ γ ”; and “ α |− η ”, when constituted with a pre - condition α , and a multiple injunction , η ; a definition is called ground , if both its pre - condition and its injunction , simple or multiple , are ground . glossaries , which are ordered lists of definitions , may be separated by the infix symbol of definition “;”. formulas , which contain no symbols of definition , may be sub - typed as expressions ( which have truth - values ), and terms ( which have reality values ); wherein expressions may be sub - typed as indication expressions ( atomic ) and ordinary expressions ( non - atomic ); equating literal ordinary expressions either as arrangements ( with multiple primary symbols ) or primary values ( with only one primary symbol ); wherein terms may be sub - typed as indication terms ( atomic ) and ordinary terms ( non - atomic ); equating literal ordinary terms either as packages ( packaged forms , single or multiple ), bunches ( non - packaged and with multiple elements ) or unitary terms (“ uniterms ” with only one non - packaged element , i . e . : numbers , words and arrows ). each formal definition may have a definition type selected from the group consisting of terminologies , assertions , theorems and questions & amp ; answers , wherein : 1 . a terminology is a non - ground definition with an atomic injunction , 2 . an assertion or anti - assertion is a ground definition with an atomic injunction , 3 . a theorem or anti - theorem is a non - ground definition with a non - atomic injunction , 4 . a question & amp ; answer is a definition with an unknown injunction , which must be computed by the present computer implemented method . these 4 basic types of definition are further sub - typed in other sub - types of definition in accordance with their syntactical structure . a defined lexical element is the unique lexical element that appears within the atomic indicative part β , of a three - part pattern terminology definition coded as “ α |− β ≈ γ ”. the method may comprise the steps of providing to an actor at least one intelligent glossary ; parsing and verifying the formal glossaries and their formal definitions to infer the type of syntactic elements they contain ; ordering and storing the formal definitions from the formal glossaries . there may also be the steps of : producing a minimal lexicon build from defined lexical elements that appear in the indicative part β of a definition ‘ α |− β ≈ γ ’ in the formal glossary . the method may further comprise the steps of allowing an actor to cluster or select written texts from lexical elements contained within minimal lexicons and appearing within written texts , and may further comprise of the steps of : respecting field specific distinctions , as each lexical element contained within a minimal lexicon is the indication in a distinction , in accordance with laws of form calculus of distinctions ; modularizing a field of endeavor into domains by using distinctions applicable to one domain , for drawing precise boundaries with all other domains in that field of endeavor ; providing a single meaning to all natural language words , symbols and identifiers for the whole system of minimal lexicons , considered as sets of lexical elements , from intelligent glossaries ; operating semantically , i . e . preserving the single meaning of elements of the minimal lexicon with the usual set operators ( i . e . set union , set intersection , set complement , set difference , set symmetric difference , . . . ) in order to construct complex lexicons , covering specifically the field of endeavour ; selecting key - words from written texts , which are the high - frequency words appearing within the written texts in that field of endeavor ; semantic researching on the internet or intranet by identifying key - words with lexical elements contained in minimal lexicons generated from intelligent glossaries of the domains . there may be the steps of accepting from an actor , human or machine , a question which is a set of formal texts containing at least one well - formed syntactic element , wherein the value of the well - formed syntactic element is unknown ; parsing and verifying the formal text of the question to infer the type of syntactic element it contains , and to produce formulas contained in the question ; and initializing the rewriting area with the formulas contained in the question . the may also be the steps of retrieving for each formula in the rewriting area , all matching formal definitions from formal glossaries , using algebraic mechanisms of unification and instantiation ; eliminating redundant or inconsistent matching definitions to provide an optimized tree of applicable definitions , and its related current substitution ; building the tree of all applicable definitions from formal glossaries , to each sub - formula of the formulas in the rewriting area . the interpretation process may comprise the steps of : starting by translating each sub - formula of the formulas in the rewriting area , in accordance with the algebraic mechanisms of substitution and replacement , and continues up to a literal formula appears ; stopping by reducing the literal formula in the rewriting area , in accordance with the laws of form calculus of indications for computing its normal form , which is its value ; by laws of form , this value is unique . the step of translating a formula may be comprising : applying formal definitions from the tree of all applicable definitions , to sub - formulas of the formula in the rewriting area ; considering formal definitions as conditional rewriting rules , to transform a formula while preserving its value ; combining and comparing different results from the tree of all applicable definitions , to produce a unique meaningful value ; coding & lt ; α & gt ; the unique value of formula α , as computed in accordance with the present interpretation process . the step of applying formal definitions may be precisely defined by the sentence “ apply a definition ( α |− β ≈ γ ) to a formula φ ”, which is the combination of the pre - condition and injunction mechanisms , namely : 1 . if & lt ; α & gt ; is true then apply injunction β ≈ γ to φ , i . e . replacing with γ any appearance of β in φ ; 2 . if & lt ; α & gt ; is false then do nothing to φ ; 3 . if & lt ; α & gt ; is undefined then stop current transformation of φ , which transmit unknownness value . the symbol & lt ; α & gt ; may be used to indicate any predetermined criteria . the method may comprise the steps of inserting lof algebraic initials , position & amp ; transposition , as theorem type definition in active glossary ; initializing an active glossary with hard - coded definitions of string manipulations . the list of hard - coded functions may be : 1 . concatenation of a string on the right side into a string ; and updating the current substitution and the rewriting area ; 2 . de - concatenation of a string on the right side into a string , and a character ; and updating the current substitution and the rewriting area ; 3 . concatenation of a string on the left side into a string ; and updating the current substitution and the rewriting area ; 4 . de - concatenation of a string on the left side into a string and a character ; and updating the current substitution and the rewriting area ; 5 . generic equality of two formulas , including syntactic equality of strings , by unifying , valuating — by using fca , and comparing syntactically their respective values , and updating the current substitution and the rewriting area ; 6 . deactivation of a well - formed syntactic element , which turns it into a mere and purely syntactical chain of symbols ; and 7 . quantification of a formula by a variable , which develops that quantified formula by listing the variable on the words table : “ for all ” quantifier is developed as a generalized conjunction ; “ there exists ” quantifier is developed as a generalized disjunction . the method may comprise of the step of : providing an answer to actor as the meaningful value of a syntactic element , if syntactic element is not meaningless ; coding the meaningful value of a well - formed syntactic element as a question & amp ; answer type definition , on the form : ‘[ ]|− β ≈ γ ’, for a question without pre - condition , where β is the formula of the question , and γ is the meaningful value ; ‘[ ]|− α β ≈[ ]’, for a question with a pre - condition , where α is the pre - condition of the question , β is the formula of the question ( is the logical implication ); saving in the formal glossary the result definition , in accordance with the types of definition . a computer implemented method of determining the meaning of formal language constructs occurring in written texts , the method comprising the steps of : providing an alphabet and a set of symbols for constructing lexical elements , and syntactic elements built on the alphabet , lexical elements , and symbols ; determining a sort of value , an arity , a notation , and a type for each the syntactic element , to provide well - formed syntactic elements and meaningless syntactic elements ; building formal definitions from the typed well - formed syntactic elements , and determining a type for each definition to provide a list of terminologies , assertions , theorems , questions & amp ; answers ; and building formal glossaries as ordered sets of formal definitions ; acquiring from a knowledge manager ( 12 ) a formal glossary content ; parsing , verifying and normalizing each formal definition contained in the formal glossary , to provide a list of defined lexical elements and undefined lexical elements ; drawing consequences of each assertion and theorem of the formal glossary , to compute new derived assertions and to check compliance with existing terminologies , in accordance with an interpretation process having at least one critical algorithm ; acquiring questions from an actor , wherein each question is a set of formal texts containing at least one well - formed syntactic element ; parsing , verifying and normalizing each well - formed syntactic element in the question ; retrieving , for each defined lexical element contained within the questions , all the applicable formal definitions from the formal glossary ; applying the formal definitions to the defined lexical elements in the questions in accordance with an interpretation process having at least one critical algorithm ; providing the values to the actor ; coding each question and its meaningful value as a new question & amp ; answer definition ; processing a formal glossary as a set of formal texts , using the self - reference capacity of the present computer implemented method , to certify the formal glossary ; and saving the certified formal glossary and its related minimal lexicon , wherein the lexicon is comprised of at least one well - defined lexical element , as an initial intelligent glossary . the step of constructing lexical and syntactic elements , may further comprise the steps of : selecting an alphabet containing at least lowercase letters , uppercase letters , and digits ; selecting from the set of symbols , three primary symbols i . e . the symbols : “⊥”, “@” and “[ ]”; calling primary value , a primary symbol used singly ; calling ordinary symbols , all other symbols from the set of symbols ; including :— definition symbols , i . e . the symbols : “|−”, “≈”, and “;”;— change symbol , i . e . : “ ” ( rightwards wave arrow );— deactivation symbol , i . e . “‘ ’” ( simple quote );— any other symbols , such as parentheses , linguistic symbols , logic symbols , arithmetic symbols , quantifiers , and function symbols ; calling word , a chain of lowercase letters , coding natural languages nouns , adjectives , verbs , and adverbs ; calling number , a chain of digits , coding natural whole numbers ; calling elements the group consisting of primary values , words , numbers , and arrows ; calling arrow , an element ( the target ) separated from either an element or an arrow ( the source ) by a change symbol ; calling identifier , a chain of letters or digits beginning by an uppercase letter ; calling lexical elements the group consisting of words , identifiers , and ordinary symbols ; selecting variable symbols in the group consisting of uppercase letters used singly ; calling syntactic elements the group consisting of symbols , words , numbers , identifiers , arrows , and variables . a notation — which is a data attribute — may be assigned to each syntactic element that is a symbol , further comprising the steps of : assigning a prefix notation for a symbol that is attached to the beginning of its arguments ; for example : “ ” is a prefix symbol in “ ( x = x )”; assigning a postfix notation for a symbol that is attached at the end of its arguments ; for example : “!” is a postfix symbol in “ 2 !”; assigning a infix notation for a symbol that is inserted in the middle of its arguments ; for example : “+” is an infix symbol in “ 2 + 2 ”; assigning a circumfix notation for a unary symbol that is placed around ( bracketing ) its arguments ; for example : “[ ]” is a circumfix symbol in “[ 1 2 ]” the method may further comprise the step of assigning a sort of value — which is a data attribute — to each syntactic element , further comprising the steps of : selecting sorts of value in the group consisting of truth - values ( true , false , unknown ) and reality - values , sub - sorted into numerical , non - numerical reality ; determining if that sort of value — truth or reality — is either a fixed or changing value ; assigning a unique sort of value — to each ordinary symbol , according the usual sort of value of its arguments and results ; for example : “+” is a fixed numerical reality valued symbol ; processing primary symbols as syntactic elements with polymorphic sorts , namely : used singly or with truth - valued syntactic elements , they have truth values ( fixed or changing ); used with reality - valued syntactic elements , they have reality values ( fixed or changing ). the method may comprise the step of assigning an arity — which is a whole number — to each syntactic elements , further comprising the steps of : assigning an arity equal to zero to elements , variables , and identifiers ; assigning to each ordinary symbol , an arity equal to the number of authorized arguments ; for example : “+” is a 2 - arity infix symbol in “ 2 + 2 ”; computing the arity of primary symbols intangled inside or around other syntactic elements , in accordance with their position in regards to the syntactic elements , namely : assigning an arity equal to 1 to a circumfix primary symbol “[ ]”; for example : in the chain “[[ ]]”, the inner “[ ]” is a 0 - arity symbol , and the outer [ ]” is a 1 - arity symbol ; assigning an arity equal to 2 to an infix primary symbol “⊥”; for example : in ( the chain “⊥⊥⊥”, the inner “⊥” is a 2 - arity symbol , and the 2 outer “⊥” are 0 - arity symbols . the method may further comprise the step of : assembling a unique symbol concatenated with only 0 - arity syntactic elements , respecting the sort of value , arity and notation of the symbol ; such a well formed syntactic element is called atomic ; for example , x + 1 is atomic ; a standalone element is atomic ; for example , 1 is atomic ; assembling a unique symbol concatenated with other well - formed syntactic elements , atomic or non - atomic , respecting the sort , arity and notation of the unique symbol ; using parentheses to disambiguate the order of evaluation of syntactic elements ; such a well - formed syntactic element is called non - atomic ; calling all other forms of syntactic elements “ ill - formed ”, and therefore “ meaningless ”, as their value is not computable by the present computer implemented method ; calling “ the head ”, the unique symbol of a well - formed syntactic element , atomic or non - atomic , and calling “ the body ”, the rest of the well - formed syntactic element ; the head and the body of a standalone element are the same ; calling “ the sort of value of a well - formed syntactic element ”, the sort of value of the head of that well - formed syntactic element ; calling “ bound ”, an occurrence of a variable , which is in the body of a quantifier or a function symbol in a well - formed syntactic element ; otherwise , the occurrence of that variable is called “ free ”; calling “ ground ”, a well - formed syntactic element which contains no free variables ; otherwise it is called “ non - ground ”; calling “ literal ”, a well - formed syntactic element which contains only elements , and primary symbols ; otherwise it is called “ non - literal ”; a literal is ground . the well - formed syntactic elements may be typed as : instructions , which contain at least one symbol of definition , wherein instructions are sub - typed as : injunctions , built on two formulas , the indicative part ( the right - hand formula ) and the body ( the left - hand formula ) surrounding the infix symbol of definition “≈”; a simple injunction is coded as “ β ≈ γ ”; a multiple injunction is coded as “ β 0 ≈ γ 0 ; β 1 ≈ γ 1 ; . . . ”; atomic , if all its left - hand formulas are atomic ; unknown , if all its right - hand formulas are @; definitions , built on an expression — the pre - condition , and an injunction , simple or multiple , separated by the infix symbol of definition “|−”; a definition is coded as a three - part pattern form , namely : “ α |− β ≈ γ ”, when constituted with a pre - condition α , and a simple injunction , “ β ≈ γ ”; and “ α |− η ”, when constituted with a pre - condition α , and a multiple injunction , η ; a definition is called ground , if both its pre - condition and its injunction , simple or multiple , are ground ; glossaries , which are ordered lists of definitions , separated by the infix symbol of definition “;”; formulas , which contain no symbols of definition , may be sub - typed as expressions ( which have truth - values ), and terms ( which have reality values ); expressions may be sub - typed as indication expressions ( atomic ) and ordinary expressions ( non - atomic ); equating literal ordinary expressions either as arrangements ( with multiple primary symbols ) or primary values ( with only one primary symbol ); the terms may be sub - typed as indication terms ( atomic ) and ordinary terms ( non - atomic ); equating literal ordinary terms either as packages ( packaged forms , single or multiple ), bunches ( non - packaged and with multiple elements ) or unitary terms (“ uniterms ” with only one non - packaged element , i . e . : numbers , words and arrows ). each formal definition may have a definition type selected from the group consisting of terminologies , assertions , theorems and questions & amp ; answers , wherein : 1 . a terminology is a non - ground definition with an atomic injunction , 2 . an assertion or anti - assertion is a ground definition with an atomic injunction , 3 . a theorem or anti - theorem is a non - ground definition with a non - atomic injunction , 4 . a question & amp ; answer is a definition with an unknown injunction , which must be computed by the present computer implemented method . these 4 basic types of definition are further sub - typed in other sub - types of definition , in accordance with their syntactical structure . a defined lexical element is the unique lexical element that appears within the atomic indicative part β , of a three - part pattern terminology definition coded as “ α |− β ≈ γ ”. the method may further comprise the steps of : acquiring and ordering from a knowledge manager ( 12 ) formal definitions having the same field specific semantic as their original natural language sentences ; respecting the field specific distinctions , as each defined lexical element results from a laws of form calculus of distinction reasoning by the knowledge manager ( 12 ); formalizing the formal definitions following a three - part pattern expressed as ‘ α |− β ≈ γ ’, where β is the indication of the underlying distinction , and defining the defined lexical element . there may also be the steps of : parsing and verifying the formal glossaries and their formal definitions to infer the type of syntactic element they contain ; normalizing primary expressions , for eliminating non - satisfiable sub - formulas while preserving their value , by applying repeatedly the laws of forms algebraic initials ; providing a list of defined lexical elements contained in the formal definitions ; producing a minimal lexicon built from defined lexical elements that appear in the indicative part β of a definition ‘ α |− β ≈ γ ’ in the formal glossary . there may also be the steps of : retrieving each assertion and theorem definition from the formal glossary ; drawing consequences of each assertion and theorem definition , in accordance with an interpretation process having at least one critical algorithm ; verifying consistency of each assertion and theorem definition with existing terminology definitions , in accordance with the laws of form ; providing new derived assertion definitions , which are logical consequences of the assertion and theorem definition . the method may also have the steps of : accepting from an actor , human or machine , a question which is a set of formal texts containing at least one well - formed syntactic element , wherein the value of the well - formed syntactic element is unknown ; parsing and verifying the formal text of the question to infer the type of syntactic element it contains , and to produce formulas contained in the question ; and initializing the rewriting area with the formulas contained in the question . there may also be the steps of : retrieving for each formula in the rewriting area , all matching formal definitions from formal glossaries , using algebraic mechanisms of unification and instantiation ; eliminating redundant or inconsistent matching definitions to provide an optimized tree of applicable definitions , and its related current substitution ; building the tree of all applicable definitions , acquired from formal glossaries , to each sub - formula of the formulas in the rewriting area . there may also be the step of : providing an answer to the actor as the meaningful value of a syntactic element , if the syntactic element is not meaningless . there may also be the step of : saving the consistent ordered set of formal definitions , as a certified formal glossary . there may also be the step of : processing a certified formal glossary as a formal text using the self - referential glossary coding the high level specification of the present computer implemented method ; certifying the compliance of the certified formal glossary with the present computer implemented method ; and providing an initial intelligent glossary , and its related minimal lexicon , from the certified and consistent formal glossary . the interpretation process : may start by translating each sub - formula of the formulas in the rewriting area , in accordance with the algebraic mechanisms of substitution and replacement , and continues up to a literal formula appears and stop by reducing the literal formula in the rewriting area , in accordance with the laws of form calculus of indications for computing its normal form , which is its value ; by laws of form , this value is unique . the steps of translating a formula may be : applying formal definitions from the tree of all applicable definitions , to sub - formulas of the formula in the rewriting area ; considering formal definitions as conditional rewriting rules , to transform a formula while preserving its value ; combining and comparing different results from the tree of all applicable definitions , to produce a unique meaningful value ; coding & lt ; α & gt ; the value of formula α , as computed in accordance with the present interpretation process . applying formal definitions is precisely defined by the sentence “ apply a definition ( α |− β ≈ γ ) to a formula φ ”, which is the combination of the pre - condition and injunction mechanisms , namely : 1 . if & lt ; α & gt ; is true then apply injunction β ≈ γ to φ , i . e . replacing with γ any appearance of β in φ ; 2 . if & lt ; α & gt ; is false then do nothing to φ ; 3 . if & lt ; α & gt ; is undefined then stop current transformation of φ , which transmit unknownness value . a computer implemented method as in claim 22 , further comprising the step of : inserting lof algebraic initials , position & amp ; transposition , as theorem type definition in active glossary ; initializing an active glossary with hard - coded definitions of string manipulations . the list of hard - coded functions ( hcf ) may be : 1 . concatenation of a string on the right side into a string ; and updating the current substitution and the rewriting area ; 2 . de - concatenation of a string on the right side into a string , and a character ; and updating the current substitution and the rewriting area ; 3 . concatenation of a string on the left side into a string ; and updating the current substitution and the rewriting area ; 4 . de - concatenation of a string on the left side into a string and a character ; and updating the current substitution and the rewriting area ; 5 . generic equality of two formulas , including syntactic equality of strings , by unifying , valuating — by using fca , and comparing syntactically their respective values , and updating the current substitution and the rewriting area ; 6 . deactivation of a well - formed syntactic element , which turns it into a mere and purely syntactical chain of symbols ; and 7 . quantification of a formula by a variable , which develops that quantified formula by listing the variable on the words table : “ for all ” quantifier is developed as a generalized conjunction ; “ there exists ” quantifier is developed as a generalized disjunction . the critical algorithm is selected from the group consisting of formula calculation algorithm ( fca ), add definition algorithm ( ada ) and equation resolution algorithm ( era ). a system for verifying , implementing and using a semantic system of intelligent glossaries , the system comprising : an interpretation module having an initialization module , at least one critical algorithm , wherein the interpretation module provides a value for questions , which are set of formal texts containing at least one well - formed syntactical element ; a parsing module which processes texts of formal glossaries and formal questions ; an add definition module for verifying a formal glossary , definition by definition , and for certifying compliance and consistency of the glossary ; at least one active glossary for storing current glossaries of the whole system ; a current substitution initialized with the empty set and updated after each translation ; a rewriting area for computing on formulas , from the initial formal text of a question , up to its meaningful value ; a words table , for storing natural language words and the name of their container glossary ; a viewer module for editing glossaries and questions , and for interacting with actors ; and a file update module for updating glossaries having at least one definition and associated interpretation from the interpretation module . the initialization module may provide system localization services , and data structures initialization . the parsing module may transform formal texts into lexical trees , containing well - formed syntactic elements and their properties ; and automatically infer the type lexical element type of each well - formed syntactic element in the lexical trees . the translation module may : provide an interpretation for each lexical tree corresponding to a formal text ; provide a graph of dependencies between nodes of the lexical trees during computation to detect cycles of computation ; provide numbering of variable symbols to avoid collision between variables of a question and variables of a definition , or variables of deactivated sub - formulas of the same question ; provide a cache pooling collection for memorizing previously computed formulas and their unique value , to optimize computation algorithms by retrieving values by rapid hash - coding access mechanisms . the at least one critical algorithm is selected from the group consisting of hard - coded functions ( hcf ), formulas calculation algorithm ( fca ), add definition algorithm ( ada ), and equation resolution algorithm ( era ). the system may have an intelligent glossary containing the ordered set of definitions for the lexical elements and at least one minimal lexicon generated from the intelligent glossary . the system may be implemented in the computer languages microsoft . net / visual c #. the computer - implemented method uses lof arithmetic for computing value of forms ; forms are formal sentences resulting from questions containing only literal symbols and chains of symbols , in accordance with the following conventions : the symbol “[ ]”— cross ; the symbol “⊥”— space ; the symbol “@”— arrobas ; primary symbols used singly are called primary values ; 2 . numbers ( i . e . 0 1 2 . . . , 123 , 30000 , . . . ) expressed as digits and chains of digits ; 3 . words ( i . e . “ rule ”, “ customer ”, “ service ”, . . . ) expressed as chains of lower - case letters ; 4 . arrows ( i . e . 1 2 , pending invoiced , . . . ) expressed as arrows of primary symbols , words , numbers or other arrows . in lof arithmetic , the injunction “ take any form α ” is a contraction for : 1 . write a form ; 2 . mark it with α ; 3 . let α be its name ; 4 . let the name indicate the form . 1 . in any form , a sub - form can be changed for an equivalent form ; such an equivalent change is called a step ; 2 . steps may be taken in either direction . 1 . a normal form of a form is the simplest form into which , by taking steps , it can be changed . 2 . in accordance with lof the result of that simplification — its normal form — is unique . data structures , operators , injunction and computation in lof arithmetic are formally defined as follows : elements , bunches , packages , and arrangements are “ the forms ”; they are defined as follows ; 1 . elements : primary values , words , numbers , and arrows are elements ; an element is a form ; 2 . bunches : bunches are inductively defined as follows : an element is a bunch ; if α and αβ are forms , then the calling of α and β , i . e . αγ , is a bunch ; a bunch is a form ; 3 . packages : packages are defined as follows : if a is a form then the packaging of α , i . e . [ α ], is a package ; a package is a form ; 4 . arrangements : arrangements are forms that contain only primary symbols . take any form aα ; the package [ α ] is the result of cross operator on α ; take any forms α and β ; the call αβ is the result of space operator on α and β ; take any forms α and β ; “ α ≈ β ” stands for the rewriting rules : 1 . “ replace all occurrence of α with β into any forms where the sub - form α appears ”. 2 . the 2 axioms of george spencer brown : auto - symmetry of crossing : 4 . extension for bunches rearrangement and sorting : calling commutativity : take any forms α and β : αβ ≈ βα ; and calling associativity : lof arithmetic is the rewriting of lof forms onto themselves , by applying repeatedly lof injunctions to reduce the number of non - distinct sub - forms appearing in the initial form : 1 . the normal form resulting is the value of the form ; 2 . two forms are equal if , and only if , they have the same value . the computer - implemented method uses lof algebra for computing the value of formulas ; formulas are formal sentences resulting from definitions and questions containing , in addition to literal symbols , non - literal symbols , identifiers and variables , with the following conventions . 1 . the symbols of definition , in accordance with the present computer implemented method , namely : “|−” “≈” “;” 2 . the linguistic symbols , which are used to formalize semantic relations between natural language words ( i . e . the “ is ” symbol “.”, the “ is a ” symbol “:”, the subsumption symbol “ ” . . . ); 3 . the logical symbols ( i . e : quantifiers (∀, ∃), logical connectors , i . e “ ”, “ ”, “ ”, “ ”, . . . ); 4 . the mathematical symbols ( i . e . arithmetical symbols (“+”,“−,“/””, “×”), equality symbol (“=”), function symbol (“→”), function application symbol (“ _ ”), . . . ). an identifier is a codification or a label beginning with an upper - case letter ; for example : “ zip code ”, “ postal code ”, “ customer ” data base , “ posting ” process . . . ; an identifier is not a word ; identifiers , non - literal symbols and words are the lexical elements ; an arity , a sort of value , and a notation are assigned to each syntactic element : words , numbers and identifiers are 0 - arity lexical elements ; symbols are either 1 - arity ( unary ), or 2 - arity ( binary ). infix notation : the binary symbol is inserted between its ( two ) arguments ; prefix notation : the unary symbol is attached to the beginning of its arguments ; suffix notation : the unary symbol is attached at the end of its arguments ; circumfix notation : the unary symbol is placed around its unique argument ( bracketing ). 3 . the sorts of value of non - literal lexical elements are given in accordance with their usage , i . e . : logical symbols have fixed truth - values ; semantic relation symbols have fixed truth - values ; arithmetical symbols ( i . e . addition or multiplication symbols ) have fixed numerical reality - values ; mathematical function symbols may have changing values , either reality ( i . e . n → n + 1 ) or truth ( i . e . : a a ) values ; identifiers built out of uppercase letters only are predicate : they have changing truth - values ; identifiers built out of at least one uppercase letter — the first letter — followed by at least another letter : are mathematical functions : they have changing reality - values ( numerical or non numerical ); a variable is a symbol which can be substituted with any arbitrary formula : 1 . the variable symbols are standalone upper - case letters , i . e . a , b , c . . . x , y , z ; 2 . variable symbols are 0 - arity syntactic elements ; symbols , words , numbers , identifiers , arrows , and variables are called syntactic elements ; the formal text of a formula consists of combining syntactic elements , either literal or non - literal , while respecting their sort , arity and notation . a ground formula is a formula with no free variables ; a non - ground formula is a formula with at least one free variable : a primary formula is a non - ground formula containing only primary symbols and variables : 1 . a primary expression is a primary formula , which is an expression ; 2 . a primary term is a primary formula , which is a term ; a clause is a primary formula of the form “[[ x ][ y ]]” or “[ x [ y ]]” or “[[ x ] y ]”; a disjunctive primary formula is a primary formula built by calling 2 or more clauses , i . e . of the form “[[ a ][ b ]] . . . [[ y ][ z ]]”. a formula is either an expression or a term , depending on the sort of value of the lexical elements it contains : an expression has a truth - value ; a term has a reality - value ; an indication is a formula made up of a unique symbol concatenated with variables or other 0 - arity elements , respecting the sort , arity and notation of that unique symbol : 1 . an indication is an atomic formula for lof calculus of indications . 2 . a indication expression is an indication , which is an expression ; 3 . a indication term is an indication , which is a term ; an ordinary formula is a formula made up of a unique symbol concatenated with other ordinary formulas , respecting the sort , arity and notation of the unique symbol : 1 . an ordinary formula is a non - atomic formula , for lof calculus of indications ; 2 . a ordinary expression is an ordinary formula , which is an expression ; 3 . an ordinary term is an ordinary formula , which is a term ; a primary indicative formula is a formula containing only literals , primary symbols , variables , and indications : 1 . a primary indicative expression is a primary indicative formula , which is an expression ; 2 . a primary indicative term is a primary indicative formula , which is a term ; the unification process consists of binding unified variables with their respective sub - formulas in a source formula ; elements are constants : they are only unifiable with themselves ; variables can be unified with other formulas , for example : v is assigned the sub - formula 2 , which is notated by the binding “ v \ 2 ”; v is assigned the sub - formula ( 2 + 4 ), which is notated by the binding “ v \( 2 + 4 )”; 3 . source formula (− 2 + 4 ) is not unifiable with − v ; 4 . source formula ( 4 + 4 ) is unifiable with ( v + v ): v is assigned the sub - formula 4 , which is notated by the binding “ v \ 4 ”; 5 . source formula ( 2 + 4 ) is not unifiable with ( v + v ); 6 . both source formulas ( 2 + 4 ) and ( 2 + 2 ), are unifiable with ( v + w ); the substitution process consists of changing unified variables by their respective formulas , into any target formula : 1 . if the same variable occurs more than once in a formula then we must substitute with the same sub - formula at each occurrence of this variable in the target formula ; 2 . different variables can be substituted with the same or different sub - formulas . placing symbols between syntactic elements makes some formulas ambiguous ; for example : formula “ 1 + 2 * 3 ” might mean : 1 and 2 are added , and then the result is multiplied by 3 giving 9 or 1 is added to the result of multiplying 2 by 3 , giving 7 ; parentheses symbols can be used to disambiguate formula &# 39 ; s unification , by indicating the order of evaluation ; for example : 1 +( 2 * 3 ) or ( 1 + 2 )* 3 ; single quotation marks are used to deactivate non - ground formulas ; deactivated formulas are considered as ground formulas , by considering all their variables as elements ( or “ pseudo - constants ”); double quotation marks are used to designate a formula as a chain of symbols ; an assignment of variables is a set of bindings given on these variables , in accordance with the unification process . lof forms , either elements , bunches , packages or arrangements , have equivalent algebraic formulas , named literals : 1 . a literal represents literally a form of lof arithmetic in lof algebra ; 2 . a literal is a ground formula : it cannot be substituted ; 3 . a literal expression is a literal , which is an expression ; 4 . a literal term is a literal , which is a term ; 1 . numbers have numerical reality fixed values . 2 . words have non - numerical reality fixed values ; 3 . arrangements have truth fixed values ; 4 . arrows have changing - values , either truth or reality ; 5 . primary symbols are polymorphic , i . e . : primary symbols singly have truth values ( either fixed or changing ); primary symbols used with numbers , words and arrows have reality values ( either fixed or changing ). to cross is considered as an unary operation whose symbol is a cross with a circumfix notation ; to call is considered as a binary operation whose symbol is a space with an infix notation a primary expression is said to be satisfiable if there is some assignment of variables that will turn it into a literal expression , evaluated to [ ] ( cross ) by lof arithmetic ; otherwise , it is said to be unsatisfiable : 1 . a clause expression of the form “[[ x ] x ]” or “[ x [ x ]]”, for some variable x , is not satisfiable . 2 . a disjunctive expression is satisfiable if , and only if , one of the clauses it contains is satisfiable ; this can be checked in polynomial time . in the computer - implemented method , processing a formula consists of algebraic mechanisms of substitution , replacement , pre - condition and normalization , as follows : if ( α ≈ β ), and if δ is a formula constructed by replacing by β any appearance of α in γ , then ( γ ≈ δ ); if ( α ≈ β ), and if every instance of a given independent variable υ in ( α ≈ β ) is substituted with a formula ω , without being necessary for υ and ω to be equivalent or for ω to be constant or variable , and if as a result of this procedure α becomes γ and β becomes δ , then ( γ ≈ δ ); a preliminary condition — a pre - condition — is a constraint that an injunction must satisfy in order to be acceptable in rewriting : i . a pre - condition delimits the acceptability of transformation from source to target by an injunction ; ii . pre - conditions are expressions ( i . e . truth - valued formulas ); iii . “ α |− η ” stands for the execution of injunction η , constrained by the satisfaction of formula α . normalizing a primary expression is turning it into a disjunctive expression , while eliminating all non - satisfiable clauses it contains ; i . normalization a primary expression preserves the semantic of that primary expression . normalizing a primary expression consists of repeatedly applying the lof algebraic initials : in the computer - implemented method , the following instructional sentences are defined in accordance with the algebraic mechanisms : “ apply injunction β ≈ γ to formula φ ” means rewriting formula φ , through the algebraic mechanisms of unification and assignment , substitution and replacement . “ apply definition α |− β ≈ γ in glossary κ to formula φ ” is defined by the combination of applying injunction and pre - condition , namely : 1 . if & lt ; α & gt ;=[ ] then fca ( apply injunction β ≈ γ to formula φ ) 2 . if & lt ; α & gt ;=⊥ then do nothing to φ 3 . if & lt ; α & gt ;=@ then stop current transformation of φ , and return @, which transmit unknowingness ; apply definition α |− β ≈ γ to formula φ ; the result is the value of the formula , which is notated & lt ; φ & gt ;; “ apply glossary η to formula φ with mode μ ” is the core function of formula calculation algorithm ( fca ). “ draw consequences of assertion and theorem ([ ]- β ≈ γ ) using glossary η ”, is defined by : 1 . γ is either [ ] ( cross ) for assertion or theorem , or ⊥ ( space ) for negative assertion or antitheorem ; 2 . apply glossary η to formula β giving & lt ; β & gt ;, which is a primary indicative formula in which unknown indications represent primary values ; 3 . change & lt ; β & gt ; into a primary formula by replacing all unknown indications , by primary variables ; 4 . compute set of solutions of equation : & lt ; β & gt ;≈ γ ; for all coherent set of primary solutions : { σ 0 , σ 1 , σ 2 , . . . }, whose primary value are respectively : “ draw consequences of assertion and theorem ([ ]|− β ≈ γ ) using glossary κ ”, is the core function of equation resolution algorithm ( era ). “ normalize terminology or theorem α |− β ≈ γ using glossary κ ” is defined by : 1 . inserting lof algebraic initials , position & amp ; transposition , as theorems in glossary κ ; 2 . if definition α |− β ≈ γ is a terminology , then : apply glossary κ ′ to formula α for normalizing ; expression α is changed to primary expression α ′; change temporarily all free variables of formulas α ′ and γ into pseudo constants ; draw consequences of assertion or theorem ([ ]|− α ′≈[ ]) using glossary κ ); change temporarily glossary κ to κ ′; apply glossary κ ′ to formula γ for normalizing ; formula γ is changed to primary formula γ ′; insert into glossary κ the definition α ′|− β ≈ γ ′; γ is either [ ] ( cross ) for a theorem , or ⊥ ( space ) for an antitheorem ; apply glossary κ to formula β for normalizing ; formula β is changed to β ′; insert into glossary κ the definition α |− β ′≈ γ ; apply glossary κ to formula β for normalizing ; formula β is changed to β ′; insert into glossary κ the definition α |− β ′≈ γ ; change temporarily all free variables of expression α into pseudo constants ; expression α is changed to primary expression α ′; draw consequences of assertion or theorem ([ ]|− α ′≈[ ]) using glossary κ ); change temporarily glossary κ to κ ′; apply glossary κ ′ to formula β for normalizing ; formula β is changed to primary formula β ′; insert into glossary κ the definition α ′|− β ′≈ γ ; “ normalize definition α |− β ≈ γ using glossary κ ” is the core function of add definition algorithm ( ada ). the computer - implemented method uses injunctions as conditional instructions to transform a formula for eliminating the number of non - literal symbols , without changing its value ; by the algebraic mechanisms , the variables are assigned in the current substitution with the corresponding syntactic elements in the formula ; the result is a form which can be processed by the lof arithmetic to compute its unique value . lof algebra brings a mechanism for normalizing any formulas into primary formulas for comparing semantically such primary formulas , and therefore any formulas . the interpretation process starts by translating “ on the spot ” the question &# 39 ; s ground formal text , by applying a definition for each lexical element contained in the question , in accordance with the algebraic calculation . at the lowest level , only words , numbers and primary symbols appear : it is a literal formula . the interpretation process stops by sorting , rearranging and reducing the literal formula to its value , in accordance with the lof arithmetic . fig1 depicts the synopsis of the computer implemented method used to create , verify , interpret , use and update a semantic system of intelligent glossaries ( ssig ) 5 . knowledge manager ( 12 ) codes formal definition sentences having the same semantics as original natural language definition sentences . a formal glossary ( 14 ) contains the ordered set of definitions covering the key words usable to express essential knowledge ( 10 ) necessary and sufficient for the activity in a given field of endeavor . each definition in a formal glossary ( 14 ) may be selected from the group consisting of terminology , assertions , theorems and questions & amp ; answers . a formal glossary ( 14 ) may also refer to other formal glossaries . a formal glossary is consistent with lof , if it respects all field specific distinctions : each lexical element results in a distinction - based reasoning by the knowledge manager ( 12 ); field specific distinctions are formalized as indications and formally defined in the formal glossary ( 14 ). formal specifications of the present computer implemented method can be written as a formal glossary ( 12 ), which may be named the self - referential glossary ; the compliance of any formal glossary with the present computer implemented method is checked by processing it as the ground formal text of a question , through quotation marks , by using the self - referential glossary within a ssig ( 16 ). a formal glossary , which is certified to be consistent within such a ssig , becomes an initial intelligent glossary in that ssig 5 . a minimal lexicon ( 18 ) is a lexicon automatically generated from an intelligent glossary ( 20 ), which leads to a consistent lexicon of semantically independent lexical elements . questions are ground formal sentences having the same semantics as original natural language questions sentences ; formal questions ( 22 ) with free variables are turned into ground sentences by pre - conditioning all the variables they contain . the interpretation system transforms questions into their responses ; both knowledge actors and automated knowledge information system ( 24 ) can query formal questions ( 22 ) to the interpretation system . the intelligent glossary ( 20 ) evolves through use , by saving a question ( 22 ) and its answer ( 23 ) as a new question & amp ; answer definition . fig2 depicts the internal of an interpretation system ( 50 ) for implementing a ssig 5 , including an interpretation module ( 52 ), which uses at least one critical algorithm ( e . g . 54 , 56 , 58 ). the current substitution is a set of bindings ( variable , formula ) containing assignments of variables ; the current substitution is initialized with the empty set and updated after each interpretation . the texts of formal glossaries ( 60 ) and formal questions ( 62 ) are parsed using the parsing module ( 63 ), structured by types of syntactic elements and stored into lexical trees by the parsing module ( 63 ); if no parsing errors are found , then the glossary ( 64 ) is checked for semantically duplicate definitions and for consistency , by applying the self - referential glossary imbedded within the ssig , by the check and certification module ; natural language words , together with the name of their container glossary , are stored into the words table ( 65 ); if all glossaries of the ssig are correct , the corresponding active glossary ( 64 ) is initialized by the module ; it is envisioned that a number of different algorithms may be used . by way of example , though , the algorithm may be the add definition algorithm ( ada ) ( 66 ), the formula calculation algorithm ( fca ) ( 56 ) or the equation resolution algorithm ( era ) ( 54 ). the algorithms may be updated by the files update module ( 76 ), which is in communication with the intelligent glossaries ( 20 ) and lexicons ( 18 ). the interpretation module ( 52 ) provides an interpretation for a set of formal texts containing at least one lexical element . the text from the question may be rewritten in the rewriting area ( 68 ) or substituted in the current substitution ( 70 ), delivered to the viewer module ( 72 ) and provided as an answer ( 74 ) fig3 depicts the data model and the process model of the computer - implemented method of determining the meaning of formal written language constructs in accordance with the present invention . fig4 depicts a large knowledge management system for verifying , implementing , sharing and using a common semantic system of intelligent glossaries and their related minimal lexicons , organizing a decentralized network of internet documents and highly parallel computer applications using well - defined interfaces , i . e . in xml language ; this provides the capability to export data definitions for describing formal interfaces ; and to query online properties of lexical elements , inferable from their definition and theorems . all natural language words , symbols and identifiers acquire the same meaning for the whole system ( single meaning ); this provides the capability to operate semantically , i . e . preserving the single meaning of words , on such lexicons — considered as sets of lexical elements — with the usual set operators ( union , intersection , complement , set difference , symmetric difference ) in order to construct complex lexicons , as combinations of lexicons ( minimal or complex ); such a complex lexicon is a thesaurus , covering specifically a business or a field of endeavour , for searching , selecting and clustering with regard to a group of keywords , belonging together to a complex lexicon ; this is called an intelligent retrieval . an intelligent retrieval on web documents , written by authors who respect the single meaning defined in the glossaries of the ssig , enables computers to compute precisely the probability that the document in question is about — or not — a specific business or field of endeavour ; for example : if 80 % of terms contained in the lexicon of logics , and 90 % of terms contained in the lexicon of arithmetic , occur in a text written by an author who respects the single meaning of words and symbols defined in intelligent glossaries then , there is almost 100 % probability that this text is about arithmetic & amp ; logics ; the main differences with statistical approaches , based on the usage and frequency of words occurring in free texts , are : 1 . the keywords — or their formal synonyms — are the high - frequency words appearing within written texts in that field of endeavor ; 2 . these keywords are well defined lexical elements , and purposely occur in the texts with their single meaning ; 3 . the lexicons — considered as sets of keywords — are automatically generated from the certified glossaries containing the single meaning definition of keywords ; an intelligent retrieval can be launched in parallel distributed processing , on all the formal glossaries of an ssig ; and on a corpus of documents on the internet . computer aided translations into another natural language can also be automated by using a ssig . lexical element can be made language independent , by coding them as chains of symbols : this allows to automate translation of definitions to build a multilingual ssig ; the single meaning of words allows a one - to - one translation in multilingual lexicons ; usage of language dependent synonyms permits richer translations ; fig5 depicts the textual and graphical notations used in the description of the main algorithms in fig6 & amp ; 7 . the basic manipulations , not definable in the computer implemented method , consist of hard - coded functions ( hcf ) and equations for the manipulation of strings of symbols , such as : concatenation of a string on the right side into a string ; and updating the current substitution and the rewriting area ; de - concatenation of a string on the right side into a string , and a character ; and updating the current substitution and the rewriting area ; concatenation of a string on the left side into a string ; and updating the current substitution and the rewriting area ; de - concatenation of a string on the left side into a string and a character ; and updating the current substitution and the rewriting area ; generic equality of two formulas , including syntactic equality of strings , by unifying , valuating — by using fca , and comparing syntactically their respective values , and updating the current substitution and the rewriting area ; and deactivation of a well - formed syntactic element , which turns it into a mere and purely syntactical chain of symbols . quantification of a formula by a variable , which develops that quantified formula by listing the variable on the words table : 1 . a “ for all ” quantifier ( universal quantifier , typically ∀), is developed as a generalized conjunction on all words in the words table ; 2 . a “ there exists ” quantifier ” ( existential quantifier , typically ∃), is developed as a generalized disjunction on all words in the words table ; fig6 depicts one embodiment of an implementation utilizing the formulas calculation algorithm ( fca ). fca carries out a backtracking inference . its purpose is to rewrite a formula by replacing sub - formulas in accordance with all their applicable definitions , up to a literal formula is obtained : each time that a lexical element appears , it is translated by the formula of its definition , which reduces the number of non - primary symbols in the formula through the calculation process ; the meaning of a formula , in accordance with a terminology definition , is the simpler formula obtained by applying that definition to the initial formula ; the sequence of two definitions of the same glossary is the composition of their respective meaning ; the fca operates on the entire glossary , which enables it to evaluate language constructs built on previously defined lexical elements . fca is used for applying glossaries to a formula , with different modes ( either all undefined indications are changed to @ or all undefined indications remains “ as is ”); there are two possible cases to which this is applied : case 1 . for a formula that is an expression , corresponding to a declarative sentence ( a statement ); case 2 . for a formula that is a term , corresponding to a naming sentence ( for naming an object or a state ). in case 1 , the response of a glossary to a expression is the primary value obtained by applying the tree of all applicable definitions from glossaries of ssig , to the sub - expressions of the expression ; depending on the mode , fca keeps the unresolved indications as is , instead of valuating them by @; this leads to a primary expression , containing only indications and primary symbols ; otherwise the process stops when nothing but primary symbols remain : this is an arrangement . after being reduced by lof , this arrangement becomes a primary value which is interpreted semantically as follows : a . “[ ]” means that the expression is true ; b . “ ”( or “⊥”) means that the expression is false ; c . “@” means that the expression is undefined , as there remains at least one unsolved indication . the proof of the value of an expression in accordance with the glossary applied is the arrangement calculated by applying the glossary to this expression ; by the value obtained through its reduction , the arrangement proves the value of the expression . in case 2 , the meaning of a term in accordance with a glossary is the bunch obtained by applying the sequence of definitions from glossaries of ssig , to the sub - terms of the term . the algorithm stops when nothing but a collection of words , numbers , and primary symbols remain , which can be semantically interpreted by themselves . for reuniting the 2 cases , 1 & amp ; 2 , the knowledge manager ( 12 ) may write an equation in the form of @= y to express a term being defined y , as an expression ; when processing that expression , the hard - coded generic equality recognizes the unknown element , @ and interprets it “ on the spot ” as referring the current sub - term in the question where it appears ; that current sub - term is then replaced by the value of y ; this can be reused for a complex term , which is thereafter simplified as a result . fca can be used for normalizing the formulas of any definition ; in that case : undefined , recursive , hard - coded , and quantified indications are not changed ; terminologies in which the indicative part contains at least one constant are not applied ; and preconditions are deactivated by the quote function before evaluation . fig6 depicts another embodiment of an implementation utilizing the add definition algorithm ( ada ) and the equation resolution algorithm ( era ). upon loading the glossary , each definition is checked , normalized and inserted by applying ada . the comprehension of an assertion is the set of logical consequences ( called the derived assertions ) that can be drawn from its insertion into the glossary . era implements a “ forward tracking ” inference for simulating that comprehension mechanism : each assertion is interpreted as an equation , where the left - hand term of that equation is a primary expression obtained by applying fca to the indicative part of the assertion without changing unknown assertions , and the right - hand term of that equation is the primary value of the assertion . that equation is solved through enumeration and a derived assertion is inserted for each indication contained in the primary expression , and its primary value solution . era stops when it obtains an expression defined by @. era intervenes for respecting theorems , by applying fca to the indicative part of the theorem , which is a non - ground formula ; this leads to creating new derived assertions , by substituting variables with coherent values from compatible assertions contained in the glossary . era intervenes also when encountering questions with variables and a pre - condition : it solves the equation by equating the pre - condition to [ ]; era keeps the tree of coherent solutions of the pre - condition equation ; for each branch of the tree of solutions , era inserts a derived assertion for evaluating the corresponding variables temporarily in order to compute the question itself . if the expression contains a quantifier on a word , era develops it on the words table , which is the set of all applicable natural language words , for computing direct solutions . it should be understood that the foregoing relates to preferred embodiments of the invention and that modifications may be made without departing from the spirit and scope of the invention as set forth in the following claims .