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

This publication has 18 references indexed in Scilit:

• Dynamic Logic
  Published by Springer Nature ,1984
• Propositional dynamic logic of nonregular programs
  Journal of Computer and System Sciences, 1983
• Computable nondeterministic functions
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1978
• Computability and completeness in logics of programs (Preliminary Report)
  Published by Association for Computing Machinery (ACM) ,1977
• Remarks on Berger's paper on the domino problem
  Siberian Mathematical Journal, 1972
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971
• An axiomatic basis for computer programming
  Communications of the ACM, 1969
• The undecidability of the domino problem
  Memoirs of the American Mathematical Society, 1966
• Turing-machines and the Entscheidungsproblem
  Mathematische Annalen, 1962
• ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
  Proceedings of the National Academy of Sciences, 1962