Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA (Q5310652)
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: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA |
scientific article; zbMATH DE number 5200122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA |
scientific article; zbMATH DE number 5200122 |
Statements
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA (English)
0 references
11 October 2007
0 references
0.9388405084609984
0 references
0.9192889928817748
0 references
0.9128909707069396
0 references
0.8894362449645996
0 references
0.8257472515106201
0 references
