scientific article; zbMATH DE number 1956520
From MaRDI portal
Publication:4417866
zbMath1029.03015MaRDI QIDQ4417866
Publication date: 30 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2620/26200299.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
The guarded fragment with transitive guards ⋮ On the complexity of the two-variable guarded fragment with transitive guards ⋮ Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable ⋮ Complexity of hybrid logics over transitive frames ⋮ A general method for proving decidability of intuitionistic modal logics ⋮ Deciding regular grammar logics with converse through first-order logic
This page was built for publication:
