Remarks on Berger's paper on the domino problem
From MaRDI portal
Publication:2556400
DOI10.1007/BF00971620zbMath0248.02053OpenAlexW1986667059MaRDI QIDQ2556400
Publication date: 1972
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00971620
Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80)
Related Items
On the Decidability of Elementary Modal Logics ⋮ Static analysis of navigational XPath over graph databases ⋮ Small substructures and decidability issues for first-order logic with two variables ⋮ Aperiodic points in $\mathbb Z^2$-subshifts ⋮ Decidability of CPC-irreducibility of subshifts of finite type over free groups ⋮ The periodic domino problem revisited ⋮ Graph subshifts ⋮ Mixing properties of tree-shifts ⋮ Fixed-point tile sets and their applications ⋮ Logical foundations of information disclosure in ontology-based data integration ⋮ On logics with two variables ⋮ Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus ⋮ Complexity of two-variable dependence logic and IF-logic ⋮ Disjunctive logic programs with existential quantification in rule heads ⋮ Two variable first-order logic over ordered domains ⋮ Constructing New Aperiodic Self-simulating Tile Sets ⋮ Effective Closed Subshifts in 1D Can Be Implemented in 2D ⋮ The classical decision problem and partial functions ⋮ On the Restraining Power of Guards ⋮ Decidability of irreducible tree shifts of finite type ⋮ Slopes of multidimensional subshifts ⋮ Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen ⋮ Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results ⋮ Turning decision procedures into disprovers ⋮ Logical separability of labeled data examples under ontologies ⋮ Decidability and undecidability in cellular automata
Cites Work
