
doi: 10.1007/bf02671748
Each modal propositional formula naturally defines an operator on the subsets of a Kripke model. The author establishes the existence of least fixed points for partially ordered Kripke models that satisfy cofinality of infinite increasing chains and proves that they are definable by a formula. Previously, the author proved a similar result for Grzegorczyk's logic [see Algebra Logic 32, No. 5, 279-288 (1993), translation from Algebra Logika 32, No. 5, 519-536 (1993; Zbl 0815.03007)] and for the Gödel-Löb logic [see Algebra Logic 32, No. 6, 372-375 (1993), translation from Algebra Logika 32, No. 6, 683-689 (1993; Zbl 0815.03008)].
partially ordered Kripke models, least fixed point, Modal logic (including the logic of norms), positive operator, modal logic
partially ordered Kripke models, least fixed point, Modal logic (including the logic of norms), positive operator, modal logic
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
