scientific article
From MaRDI portal
Publication:3313253
zbMath0531.68002MaRDI QIDQ3313253
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Undecidability and degrees of sets of sentences (03D35) Abstract data types; algebraic specification (68Q65) Complexity of computation (including implicit computational complexity) (03D15) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items (17)
Hybrid languages ⋮ The complexity of reasoning about knowledge and time. I: Lower bounds ⋮ Dynamic extensions of arrow logic ⋮ Exponential-Size Model Property for PDL with Separating Parallel Composition ⋮ A dynamic deontic logic for complex contracts ⋮ A modal logic for cyclic repeating ⋮ Knowledge and Local Actions ⋮ Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition ⋮ A system of dynamic modal logic ⋮ The price of universality ⋮ $\mathcal{CL}$ : An Action-Based Logic for Reasoning about Contracts ⋮ Domino-tiling games ⋮ The undecidability of iterated modal relativization ⋮ Undecidability of PDL with \(L=\{a^{2^ i}| i\geq 0\}\) ⋮ A modal perspective on the computational complexity of attribute value grammar ⋮ Complete Axiomatization of a Relative Modal Logic with Composition and Intersection ⋮ PDL with data constants
This page was built for publication:
