Abstract
We develop a simple general technique for minimal logical implementation of Turing machine programs. This implementation provides for completeness of logical decision problems which via the implementation correspond to limited or unlimited halting problems.
We exemplify our method by a new, simple proof for the automata-theoretical characterization of spectra of arbitrary order n as nondeterministically in n-fold exponential time Turing recognizable sets. We show that via our implementation technique the underlying completeness phenomenon is literally the same as in the Church/Turing theorem on the ∑1-completeness of Hilbert's Entscheidungsproblem, as in Trachtenbrot's theorem on the ∑1-completeness of the finite satisfiability problem for first order logic, but also as in Cook's theorem on the NP-completeness of the decision problem for propositional logic and in many well known lower complexity bound results for logical decision problems.
The Spektralproblem is in the title and in the center of our discussion because it has been officially formulated 33 years ago by the founder of the Institut für mathematische Logik und Grundlagenforschung of the University of Münster where our symposium takes place today. For this reason we include also a summary of the history of the Spektralproblem from 1951 to today, which at some points touches also the history of that Institut.
Preview
Unable to display preview. Download preview PDF.
References
Aanderaa, S.O. (1971): On the decision problem for formulas in which all disjunctions are binary. Proc. of the Second Scand. Log. Symp., pp. 1–18.
Aanderaa, S.O., Börger, E. (1979): The Horn complexity of Boolean functions and Cook's problem. in: F.V. Jensen, B.H. Mayoh, K.K. Moller (Ed.): Proceedings from 5th Scandinavian Logic Symposium, Aalborg University Press, pp. 231–256.
Aanderaa, S.O., Börger, E. (1981): The equivalence of Horn and network complexity for Boolean functions. Acta Informatica 15, 303–307.
Aanderaa, S.O., Börger, E., Lewis, H.R. (1982): Conservative reduction classes of Krom formulas. The Journ. of Symb. Logic 47, 110–129.
Asser, G. (1955): Das Repräsentantenproblem im Prädikatenkalkül der ersten Stufe mit Identität. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 1, pp. 252–263.
Bennett, J. (1962): On spectra, Doctoral Dissertation, Princeton University, N.J.
Börger, E. (1971): Reduktionstypen in Krom-und Hornformeln. Dissertation. Münster, see Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen. in: Archiv für math. Logik und Grundlagenforschung 16 (1974), 67–84.
Börger, E. (1975): On the construction of simple first-order formulae without recursive models. Proc. Coloquio sobra logica simbolica, Madrid, 9–24.
Börger, E. (1979): A new general approach to the theory of the many-one equivalence of decision problems for algorithmic systems, in: Zeitschrift für math. Logik und Grundlagen der Mathematik 25, pp. 135–162.
Börger, E. (1982): Undecidability versus degree complexity of decision problems for formal grammars. in: Proceedings of GTI (Ed. L. Priese), Paderborn 1982, pp. 44–55.
Börger, E. (1984): Decision problems in predicate logic. in: G. Lolli (Ed.): Proc. Logic Colloquium Florence 1982, North-Holland Pu.Co.
Büchi, J.R. (1962): Turing machines and the Entscheidungsproblem, Mathematische Annalen 148, pp. 201–213.
Christen, C.-A. (1974): Spektren und Klassen elementarer Funktionen. Dissertation ETH Zürich.
Church, Alonzo (1936): A note on the Entscheidungsproblem. Journal of Symbol. Logic 1, pp. 40–41; Correction ibid, pp. 101–102.
Cleave, J.P. (1963): A Hierarchy of Primitive Recursive Functions. in: Zeitschr. für math. Logik und Grundlagen der Math. 9, 331–345.
Cook, S.A. (1970): The complexity of theorem proving procedures. Conf. Rec. of 3rd ACM Symp. on Theory of Computing, 151–158.
Cook, S. (1971a): Characterization of push-down machines in terms of time bounded computers. in: Journal of the Association for Computing Machinery 18, 4–18.
Davis, M. & Putnam, H. & Robinson, J. (1961): The decision problem for exponential diophantine equations. in: Annals of Math. 74, 425–436.
Denenberg, L. & Lewis, H.R.: The complexity of the satisfiability problem for Krom formulas. Proc. Logic Colloquium Aachen 1983 (to appear).
Deutsch, Michael (1975): Zur Theorie der spektralen Darstellung von Prädikaten durch Ausdrücke der Prädikatenlogik I. Stufe. in: Archiv math. Logik 17, pp. 9–16.
Fagin, Ronald (1974): Generalized First-Order Spectra and Polynomial-Time Recognizable Sets. in: R. Karp (Ed.): Complexity of Computation, SIAM — AMS Proceedings Vol. 7, pp. 43–73.
Fürer, M. (1981): Alternation and the Ackermann case of the decision problem. in: L'Enseignement mathematique XXVII, 1–2, pp. 137–162.
Germano, G. (1976): An arithmetical reconstruction of the liar's antinomy using addition and multiplication. in: Notre Dame J. of Formal Logic XVII, 457–461.
Grzegorczyk, A. (1953): Some classes of recursive functions. Rozprawy Matematyczne IV, Warzsaw.
Gurevich, Yuri (1966): Ob effektivnom raspoznavanii vipolnimosti formul UIP. Algebra i Logika 5, 25–55.
Gurevich, Yuri (1976): Semi-conservative reduction. in: Archiv für mathematische Logik 18, 23–25.
Hilbert, D. & Bernays, P. (1939): Grundlagen der Mathematik, Vol. II. Berlin
Jones, J.P & Matijasevich, Yu. (1984): Register machine proof of the theorem on exponential diophantine representation of enumerable sets. in: The Journal of Symbolic Logic.
Jones, N.G. & Selman, A.L. (1974): Turing machines and the spectra of first-order formulas, Journal of Symbolic Logic 39, pp. 139–150.
Kostryko, V.F. (1964): Klass cvedeniya ∀∃n∀. Algebra i Logika 3, pp. 45–65.
Kostyrko, V.F. (1966): Klass cvedeniya ∀∃∀. Kibernetika 2, pp. 17–22; English translation, Cybernetics 2, pp. 15–19.
Kreisel, G. (1953): Note on arithmetic models for consistent formulae of the predicate calculus II. in: Proc. XI-th Int. Congr. Philosophy, vol. 14, pp. 39–49.
Lewis, H.R. (1979): Unsolvable classes of quantificational formulas. Reading (Mass.)
Lewis, H.R. (1980): Complexity results for classes of quantificational formulas. JCSS.
Lynch, (1982): Complexity Classes and Theories of Finite Models. in: Math. Systems Theory 15, 127–144.
Machtey, M. & Young, P. (1978): An Introduction to the General Theory of Algorithmus. North-Holland Pu. Co., Amsterdam.
Machtey, M. & Young, P. (1981): Remarks on recursion versus diagonalization and exponentially difficult problems. in: J. Computer and System Sciences 22, 442–453.
Minsky, M.L. (1961): Recursive unsolvability of Post's problem of ‘Tag’ and other topics in theory of Turing machines, Ann. of Math. 74, 437–455.
Mostowski, A. (1953): On a system of axioms which has no recursively enumerable model. in: Fundamenta Mathematicae 40, 56–61.
Mostowski, A. (1955): A formula with no recursively enumerable model. in: Fundamenta Mathematicae 43, 125–140.
Mostowski, A. (1956): Concerning a problem of H. Scholz, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 2, pp. 210–214.
Oberschelp, W. (1958): Varianten von Turingmaschinen. in: Archiv für math. Logik 4, 53–62.
Post, E. (1943): Formal Reductions of the General Combinatorial Decision Problem. in: American Journal of math. 65, 197–268.
Rabin, MO. (1958): On recursively enumerable and arithmetic models of set theory. in: The Journal of Symbolic Logic 23, pp. 408–416.
Ritchie, R.W. (1960): Classes of Recursive Functions of Predictable Complexity. Doctoral Dissertation at Princeton University.
Ritchie, R.W. (1963): Classes of Predictably Computable Functions. in: Trans. Amer. Math. Soc. 106, 139–173.
Ritchie, R.W. (1965): Classes of Recursive Functions Based on Ackermann's Function. in: Pacific J. Math. 15, 1027–1044.
Rödding, D. (1968): Klassen rekursiver Funktionen. in: Proc. of the Summer School in Logic, Leeds 1967, Springer Lecture Notes in Math. vol. 70, 159–222.
Rödding, D. (1968a): Höhere Prädikatenlogik: Interpolationstheorem, Reduktionstypen. Lecture Notes (Mimeographed), Institut für math. Logik und Grundlagenforschung of the University of Münster.
Scholz, Heinrich (1952): Ein ungelöstes Problem in der symbolischen Logik. in: The Journal of Symbolic Logic 17, pp. 160.
Schwichtenberg, H. (1969): Bemerkungen zum Spektralproblem. in: Tagungsberichte des Math. Forschungsinstituts Oberwolfach, 8, pg. 12.
Shepherdson, J.C. & Sturgis, H.E. (1963): Computability of Recursive Functions. in: Journal of the Association for Computing Machinery 10, 217–255.
Smullyan, R. (1961): Theory of Formal Systems. in: Annals of Mathematics Studies vol. 47, Princeton University Press, Princeton/New Jersey.
Specker, E. & Strassen, V. (1976): Komplexität von Entscheidungsproblemen. Springer Lecture Notes in Computer Science Vol. 43.
Suranyi, J. (1959): Reduktionstheorie des Entscheidungsproblems im Prädikatenkalkül der ersten Stufe. Verlag der Ungarischen Akademie der Wissenschaften, Budapest.
Trachtenbrot, B.A. (1950): Impossibility of an algorithm for the decision problem in finite classes. in: Dokl. Akad. Nauk SSS R 70, 1950, pp. 569–572. English translation in: AMS Transl. Ser. 2 Vol. 23 (1963, pp. 1–5.
Turing, Alan M. (1937): On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 2nd series 42, pp. 230–265; correction ibid., 43, pp. 544–546.
Wang, H. (1957): A variant to Turing's theory of computing machines. in: Journal of the Association for Computing Machinery 4, 63–92.
Young, P. (1983): Gödel Theorems, Exponential Difficulty and Undecidability of Arithmetic Theories: An Exposition. in: Proc. AMS Summer School on Recursion Theory, Ithaca 1982.
Rödding, D., Schwichtenberg, H. (1972): Bemerkungen zum Spektralproblem. Zeitschrift für math. Logik und Grundlagen der Mathematik, 18, pp. 1–12
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Börger, E. (1984). Spektralproblem and completeness of logical decision problems. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_50
Download citation
DOI: https://doi.org/10.1007/3-540-13331-3_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13331-5
Online ISBN: 978-3-540-38856-2
eBook Packages: Springer Book Archive