✦ LIBER ✦

On undecidability of propositional temporal logics on trace systems

✍ Scribed by Wojciech Penczek

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 607 KB
Volume: 43
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90007-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On fuzzification of propositional logics

✍ Branislav Boričić 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 108 KB

By fuzziÿcation we mean a procedure which assigns a fuzzy logic to an arbitrary crisp logic. In this paper we describe two essentially di erent fuzziÿcation procedures. In order to give a formal description of the notion of fuzziness of a formula, we extend the language of the propositional logic by

On the undecidability of logics with con

On the undecidability of logics with converse, nominals, recursion and counting

✍ Piero A Bonatti; A Peron 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 322 KB

On the Undecidability of Monadic Modal P

On the Undecidability of Monadic Modal Predicate Logic

✍ Akira Nakamura 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 1 views

On the Decidability of Propositional Alg

On the Decidability of Propositional Algorithmic Logic

✍ Bogdan S. Chlebus 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 802 KB

ON THE DECIDABILITY OF PROPOSITIONAL ALGORITHMIC LOGIC by BOGDAN S. CHLEBIJS in Warsaw (Po1and)l) 0. Introduction Let PAL be a n abbreviation for propositional algorithmic logic. The investigation of PAL is a continuation of earlier works on algorithmic logic (GRABOWSKI [3], KRECZMAR [5], SALWICKI [

On the linear Lindenbaum algebra of Basi

On the linear Lindenbaum algebra of Basic Propositional Logic

✍ Majid Alizadeh; Mohammad Ardeshir 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB 👁 1 views

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