A well-known result of Ladner says that the satisfiability problem for K45, KD45, and S5 is NP-complete. This result implicitly assumes that there are infinitely many primitive propositions in the language; it is easy to see that the satisfiability problem for these logics becomes linear time if the
On combinations of propositional dynamic logic and doxastic modal logics
β Scribed by Renate A. Schmidt; Dmitry Tishkovsky
- Publisher
- Springer Netherlands
- Year
- 2007
- Tongue
- English
- Weight
- 482 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0925-8531
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The main purpose of this paper is to present an extended Gentzen-type formulation of a many-valued modal propositional logic based on Zadeh's similarity relation.
For instance, the consequence gy(,,, \*,O of the empty L-fuzzy set Op = 0, 'p E P ( P , L,A) is an L-fuzzy subset of F ( P , L, A ) , which assigns to every 'p E F ( P , L, A ) its tautological degree (%9(P,&)O) 'p E L.
I n an earlier paper [2], using ZERMELO-FRAENXEL set theory (ZF) as metalanguage, for each ordinal 6 2 1, I introduced a system TTo of transfinite type theory formulated in GENTZEN'S sequentzen style [3]. The notion of sequent and the rules of inference were straightforward generalizations of those
We consider three infinite hierarchies of what I call "two-dimensional temporal logics with explicit realization operators", viz. (i) one without historical or deontic modalities, (ii) one with historical but without deontic modalities, and (iii) one with historical and with dyadic deontic modalitie
We give a rigorous interpretation of the ways of combining evidence in Mycin-type expert systems. We demonstrate the probabilistic inexactness of the Mycin model and its incompleteness for combining evidence from quantitative data extracted in well-defined physical systems. Finally, we present a new