Computer Science Logic
From MaRDI portal
Publication:5394585
DOI10.1007/11538363zbMath1136.03315OpenAlexW2479351976MaRDI QIDQ5394585
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11538363
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (10)
Complexity of Two-Variable Logic on Finite Trees ⋮ Small substructures and decidability issues for first-order logic with two variables ⋮ On the complexity of the two-variable guarded fragment with transitive guards ⋮ Epistemic logics with quantification over epistemic operators: decidability and expressiveness ⋮ Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable ⋮ Unnamed Item ⋮ The fluted fragment with transitive relations ⋮ Propositional epistemic logics with quantification over agents of knowledge ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Computer Science Logic
