Thus I simply adds inverse modalities 
to a logic,
whereas Gr() takes all modalities
(
and ) in the logic
inside parenthesis and makes them graded.
If you have a better idea of naming, let me know.
| — | Data structures for storing complexity and properties (FMP/TMP) results are created. A few results are stored, so far without comments or references. | |
| — |
A script is written for displaying names of graded modal logics properly.
Given a modal logic L, we denote:
modal logic with inverse modalities as IL,
graded modal logic as Gr(L),
graded modal logic with (ordinary) inverse modalities as IGr(L),
graded modal logic with graded inverse modalities as Gr(IL).
Thus I simply adds inverse modalities | |
| — | Data structures for storing axioms, operators, dependencies between them, and logics were created. All these types of data has been stored. | |
| — | The bibliography was collected. Some papers (even not very recent) were unfamiliar to me before. Now the Navigator can serve at least as a bibliographic resource. | |
| — | The first version was designed, but contained no complexity results. |