Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA (Q3431963)
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. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA |
scientific article; zbMATH DE number 5142578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA |
scientific article; zbMATH DE number 5142578 |
Statements
Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA (English)
0 references
13 April 2007
0 references
algorithm SQEMA
0 references
polyadic modal logic
0 references
hybrid logic
0 references
first-order correspondence
0 references
canonicity
0 references
completeness
0 references
0.921313464641571
0 references
0.915391206741333
0 references
0.9128909707069396
0 references
0.8849248886108398
0 references
0.8746992945671082
0 references
