Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ (Q5027233): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-71430-7_4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3202755338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of philosophical logic. Vol. 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4430401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5324584 / 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: Untersuchungen über das Eliminationsproblem der mathematischen Logik / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sahlqvist formulas in relevant logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic correspondence for intuitionistic modal mu-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified Correspondence / 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 canonicity for distributive modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic correspondence and canonicity for non-distributive logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sahlqvist theorem for distributive modal logic / 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: Elementary canonical formulae: extending Sahlqvist's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonassociative right hoops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jónsson-style canonicity for ALBA-inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sahlqvist theorem for relevant modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics for relevant logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for algebras of relevant logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA / rank
 
Normal rank

Latest revision as of 22:51, 27 July 2024

scientific article; zbMATH DE number 7469207
Language Label Description Also known as
English
Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$
scientific article; zbMATH DE number 7469207

    Statements

    Algorithmic Correspondence for Relevance Logics I. The Algorithm $$\mathsf {PEARL}$$ (English)
    0 references
    0 references
    0 references
    4 February 2022
    0 references
    0 references
    relevance logic
    0 references
    Routley-Meyer relational semantics
    0 references
    algorithmic correspondence
    0 references
    inductive formulae
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references