Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Smullyan (1962)
Theory of formal systems
Michael Deutsch (1981)
Zur Reduktionstheorie des EntscheidungsproblemsMath. Log. Q., 27
Y. Gurevich (1965)
Existential interpretationAlgebra and Logic, 4
H. Lewis (1979)
Unsolvable classes of quantificational formulas
J. Büchi (1962)
Turing-machines and the EntscheidungsproblemMathematische Annalen, 148
Y. Gurevich (1977)
Semi-conservative reductionArchiv für mathematische Logik und Grundlagenforschung, 18
R. Smullyan (1961)
Theory of Formal Systems. (AM-47)
Donald Taranto (1968)
Algorithms and recursive functions
A.A. Muchnik (1958)
Isomorphism of systems of recursively enumerable sets with effective propertiesTrudy (Transactions) of Moscow Math. Soc., 7
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].
Archive for Mathematical Logic – Springer Journals
Published: Nov 10, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.