Remarks on Berger's paper on the domino problem

DOI10.1007/BF00971620zbMATH Open0248.02053OpenAlexW1986667059MaRDI QIDQ2556400FDOQ2556400

Authors: Yuri Gurevich, I. O. Korjakov 

Publication date: 1972

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00971620

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80)

Cites Work

• The undecidability of the domino problem

Cited In (27)

• Effective closed subshifts in 1D can be implemented in 2D
• Small substructures and decidability issues for first-order logic with two variables
• Decidability and undecidability in cellular automata
• Mixing properties of tree-shifts
• The periodic domino problem revisited
• Static analysis of navigational XPath over graph databases
• Graph subshifts
• On the Restraining Power of Guards
• Disjunctive logic programs with existential quantification in rule heads
• The classical decision problem and partial functions
• Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results
• On the decidability of elementary modal logics
• Complexity of two-variable dependence logic and IF-logic
• An aperiodic monotile
• Constructing new aperiodic self-simulating tile sets
• Logical foundations of information disclosure in ontology-based data integration
• On logics with two variables
• Turning decision procedures into disprovers
• Aperiodic points in \(\mathbb{Z}^2\)-subshifts
• Decidability of CPC-irreducibility of subshifts of finite type over free groups
• Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen
• Decidability of irreducible tree shifts of finite type
• Two variable first-order logic over ordered domains
• Slopes of multidimensional subshifts
• Fixed-point tile sets and their applications
• Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
• Logical separability of labeled data examples under ontologies

This page was built for publication: Remarks on Berger's paper on the domino problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556400)