2018
DOI: 10.1017/s1755020317000375
|View full text |Cite
|
Sign up to set email alerts
|

Stable Modal Logics

Abstract: Stable logics are modal logics characterized by a class of frames closed under relation preserving images. These logics admit all filtrations. Since many basic modal systems such as K4 and S4 are not stable, we introduce the more general concept of an M-stable logic, where M is an arbitrary normal modal logic that admits some filtration. Of course, M can be chosen to be K4 or S4. We give several characterizations of M-stable logics. We prove that there are continuum many S4-stable logics and continuum many K4-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
3
2

Relationship

3
5

Authors

Journals

citations
Cited by 10 publications
(11 citation statements)
references
References 29 publications
0
7
0
Order By: Relevance
“…For example, in the special case of topological spaces they simply correspond to continuous maps. They also generalize the stable morphisms studied in [BBI16,BBI18] to the setting of (descriptive) neighborhood frames. We plan to investigate this topic further in a sequel to this paper.…”
Section: Discussionmentioning
confidence: 79%
“…For example, in the special case of topological spaces they simply correspond to continuous maps. They also generalize the stable morphisms studied in [BBI16,BBI18] to the setting of (descriptive) neighborhood frames. We plan to investigate this topic further in a sequel to this paper.…”
Section: Discussionmentioning
confidence: 79%
“…For example, in the special case of topological spaces they simply correspond to continuous maps. They also generalize the stable morphisms studied in [8,9] to the setting of (descriptive) neighborhood frames. We plan to investigate this topic further in a sequel to this paper.…”
Section: Discussionmentioning
confidence: 79%
“…Remark 1. We note that the above corollary can be proved for a larger class of stable and transitive stable logics of [5,6]. These are logics that are sound and complete with respect to classes of rooted frames closed under graph homomorphisms.…”
Section: Mmentioning
confidence: 86%
“…where r is the (only) basic program 6 and ϕ is a formula in the language L E . The program 1 stands for the universal program.…”
Section: Quotient-taking As a Model Transformermentioning
confidence: 99%