The problem of guaranteeing the existence of a complete set of reductions
In these and in the following two papers the problems mentioned in their title are discussed. The problems already have been listed earlier by the author [Automated Reasoning: 33 Research Problems; Prentice-Hall (1987; Zbl 0663.68102)], they all are connected with the field of automated theorem proving, and each one of the three problems is explained with hints on its relevance as well as on possible tests for (partial) solutions.
scientific article; zbMATH DE number 4114099