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.
Reference:
Parzhin, Iu.V., Novikov, V.I. and Kuvshinov, K.V. (2003), “Semanticheskaia formulirovka teoremy Gedelia o nepolnote i ee znachenie dlia postroeniia sistem raspoznavaniia”, Information Processing Systems, Vol. 4(26), pp. 51-57.
Parzhin, Iu.V., Novikov, V.I. and Kuvshinov, K.V. (2003), “Semanticheskaia formulirovka teoremy Gedelia o nepolnote i ee znachenie dlia postroeniia sistem raspoznavaniia”, Information Processing Systems, Vol. 4(26), pp. 51-57.