✦ LIBER ✦

Recognition complexity of theories and their computational expressivity

✍ Scribed by I. V. Latkin

Book ID: 118794847
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 935 KB
Volume: 51
Category: Article
ISSN: 0002-5232
DOI: 10.1007/s10469-012-9178-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Theories of complexity and their problem

Theories of complexity and their problems

✍ Hans Poser 📂 Article 📅 2007 🏛 Higher Education Press and Springer 🌐 English ⚖ 324 KB

Theories with self-application and compu

Theories with self-application and computational complexity

✍ Thomas Strahm 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 297 KB

On the computational complexity of a mer

On the computational complexity of a merge recognition problem

✍ Anthony Mansfield 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 260 KB

Computational complexity of logical theo

Computational complexity of logical theories of one successor and another unary function

✍ Pascal Michel 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 398 KB

Theories of complexity

✍ Dominique Chu; Roger Strand; Ragnar Fjelland 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 158 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