Pages that link to "Item:Q3313255"
From MaRDI portal
The following pages link to Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Q3313255):
Displaying 31 items.
- Subshifts as models for MSO logic (Q384929) (← links)
- On axiomatizations of public announcement logic (Q484925) (← links)
- The decision problems about the periodic solutions of the domino problems (Q798644) (← links)
- An essay in combinatory dynamic logic (Q809068) (← links)
- Augmenting ATL with strategy contexts (Q897650) (← links)
- Polyadic dynamic logics for HPSG parsing (Q1016030) (← links)
- Process logic with regular formulas (Q1062047) (← links)
- Communication in concurrent dynamic logic (Q1095653) (← links)
- A multiparameter analysis of domino tiling with an application to concurrent systems (Q1193883) (← links)
- On undecidability of propositional temporal logics on trace systems (Q1199555) (← links)
- On the solvability of domino snake problems (Q1331945) (← links)
- A codicity undecidable problem in the plane. (Q1401375) (← links)
- From logic to tiling (Q1603696) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- Temporal logic with recursion (Q2051830) (← links)
- A modal logic for supervised learning (Q2155207) (← links)
- The dark side of interval temporal logic: marking the undecidability border (Q2251125) (← links)
- Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
- More on looping vs. repeating in dynamic logic (Q2265813) (← links)
- Model checking propositional dynamic logic with all extras (Q2494725) (← links)
- Past is for free: on the complexity of verifying linear temporal properties with past (Q2842605) (← links)
- Complexity analysis of propositional concurrent programs using domino tiling (Q3142002) (← links)
- Changing a Semantics: Opportunism or Courage? (Q3454820) (← links)
- Subshifts, Languages and Logic (Q3637233) (← links)
- Undecidability results on two-variable logics (Q5048929) (← links)
- Logic and Game Theory (Q5249678) (← links)
- Models and logics for true concurrency. (Q5955751) (← links)
- Temporal Logic with Recursion. (Q6060093) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
- Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard (Q6199614) (← links)
