Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Kahr, Edward Moore, Hao Wang (1962)
ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE.Proceedings of the National Academy of Sciences of the United States of America, 48 3
A. Turing (1937)
On computable numbers, with an application to the EntscheidungsproblemProc. London Math. Soc., s2-42
A. Chandra, D. Kozen, L. Stockmeyer (1981)
AlternationJ. Assoc. Comput. Mach., 28
János Surányl (1951)
Contributions to the reduction theory of the decision problemActa Mathematica Academiae Scientiarum Hungarica, 2
W. Goldfarb (1984)
The unsolvability of the Gödel class with identityJournal of Symbolic Logic, 49
J. Suranyi (1950)
Contributions to the reduction theory of the decision problem, second paperActa Math. Acad. Sci. Hungaricae, 1
Phokion Kolaitis, Moshe Vardi (1988)
0-1 laws and decision problems for fragments of second-order logic[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
K. Gödel (1932)
Ein Spezialfall des Entscheidungsproblems der theoretischen LogikErgebnisse eines mathematischen Kolloquiums, 2
P. Bernays, M. Schönfinkel (1928)
Zum Entscheidungsproblem der mathematischen LogikMathematische Annalen, 99
Y. Gurevich (1973)
“Izbrannye voprosy algebry i logiki”, (Selected Questions in Algebra and Logic; in memory of A. Malćev)
Y. Gurevich (1976)
The decision problem for standard classesJournal of Symbolic Logic, 41
A. Church (1953)
Review: Janos Suranyi, Contributions to the Reduction Theory of the Decision Problem. Second Paper. Three Universal, One Existential QuantifiersJournal of Symbolic Logic, 18
Y. Gurevich (1969)
The decision problem for the logic of predicates and of operationsAlgebra and Logic, 8
A. Church (1936)
A note on the EntscheidungsproblemJournal of Symbolic Logic, 1
W. Ackermann (1928)
Über die Erfüllbarkeit gewisser ZählausdrückeMathematische Annalen, 100
E. Börger (1984)
Decision Problems in Predicate LogicStudies in logic and the foundations of mathematics, 112
H. Lewis (1980)
Complexity Results for Classes of Quantificational FormulasJ. Comput. Syst. Sci., 21
In first order logic without equality, but with arbitrary relations and functions the ∃*∀∃* class is the unique maximal solvable prefix class. We show that the satisfiability problem for this class is decidable in deterministic exponential time The result is established by a structural analysis of a particular infinite subset of the Herbrand universe and by a polynomial space bounded alternating procedure.
Archive for Mathematical Logic – Springer Journals
Published: Apr 22, 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.