Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA (Q5310652): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Q266857 / rank | |||
Property / author | |||
Property / author: Dimiter Vakarelov / rank | |||
Property / author | |||
Property / author: Valentin F. Goranko / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Dimiter Vakarelov / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: SQEMA / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 20:44, 5 March 2024
scientific article; zbMATH DE number 5200122
Language | Label | Description | Also known as |
---|---|---|---|
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