1. Science
  2. Publications
  3. Information Processing Systems
  4. 4(26)'2003
  5. The semantic formula of the Gedel’s theorem about incompleteness and its significance for construction of systems of recognition

The semantic formula of the Gedel’s theorem about incompleteness and its significance for construction of systems of recognition

Yu.V. Pargin, V.I. Novikov, K.V. Kuv-shinov
Annotations languages:

The reasons of rise of the concept, formulated by the Gedel, of incompleteness for the formalized languages and natural language are considered and some paths of a solution of a problem of a deducibility of the true assertions in indicative formalisms are discussed. The significance of the given problem for construction of pattern recognition systems is defined.