Abstract
Certain generalizations of the point set notion stipulated by a Pressburger arithmetic formula are introduced. It is shown that the generalizations lead to unsolvable problems. The unsolvabilities which are obtained are interpreted using models of discrete control problems and in a certain fairly general class of multistep games.
Similar content being viewed by others
Literature cited
S. Ginsburg and E. Spanier, Semigroups, Pressburger Formulas and Languages, Pacif. J. Math.,16, No. 2, 285 (1966).
R. Robinson, Restricted, Set-Theoretical Definitions in Arithmetic, Pros. Amer. Math. Soc.,9, No. 2, 238 (1958).
Yu. V. Matiyasevich, Dokl. Akad. Nauk SSSR,191, No. 6, 279 (1970).
A. A. Korbut and Yu. Yu. Finkel'shtein, Discrete Programming [in Russian], Nauka, Moscow (1969).
K. Kral, On Multiple Grammars, Kybernetika,5, No. 1, 60 (1969).
R. Isaacs, Differential Games [Russian translation], Mir, Moscow (1967).
K. Berge, Theory of Graphs and Its Applications [Russian translation], IL, Moscow (1962).
Author information
Authors and Affiliations
Additional information
Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Radiofizika, Vol. 15, No. 3, pp. 358–364, March, 1972.
Rights and permissions
About this article
Cite this article
Kogan, D.I. D-sets, δ-sets, and unsolvable problems in discrete control. Radiophys Quantum Electron 15, 266–270 (1972). https://doi.org/10.1007/BF02210665
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02210665