✦ LIBER ✦

On static logics, dynamic logics, and complexity classes

✍ Scribed by D. Harel; D. Peleg

Book ID: 114037693
Publisher: Elsevier Science
Year: 1984
Weight: 793 KB
Volume: 60
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80023-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Abstract elementary classes and infinita

Abstract elementary classes and infinitary logics

✍ David W. Kueker 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 945 KB

On arithmetic complexity of certain cons

On arithmetic complexity of certain constructive logics

✍ V. E. Plisko 📂 Article 📅 1992 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 655 KB

Dynamic logics of knowledge and access

✍ Tomohiro Hoshi; Eric Pacuit 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 315 KB

Light logics and optimal reduction: Comp

Light logics and optimal reduction: Completeness and complexity

✍ Patrick Baillot; Paolo Coppola; Ugo Dal Lago 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 899 KB

Static and Dynamic Slicing of Constraint

Static and Dynamic Slicing of Constraint Logic Programs

✍ Gyöngyi Szilágyi; Tibor Gyimóthy; Jan Małuszyński 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 469 KB

On the expressivity and complexity of qu

On the expressivity and complexity of quantitative branching-time temporal logics

✍ F. Laroussinie; Ph. Schnoebelen; M. Turuani 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 347 KB

We investigate extensions of CTL allowing to express quantitative requirements about an abstract notion of time in a simple discrete-time framework, and study the expressive power of several relevant logics. When only subscripted modalities are used, polynomial-time model checking is possible even