Recurring dominoes: Making the highly undecidable highly understandable (preliminary report)

  • David Harel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)


In recent years many diverse logical systems for reasoning about programs have been shown to posses a highly undecidable, viz Π 1 1 -complete, validity problem. All such known results are reproved in this paper in a uniform and transparent manner by reductions from recurring domino problems. These are simple variants of the classical unbounded domino (or tiling) problems introduced by Wang and the bounded versions defined by Lewis. While the former are (weakly) undecidable and the latter complete in various complexity classes, the problems in the new class are Σ 1 1 -complete.

It is hoped that the paper, which contains also NP-, PSPACE-, Π 1 0 - and Π 2 0 -hardness results for logical systems, will enhance interest in the appealing medium of domino problems as a useful set of reduction tools for exhibiting "bad behavior".


Temporal Logic Turing Machine Propositional Calculus Atomic Formula Linear Temporal Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [AP]
    Apt, K.R. and G.D. Plotkin, Countable Nondeterminism and Random Assignment, Manuscript, 1982.Google Scholar
  2. [Be]
    Berger, R., The Undecidability of the Dominoe Problem, Mem. Amer. Math. Soc. 66 (1966).Google Scholar
  3. [Bn]
    Buchi, J.R., Turing Machines and the Entscheidungsproblem, Math. Ann. 148 (1962), 201–213.Google Scholar
  4. [Ch]
    Church, A., A Note on the Entscheidungsproblem, JSL 1 (1936), 101–102.Google Scholar
  5. [Cn]
    Chandra, A.K., Computable Nondeterministic Functions, 19th FOCS, 127–131, 1978.Google Scholar
  6. [C]
    Cook, S.A., The Complexity of Theorem Proving Procedures, 3rd STOC, 151–158, 1971.Google Scholar
  7. [E]
    van Emde Boas, P., Dominoes are Forever, 1st GTI Workshop, Paderborn, 75–95, 1983.Google Scholar
  8. [FL]
    Fischer, M.J. and R.E. Ladner, Propositional Dynamic Logic of Regular Programs, JCSS 18 (1979), 194–211.Google Scholar
  9. [G]
    Gurevich, Y., The Decision Problem for Standard Classes, JSL 41 (1976), 460–464.Google Scholar
  10. [GK]
    Gurevich, Y. and I.O. Koryakov, Remarks on Berger's Paper on the Domino Problem, Siberian Math. J. 13 (1972), 319–321.Google Scholar
  11. [Hl]
    Harel, D., Dynamic Logic, In: Handbook of Philosophical Logic II, Reidel (1983), to appear.Google Scholar
  12. [H2]
    Harel, D., A Simple Highly Undecidable Domino Problem, Submitted, 1983.Google Scholar
  13. [HKP]
    Harel, D., D. Kozen and R. Parikh, Process Logic: Expressiveness, Decidability, Completeness, JCSS 25 (1982), 144–170.Google Scholar
  14. [HMP]
    Harel, D., A. R. Meyer and V.R. Pratt, Computability and Completeness in Logics of Programs, 9th STOC, 261–268, 1977.Google Scholar
  15. [HP]
    Harel, D. and A. Pnueli, Two Dimensional Temporal Logic, Manuscript, 1982.Google Scholar
  16. [HPS]
    Harel, D., A. Pnueli and J. Stavi, Propositional Dynamic Logic of Nonregular Programs, JCSS (1983), in press.Google Scholar
  17. [HV]
    Harel, D. and M. Vardi, PDL with Intersection, In preparation.Google Scholar
  18. [H]
    Hoare, C.A.R., An Axiomatic Basis for Computer Programming, CACM 12 (1969), 576–580, 583.Google Scholar
  19. [KMW]
    Kahr, A.S., E.F., Moore and H. Wang, Entscheidungsproblem Reduced to the ∀∃∀ Case, Proc. Nat. Acad. Sci. USA, 48, (1962), 365–377.Google Scholar
  20. [K]
    Keisler, J., Model Theory for Infinitary Logic, North Holland, 1971.Google Scholar
  21. [La]
    Ladner, R., The Computational Complexity of Provability in Systems of Modal Propositional Logic, SIAM J. Comp. 6 (1977), 467–480.CrossRefGoogle Scholar
  22. [L1]
    Lewis, H.R., Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus, 19th FOCS, 35–47, 1978.Google Scholar
  23. [L2]
    Lewis, H.R., Unsolvable Classes of Quantificational Formulas, Addison-Wesley, 1979.Google Scholar
  24. [LP]
    Lewis, H.R. and C.H. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall, 1981.Google Scholar
  25. [MP]
    Manna, Z. and A. Pnueli, Verification of Concurrent Programs: Temporal Proof Principles, LNCS 131, Springer, 200–252, 1981.Google Scholar
  26. [Me]
    Mendelson, E., Introduction to Mathematical Logic, van Nostrand Reinhold, 1964.Google Scholar
  27. [M]
    Meyer, A.R., Private Communication, 1977.Google Scholar
  28. [MS]
    Meyer, A.R. and L.J. Stockmeyer, Word Problems Requiring Expoential Time, 5th STOC, 1–9, 1973.Google Scholar
  29. [MSM]
    Meyer, A.R., R.S. Streett and G. Mirkowska, The Deducibility Problem in Propositional Dynamic Logic, LNCS 125, Springer-Verlag, 12–22, 1981.Google Scholar
  30. [PH]
    Paterson, M. and D. Harel, In preparation.Google Scholar
  31. [Pn]
    Pnueli, A., The Temporal Logic of Programs, 18th FOCS, 46–57, 1977.Google Scholar
  32. [P]
    Pratt, V.R., Semantical Considerations on Floyd-Hoare Logic, 17th FOCS, 109–121, 1976.Google Scholar
  33. [RS]
    Reif, J.H. and A.P. Sistla, A Multiprocess Network Logic with Temporal and Spatial Modalities, TR-29-82, Harvard, 1982.Google Scholar
  34. [Ro]
    Robinson, R.M., Undecidability and Nonperiodicity for Tilings of the Plane, Inventiones Math. 12, (1971), 177–209.CrossRefGoogle Scholar
  35. [R]
    Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.Google Scholar
  36. [Sa]
    Savitch, W.J., Relationships Between Nondeterministic and Deterministic Tape Complexities, JCSS 4 (1970), 177–192.Google Scholar
  37. [Sh]
    Shoenfield, J.R., Mathematical Logic, Addison-Wesley, 1967.Google Scholar
  38. [SC]
    Sistla, A.P. and E.M. Clarke, The Complexity of Propositional Linear Temporal Logics, 14th STOC, 159–167, 1982.Google Scholar
  39. [St]
    Stockmeyer, L.J., The Polynomial Time Hierarchy, TCS 3 (1976), 1–22.CrossRefGoogle Scholar
  40. [S]
    Streett, R.S. Global Process Logic is Π11-Complete, Manuscript, 1982.Google Scholar
  41. [T]
    Turing, A.M., On Computable Numbers with an Application to the Entscheidungs-problem, Proc. London Math. Soc. 2, 42 (1936–7), 230–265, 43 (1937), 544–546.Google Scholar
  42. [W1]
    Wang, H., Proving Theorems by Pattern Recognition II, Bell Syst. Tech. J. 40, (1961), 1–41.Google Scholar
  43. [W2]
    Wang, H., Dominoes and the AEA Case of the Decision Problem, In: Mathematical Theory of Automata, Polytechnic Press, 1963, pp. 23–55.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • David Harel
    • 1
  1. 1.Department of Applied MathematicsThe Weizmann Institute of ScienceRehovotISRAEL

Personalised recommendations