Automated Deduction – CADE-20

DOI10.1007/11532231zbMath1135.03333OpenAlexW2485416161MaRDI QIDQ5394613

Boris Konev, Frank Wolter, Michael Zakharyashchev

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/11532231

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (5)

On dynamic topological and metric logics ⋮ Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting ⋮ Non-primitive recursive decidability of products of modal logics with expanding domains ⋮ The ω-Regular Post Embedding Problem ⋮ Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems

This page was built for publication: Automated Deduction – CADE-20