Abstract
A method of existential interpretation was introduced in [2]. It allows proving undecidability of modest strata of many first order theories. Here we improve the method and its presentation, strengthen somewhat the previous results and prove a couple of new results. The reader is not supposed to be acquainted with [2].
Similar content being viewed by others
References
Büchi, J.R.: Turing machines and the entscheidungsproblem. Math. Ann.148, 201–213 (1962).
Gurevich, Y.: Existential interpretation. Algebra and Logic4, 71–85 (1965).
Gurevich, Y.: New applications of the existential interpretation method. Abstracts of 1972 Moscow Conference in Math. Logic.
Gurevich, Y.: Semi-conservative reduction. Arch. math. Logik18, 23–25 (1976).
Lewis, H.R.: Unsolvable classes of quantificational formulas. Addison-Wesley Publishing Co. (to appear).
Malcev, A.I.: Algorithms and recursive functions. Moscow: Nauka 1965.
Muchnik, A.A.: Isomorphism of systems of recursively enumerable sets with effective properties. Trudy (Transactions) of Moscow Math. Soc.7, 407–412 (1958).
Smullyan, R.M.: Theory of formal systems. Ann. Math. Studies47 (1961).
Suranyi, J.: Reduktionstheorie des Entscheidungsproblems. Budapest, 1959.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gurevich, Y. Existential interpretation. II. Arch math Logik 22, 103–120 (1980). https://doi.org/10.1007/BF02297651
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02297651