Recurring Dominoes: Making the Highly Undecidable Highly Understandable
From MaRDI portal
Combinatorial aspects of tessellation and tiling problems (05B45) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Abstract data types; algebraic specification (68Q65) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35)
Recommendations
- scientific article; zbMATH DE number 3843130
- The undecidability of the domino problem
- Highly Undecidable Problems about Recognizability by Tiling Systems
- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
- Undecidability of domino games and hhp-bisimilarity.
- scientific article; zbMATH DE number 3976339
- scientific article; zbMATH DE number 3876591
- scientific article; zbMATH DE number 4057497
- Logical undecidabilities made easy
Cited in
(38)- Subshifts, Languages and Logic
- More on looping vs. repeating in dynamic logic
- Augmenting ATL with strategy contexts
- From logic to tiling
- Logic and Game Theory
- A codicity undecidable problem in the plane.
- Rabin's theorem in the concurrency setting: a conjecture
- Complexity analysis of propositional concurrent programs using domino tiling
- Communication in concurrent dynamic logic
- Temporal Logic with Recursion.
- The complexity of propositional linear temporal logics in simple cases
- On axiomatizations of public announcement logic
- HyperLTL satisfiability is highly undecidable, \(\mathrm{HyperCTL}^*\) is even harder
- Polyadic dynamic logics for HPSG parsing
- On the solvability of domino snake problems
- Past is for free: on the complexity of verifying linear temporal properties with past
- A modal logic for supervised learning
- The dark side of interval temporal logic: marking the undecidability border
- On undecidability of propositional temporal logics on trace systems
- Computational characterization of surface entropies for \(\mathbb{Z}^2\) subshifts of finite type
- Models and logics for true concurrency.
- Undecidability results on two-variable logics
- INTERLEAVING LOGIC AND COUNTING
- Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard
- An essay in combinatory dynamic logic
- Temporal logic with recursion
- FO logic on cellular automata orbits equals MSO logic
- Model checking propositional dynamic logic with all extras
- The complexity of second-order HyperLTL
- scientific article; zbMATH DE number 3976339 (Why is no real title available?)
- A multiparameter analysis of domino tiling with an application to concurrent systems
- On homogeneous models of fluted languages
- Contributions to the domino problem: seeding, recurrence and satisfiability
- The decision problems about the periodic solutions of the domino problems
- Process logic with regular formulas
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
- Subshifts as models for MSO logic
- Changing a Semantics: Opportunism or Courage?
This page was built for publication: Recurring Dominoes: Making the Highly Undecidable Highly Understandable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3313255)
