A modal logic for discretely descending chains of sets (Q1826367)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A modal logic for discretely descending chains of sets |
scientific article; zbMATH DE number 2081422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A modal logic for discretely descending chains of sets |
scientific article; zbMATH DE number 2081422 |
Statements
A modal logic for discretely descending chains of sets (English)
0 references
6 August 2004
0 references
In this article, a modal logic for reasoning about knowledge and effort, interpreted over discretely descending chains of sets, is proposed. The logic is a combination of the propositional linear time temporal logic and the modal logic \textbf{S5}. The main results presented are an axiomatization, completeness, and decidability of the system. The problem of complexity is briefly discussed as well.
0 references
modal logic of subset spaces
0 references
logic of knowledge and effort
0 references
propositional linear time temporal logic
0 references
modal logic \textbf{S5}
0 references
completeness
0 references
decidability
0 references
temporalization
0 references
0.93195224
0 references
0 references
0.8770735
0 references
0 references
0.8751232
0 references
0 references
0.8717595
0 references
0.8703659
0 references
0.8700925
0 references
