Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA (Q3431963): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 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 | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1093/logcom/exl026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051649506 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:16, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA |
scientific article |
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
