1. It contains information.
2. It processes information.
3. It expresses intelligence.
4. etc..

I. About Formal System

• Finding some orders in a chaotic system.
• Finding some rules (definitions or axioms) to derive those orders.

1. The life of formal system is guaranteed -- for any chaotic system, it can always be formalized or partial formalized. The following theorems provide the support on this.
   1. Ramsey's large number theorem -- system B is chaotic with a "large number" of members, then, some orders can be found in B.
   2. Shadow theorem of Fractal -- every chaotic system is a shadow of an ordered system.
   3. Two code theorem -- a computable system can always be represented with two codes, such as (0, 1), (yin, yang), etc..
   4. etc..
   
   
2. The power (knowledge) of formal system is limited -- For a powerful enough (or complex enough) chaotic system B, no formal system can encompass it. There is always some information (knowledge) of B is unknowable by its corresponding formal system. The following theorems provide the support on this.
   1. Church's (Alonzo Church) undecidability theorem of formal system.
   2. Tarski's (Alfred Tarski) indefinability theorem.
   3. Two incompleteness theorems of Godel.
   4. etc..
   
   All these limitation theorems state a fact that every formal system is a shadow of a chaotic system which is larger than that formal system. Nonetheless, that chaotic system can be almost wholly represented by a progressively enlarging formal systems.

• Some members (in finite number or in infinity) -- they can be called as "symbols."
• Some undefined terms.
• Some definitions (including operations, function, etc.).
• Some axioms (including inference rules, derivation procedure, etc.)

1. String or sentence -- the composite of symbols via some operations (or functions).
2. Theorem -- a sentence which is derived from definitions and/or axioms.

1. Issue -- Is a given sentence a theorem?
   Answer: We can construct a "decision procedure" to find it out.
   Issue -- Does there always have a decision procedure for any given sentence?
   This is called a halting problem.
   Answer: If a procedure halts, a decision can be known. If it does not halt, there is no decision procedure.
   
   
2. Issue -- Can one theorem contradict another theorem in a given formal system?
   Answer: This is the issue of "consistency."
   If one contradiction arises, the formal system is "internally" inconsistent.
   
   
3. Issue -- Is a theorem of a system always true (in the sense of the pre-formal system period)?
   Answer: In the pre-formal system period, a sentence is true if and only if it states a fact about the real world (the reality). That is, a theorem of a formal system needs not to be true. If all theorems of a formal system are true, then it (the formal system) has the "external" consistency.
   
   
4. Issue -- A sentence B of a formal system is true. Must B be a theorem?
   Answer: If B is not a theorem, then that formal system is incomplete.

1. decision procedure
2. halting problem
3. consistency
4. truth
5. completeness

1. Type 1 -- it is consistent and complete. That is, no contradiction among theorems, and all truths are theorems.
2. Type 2 -- it can never be consistent and complete at the same time. If it is consistent, then it must be incomplete.

II. About Life System

1. an arbitrary system F which is a type 2 formal system. And, the governing rules for F are:
   • the "principle of noncontradiction"
   • the "complementary principle"
2. as a type 2 system, F is incomplete. Thus, there is a sentence C of F which is undecidable in F. That is, C or -C (negative C) can both be true in F.
3. in order to eradicate that incompleteness, I simply add "both C and -C" (not just C or -C) as two new axioms of F. With these new axioms, F becomes F(1) = {F, C, -C}.
4. Yet, the Godel's theorems guarantee that F(1) is still incomplete. There is a sentence C1 ...
5. Not willing to be defeated, I repeat the step 3 over and over. Soon, I have constructed the system F(m).

• Mutual Immanence Principle.
• Permanent confinement.

III. The Rise of "Meaning" in a Formal System

1. via interpretation --
   For the form a + b = c,
   if 1 + 9 = 10, it represents a decimal system.
   if 1 + 1 = 10, it represents a binary system, etc..
   
   
2. via assignment --
   The composite of four symbols "book" is artificially assigned to represent "a bound printed pages."
   The combination of some symbols and operations (I read book) is assigned via some assignments and some assigned rules to represent "going over the printed pages while trying to understand some messages on those pages."

1. First order manifestation --- Of course, those interpretations and assignments cannot arise without the innate meanings. They are the first order manifestation (particle).
   
   
2. Second order manifestation --- Then, these first order manifestations can be interpreted and assigned the second time. Linguistically, the first order manifestation is normally done by an author. The second order is done by a reader.
   
   While the first order manifestation has very little leeway away from the innate meaning, there can be a large canyon between the first and the second manifestations. The second manifestation can be very much context laden. That is, the meaning of the first order particle can be changed by the "interaction" between it and the surrounding particles.
   
   
3. The higher order manifestation ---Then, there are higher (third and up) order manifestations. At this point, the innate meaning, the first order manifestation, the second order manifestation, the context and the whatnot are all entangled. Very often, the original meaning (the innate and/or the first order) is buried at this level.

1. Reproduction (replication)
2. Maintaining the life system (metabolism)

1. an preexisting state:
   • There is DNA (DeoxyriboNucleic Acid). It is the information warehouse for a life.
     • It can be read as a sequence of amino acids
     • It always comes in two identical (in mirror images) pairs.
   • There is cytoplasm which is the life soup.
2. The replication and the metabolism processes.
   1. Step one -- getting the blueprints with three DNA-enzymes.
      • DNA-endonuclease --- unzipping the DNA
      • DNA- polymerase --- copy the information and move away
      • DNA-ligase --- restore the unzipped DNA
      The result is the mRNA (messenger RNA), the blueprint carrier.
      
      The requirement for this step: preexisting
      • DNA
      • three DNA enzymes
      
      
   2. step two -- producing an engineer to read the blueprints
      to produce ribosome --- with rRNA (ribosomal RNA) + some proteins
      The requirement for this step: preexisting
      • rRNA
      • cytoplasm
      • some proteins
      
      
   3. step three -- building a prototype
      to produce amino acids --- with Ribosomes (as interpreter) reading and translating mRNA (the blueprints)
      
      
   4. step four -- building a factory
      to produce proteins, including all enzymes --- with Amino acids + tRNA (transfer RNA)
      The requirement for this step: preexisting
      tRNA
      
      
   5. step five -- large production
      With enzymes, all amino acids which are parts for the replication of DNA can be produced in a large quantity. The parts for all proteins for metabolism can also be produced in a large quantity.
      
      Result --- the tasks of replication of DNA and of metabolism can be carried out.
   6. step six -- producing a production manager
      • Some enzymes act as inhibitor or repressor to control and to fine tune the large production.
      
      
   7. step seven -- producing a body
      via morphogenesis

• has information
• processes information
  1. reaching the information (unzipping DNA)
  2. copying the information
  3. reading and interpreting the information
  4. reproducing the information in large quantity
  5. etc.
• has meaning manifestations
  1. first order manifestation
     • producing a messenger
     • producing an engineer
     • producing a manager
  2. second order manifestation
     • replicating DNA
     • maintaining metabolism
  3. higher order manifestation
     morphogenesis -- from genotype to phenotype, producing the organism, the body.

IV. The Essentials of Linguistics

1. DNA exists in pairs (mirror images of each other)
2. the same information is processed in different ways (in tiers)
3. the entire process is a repeated self-reflection --- The mRNA copies a gene or genes of DNA. A gene is the portion of the DNA strand which codes for a single enzyme. The above bio-process is to reproduce the gene via producing ribosome, enzymes, amino acids which are the different expressions of the same information, the gene. The entire process is simply a repeated self-reflection; the same information is processed over and over in different ways and in different tiers.
4. every process is a part of self-referential loop (the prerequisite of an earlier process is that the later process was done already)
5. it is a well-defined Godel system

1. Question one -- Why is DNA in pairs? For a reason of redundancy? Or, it is essential and universal!
   For every type 2 formal system F, it has three expressions.
   1. The nutshell (the four part) expression, F.
   2. The Godel expression -- with theorems and incompleteness. The incompleteness can be viewed as an umbilical cord (um), and we make this um as a new axiom to express F more fully. Thus,
      G1 = F + um(1)
      Gm = F + um(1) + ... + um(m) = G(m-1) + um(m)
      Gm is consistent and ordered.
   3. The chaotic expression G(T) -- T means total.
      G(T) = Gm + ... + ... to infinity.
   
   As a universe of itself, these three expressions of system F (F, Gm, G(T)) are identical. They are self-reflections of one another. In fact, they are permanently confined with one another. This permanent confinement is expressed in figure C.
   
   

   
   
   

   As a universe of itself, one expression of the system (the foreground) can never be separated from another expression (the background). This pair-ness is essential and universal for all formal systems, including the linguistic systems, such as,
   1. high level programming language with machine language
   2. word tokens with their pronunciations.
   3. etc.
2. Question two -- Is the self-referential loop unique to the bio-system? Or, it is essential and universal!
   The vocabulary of all languages are recursively defined. The figure D depicts a self-referential loop. The right hand is drawn by the left while the left is drawn by the right.
   
   

   
   
   

3. Question three -- Must the same information be processed in many different tiers? Is this just a unique feature for the bio-system? Or, it is essential and universal!
   The symbol "b" is processed in a string "book" and again processed in a sentence "I read book." The tier structure is essential and universal to all formal systems, including all linguistic systems. The figure E depicts a tier structure.
   

   
   
   

V. The Framework of Linguistics

1. The structure and the governing rules
   1. Type 2 formal system, F -- consistency (principle of noncontradiction and complementary principle) and incompleteness.
   2. Godel system, G -- self-referential loops (constructed with a type 2 formal system plus its self-referential sentence as a new axiom)
      G(1) = F + um(1), um(1) is F's self-referential sentence
      G(m) = F + um(1) + ... + um(m)
      G(T) = G(m) + um(m+1) + ... + um(n) + ... to ad infinitum, T means total.
      G(T) cannot be reached with this self-referential process.
   3. Life System, L -- mutual immanence and permanent confinement (constructed with the union of G(T) and -G(T) ).
   
   
   
2. The features and the properties
   • F is computable and meaningful -- "every" F encompasses "all" recursive functions which are computable. This feature guarantees that a mapping of F to the real world does exist. Thus, F can be interpreted and be meaningful.
     
     
   • There are a few very important features for G (the Godel systems)
     1. G(m) is unconscious of itself -- the self-referential sentence of G(m) is "always" outside of G(m). While G(m) is conscious of G(m-1), it is unconscious of itself. This fact is vividly depicted in the figure C.
        
        • The white crab (G, the foreground) cannot encompass the black crab (the background, the self-referential space).
        • The white crab cannot be separated from the black crab. This is a permanent confinement and the first order of mutual immanence.
        That is, G(m) does have subconsciousness.
        
     2. G(T) is unreachable in G itself -- again, this fact is vividly depicted in the figure C. The edges of figure C is chaotic, and they cannot be eradicated by expanding the whole sheet.
        Although this chaoticness cannot be removed in G, it can be encompassed with a very special process, the "renormalization" process. In physics, when a particle is not seen, it is not a particle. In a seeing process, a particle must interact with the seeing agent. This "interaction" will make a particle "visible." And, this interaction is called the renormalization for the particle. On the same token, G(T) becomes visible only after it interacts with a particle not of itself.
        That is, after it is renormalized, G will become a "self" which is conscious of itself. Yet, G(T) cannot be renormalized by itself.
     
     
   • L (the Life System) is conscious and intelligent [see thesis(III) below] -- in L, G(T) and -G(T) are renormalizing each other. They are permanently confined and mutually immanent between each other. At this point, both G(T) and -G(T) are conscious of themselves, so is the L(T) = {G(T), -G(T)}. See "Linguistics Space (II)-- the Intelligence."
   
   
3. Bottom out and top out
   • Every FGL system has a bottom. In fact, the F is the bottom of FGL.
   • Every FGL system has a top. In fact, the L(T) is the top of FGL. Yet, it is interesting to know that how to calculate the top.
     G(T) = G(m) + um(m+1) + ... + um(n) + ... to ad infinitum
     = G(n) + um(*), [um(*) = um(n+1) + ... to ad infinitum]
     Now, what we are interested in is about the complexity of G(n), the C(G(n)).
     At one n, when C(G(T)) = C(G(n)), then n is G's top out number.
     Is such a "n" always existing for all G's? The answer is Yes. This top-out process is called renormalization (see "Linguistics Space (III) -- the New Mathematics" at http://www.prebabel.info/newmath.htm). Often, a top-out can become a bottom of a higher system, and this recursion goes ad infinitum. But, this recursion will also be topped out finally (FTO). For religious people, FTO can be called with an over used term "God". In science, this FTO can be called TOE (Theory of Everything). Nonetheless, we do know a few real examples to get a sense of this topping-out process.
     • For a language, n could be equal to 6.
       1. word roots
       2. words
       3. word phrases
       4. sentences
       5. essays
       6. language (top-out)
     • For a higher level system
       1. language
       2. books
       3. ...
       4. cultures
       5. humanity (top-out)
     • For the bio-system above, the n = 7.
     • Higher level bio-system
       1. single cell
       2. ...
       3. ...
       4. humans
       5. ecosystem (top-out)
     Then, L(T) is topped out at {G(n), -G(n)}.
   As having a bottom and a top, every FGL is guaranteed to manifest some meaning when it is interpreted. In fact, every FGL is defined by a bottom and a top while they could be arbitrary chosen. Nonetheless, there is a theoretical bottom for all FGLs, the "nothingness". And, there is a theoretical top for all FGLs, the FTO.

VI. Linguistics Principles are Universal

1. Every chaotic system can always be formalized.
2. Not so fast! Every powerful formal system (Godel system) has a chaotic boundary which cannot be eradicated by "itself".
3. Don't worry! Every chaotic boundary can always be renormalized.

• For a bacterium G(bact, T), it is consistent. That is, all sentences (amino acids, proteins, etc.) in G(bact, T) are theorems of it. This is point 1.
• Thus, the DNA of a virus should not be a theorem of G(bact, T). Yet, it can still be a truth in G(bact. T). So, the non-theorem can write its own theorems (amino acids, etc.) in G(bact. T). That is, G(bact, T) is incomplete, the point 2.
• Both bacterium and virus are different from the bio-system above in one sense. While the above-stated system is written on paper, both the bacterium and the virus have interacted with the environment, and they can be distinguished from the environment and between each other. These interactions are the renormalization processes, the point 3.

1. the nature
2. the human intelligence
3. the linguistics

1. The framework
   1. Tertiary -- The tertiary feature on word form, word sound and word meaning is not an happenstance. It is the intrinsic essence of every formal system which has three expressions [the nutshell expression, the theorems (orderly expanded) expression and the chaotic expression].
   2. Logic -- It can describe "all logic" as it encompasses "all" formal systems.
   3. Hierarchical -- It has many levels of hierarchies (words, word phrases, sentence, essays, etc.) which is the result of self-referential loops, guaranteed by the Godel's theorems.
   4. Mutual immanence -- It encompasses all contradictions with mutual immanence, the union of G(T) and -G(T).
   5. Renormalization -- It encompasses all infinities and infinite chaos with renormalization (having a bottom and a top). Thus, the following is guaranteed.
      • the bottom -- the PreBabel word root set. There is only one bottom.
      • the top -- the universal language. There is only one top.
        Between the bottom and the top, a few theorem (expanded) systems can be developed. The PreBabel (Chinese) is one actual example, which is available at http://www.chinese-word-roots.org.
      • the chaotic expression -- all different languages.
   
   
2. The consequences
   1. The framework of linguistics is universal -- the "Large Complex System Principle (LCSP)" will govern "all" large complex systems. Thus, linguistics is "isomorphic to"
      • human intelligence system. The four features of linguistics are four pillars of intelligence
        1. logic -- formal system
        2. hierarchical -- self-referential loops (Godel systems) and self-similarity transformation of fractal.
        3. mutual immanence -- encompassing all contradictions, the union of G(T) and -G(T)
        4. renormalization -- reigning in infinities and infinite chaos
      • bio-systems
      • physics
      • mathematics
      • political sciences (visit the page http://www.chinese-word-roots.org/cwr016.htm)
      • economics (visit the page http://www.chinese-word-roots.org/econom01.htm)
      • etc.
      Thus, if a discovery in physics which violates a principle of linguistics, the chance of it to be correct at the end will be none. Linguistics is not just about languages. The linguistics principles are universal, applicable in all disciplines.
      
      
   2. One real example of its application
      Seemingly, physics is far removed from linguistics. On March 30, 2010, the Large Hadron Collider (LHC) at CERN saw its first high-energy proton collisions. Its objective is to find a Higgs boson which is the foundation for the Standard Model of elementary particle physics. The graph below is the "current" bottom for the Standard Model.
      
      

      
      
      

      It is a 4 x 4 matrix. If this Higgs boson or any of the whatnot particle wants to be a part of this "bottom" (4 x 4), it has only two choices.
      • Be a part of this bottom. Then, this additional particle will destroy this 4 x 4 matrix. It makes this simple bottom becoming more complicated. In a sense, it violates the bottoming principle of linguistics. Thus, if such a Higgs boson were discovered, it cannot form a true bottom. There must be a bottom lower than the Higgs boson.
      • Be a new bottom. If Higgs boson is a single particle, then this new bottom has only "1" of something. From (4 x 4) to 1, it is seemingly a too big of a drop.
      In both cases, they sit not well with the bottoming principle of linguistics. One does not need to be a physicist, and he can feel that the Higgs boson choice (as a single particle) is not a very smart move. For a (4 x 4) bottoming process, (3 x 3) or (2 x 3) matrix could be much better choices. As the LHC is now in operation, I am putting out this prediction on Elementary Particle Physics here by using the principle of linguistics.