scientific article; zbMATH DE number 3843130

MaRDI QIDQ3313253zbMATH OpenFDO

Authors David Harel

Publication date 1983

zbMATH Keywords

program logicrecurring domino problemstiling problemundecidabilityvalidity problemZFM 531.68003

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35) Combinatorial aspects of tessellation and tiling problems (05B45) Abstract data types; algebraic specification (68Q65)

Cited in

(18)

• PDL with data constants
• The complexity of reasoning about knowledge and time. I: Lower bounds
• A modal logic for cyclic repeating
• A system of dynamic modal logic
• A modal perspective on the computational complexity of attribute value grammar
• The price of universality
• Domino-tiling games
• Hybrid languages
• The undecidability of iterated modal relativization
• Complexity optimal decision procedure for a propositional dynamic logic with parallel composition
• Exponential-size model property for PDL with separating parallel composition
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• $\mathcal{CL}$ : An Action-Based Logic for Reasoning about Contracts
• Complete Axiomatization of a Relative Modal Logic with Composition and Intersection
• A dynamic deontic logic for complex contracts
• Knowledge and local actions
• Dynamic extensions of arrow logic
• Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\)

This page was built for publication:

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