On the Correction of Unprovable Formulas

  • G. V. Daydov
Part of the Seminars in Mathematics book series (SM, volume 4)


At the present time there is a considerable number of reports in the literature on the generation of machine programs realizing the deduction search in the propositional and predicate calculuses. The question of machine programs capable of generating “sufficiently interesting” theorems of some kind of axiomatically given theories is also discussed in the literature. The difficulty in this problem is the question of what theorems might naturally be considered “sufficiently interesting.” Some possible approaches to this theorem are considered in [1], [2], [3].


Latticed Form Predicate Calculus Original Hypothesis Manifold Versus Contrary Pair 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    Wang Hao, “Toward mechanical mathematics,” IBM J. Res. and Dev., 4(1): 2–22 (1960).Google Scholar
  2. 2.
    Glushkov, V. M., Introduction to Cybernetics, Kiev, 1964.Google Scholar
  3. 3.
    Glushkov, V. M., Cybernetics and Intellectual Labor, Moscow, 1965.Google Scholar
  4. 4.
    Davydov, G. V., “Method of establishing deducibility in classical predicate calculus,” this volume, p. 1.Google Scholar

Copyright information

© Consultants Bureau 1969

Authors and Affiliations

  • G. V. Daydov

There are no affiliations available

Personalised recommendations