Algorithmic correspondence and canonicity for non-distributive logics (Q2273010)

From MaRDI portal
Revision as of 11:02, 23 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128059089, #quickstatements; #temporary_batch_1727085673467)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithmic correspondence and canonicity for non-distributive logics
scientific article

    Statements

    Algorithmic correspondence and canonicity for non-distributive logics (English)
    0 references
    0 references
    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 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references