Kac-Moody Lie Algebra Conjecture 1 Finiteness in Infinity on Language

Kac-Moody Lie Algebra

Conjecture 1

Finiteness in Infinity on Language

TANAKA Akio

1 Total of words is finite at a certain point of time.

2 Total of finite words combination, phrase, is probably finite.

3 Sentence is free combination of words. So total of sentences is seemed to be infinite.

4 Now cognition of sentence is probably seemed to be based on finite condition of language.

5 If sentences be really infinite, cognition of them is at last seemed to be impossible.

6 Sentence’s appearance of infinity is possibly finite, or finite in infinite.

7 From freeness on generation of sentence, sentence is radically infinite and from cognition of that, sentence is seemed to be a certain type of finite in infinity.

[References]

Subdivision / Tokyo April 10, 2005

Algebraic Linguistics /Linguistic Result /Deep Fissure between Word and Sentence /Tokyo September 10, 2007

Tokyo February 10, 2008

Sekinan Research Field of Language

http://www.sekinan.org

[Basis February 26, 2008]

Operator Algebra / Note 1 / Differential Operator and Symbol / Tokyo February 24, 2008

Leave a comment