Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077)
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. V. Recursive extensions of SQEMA |
scientific article; zbMATH DE number 5869144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA |
scientific article; zbMATH DE number 5869144 |
Statements
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (English)
0 references
22 March 2011
0 references
modal logic
0 references
correspondence theory
0 references
canonicity
0 references
first-order logic with fixed-points
0 references
SQEMA
0 references
0 references
0 references
0 references
0 references
0 references
0.907825767993927
0 references
0.8894362449645996
0 references
0.8863852024078369
0 references
0.8849248886108398
0 references
0.8231939673423767
0 references
