Pages that link to "Item:Q2556400"
From MaRDI portal
The following pages link to Remarks on Berger's paper on the domino problem (Q2556400):
Displayed 26 items.
- Static analysis of navigational XPath over graph databases (Q269725) (← links)
- The periodic domino problem revisited (Q410732) (← links)
- Fixed-point tile sets and their applications (Q439933) (← links)
- Complexity of two-variable dependence logic and IF-logic (Q476186) (← links)
- Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results (Q1297435) (← links)
- Logical foundations of information disclosure in ontology-based data integration (Q1711879) (← links)
- On logics with two variables (Q1960419) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- Decidability of irreducible tree shifts of finite type (Q2283159) (← links)
- Slopes of multidimensional subshifts (Q2300619) (← links)
- Two variable first-order logic over ordered domains (Q2747711) (← links)
- Decidability and undecidability in cellular automata (Q2869780) (← links)
- Small substructures and decidability issues for first-order logic with two variables (Q2915891) (← links)
- Constructing New Aperiodic Self-simulating Tile Sets (Q3576062) (← links)
- Effective Closed Subshifts in 1D Can Be Implemented in 2D (Q3586005) (← links)
- The classical decision problem and partial functions (Q3867807) (← links)
- Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen (Q4186285) (← links)
- Mixing properties of tree-shifts (Q4599492) (← links)
- On the Restraining Power of Guards (Q4948538) (← links)
- Aperiodic points in $\mathbb Z^2$-subshifts (Q5002814) (← links)
- On the Decidability of Elementary Modal Logics (Q5277903) (← links)
- Disjunctive logic programs with existential quantification in rule heads (Q5398295) (← links)
- Turning decision procedures into disprovers (Q5505144) (← links)
- Decidability of CPC-irreducibility of subshifts of finite type over free groups (Q6098981) (← links)
- Graph subshifts (Q6149050) (← links)