The semantic formula of the Gedel’s theorem about incompleteness and its significance for construction of systems of recognition
Annotations languages:
Description: 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:
Parzhyn, Yu.V., Novykov, V.Y. and Kuvshynov, K.V. (2003), “Semantycheskaia formulyrovka teoremы Hedelia o nepolnote y ee znachenye dlia postroenyia system raspoznavanyia”, Information Processing Systems, Vol. 4(26), pp. 51-57.
Parzhyn, Yu.V., Novykov, V.Y. and Kuvshynov, K.V. (2003), “Semantycheskaia formulyrovka teoremы Hedelia o nepolnote y ee znachenye dlia postroenyia system raspoznavanyia”, Information Processing Systems, Vol. 4(26), pp. 51-57.