Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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.1016/j.jal.2010.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987652121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rudiments of \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A zero-one law for logic with a fixed-point operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: IV. Semantic extensions of SQEMA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5483000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5324584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circumscription revisited: A reduction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3543581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modal logic of the countable random frame / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sahlqvist Formulas in Hybrid Polyadic Modal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary canonical formulae: extending Sahlqvist's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5311052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal predicates, fixed-points, and definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal frame correspondences and fixed-points / rank
 
Normal rank

Latest revision as of 22:14, 3 July 2024

scientific article
Language Label Description Also known as
English
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
scientific article

    Statements

    Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2011
    0 references
    0 references
    modal logic
    0 references
    correspondence theory
    0 references
    canonicity
    0 references
    first-order logic with fixed-points
    0 references
    SQEMA
    0 references
    0 references