Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA (Q3431963)

From MaRDI portal
Revision as of 18:42, 5 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers