On modal logics characterized by models with relative accessibility relations. II (Q1595920): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Stéphane P. Demri / rank | |||
| Property / author | |||
| Property / author: Dov M. Gabbay / rank | |||
| Property / author | |||
| Property / author: Stéphane P. Demri / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Dov M. Gabbay / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:03, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On modal logics characterized by models with relative accessibility relations. II |
scientific article |
Statements
On modal logics characterized by models with relative accessibility relations. II (English)
0 references
18 February 2001
0 references
The paper is a continuation of Part I [Stud. Log. 65, No.~3, 323-353 (2000; Zbl 0969.03028)]. Constructions from Part I are extended to the case of Rare-logics with nominals. The class of standard modal logics for which the universal modal operator can be eliminated (if satisfiability is concerned) is characterized. Proof systems for Rare-logics are proposed. A uniform method of proving decidability of Rare-logics and, in particular, information logics based on rough set theory is given.
0 references
polymodal logic
0 references
relative accessibility relation
0 references
Rare-logics (with nominals)
0 references
information logics
0 references
decidability
0 references
modal logics
0 references
