Algorithmic correspondence and canonicity for non-distributive logics (Q2273010)
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 canonicity for non-distributive logics |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic correspondence and canonicity for non-distributive logics |
scientific article |
Statements
Algorithmic correspondence and canonicity for non-distributive logics (English)
0 references
18 September 2019
0 references
modal logic
0 references
substructural logics
0 references
Sahlqvist correspondence
0 references
algorithmic correspondence
0 references
canonicity
0 references
non-distributive lattices
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9562297
0 references
0.9129344
0 references
0.8932104
0 references
0.89217365
0 references
0.88798785
0 references
0.8863523
0 references
0.8836311
0 references
0.88247234
0 references
