Decidability of modal logics of non-\(k\)-colorable graphs (Q6118698): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The modal logic of inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of the plane is at least 5: a new proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modal logic with names / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite model property for logics with the tangle modality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős Graphs Resolve Fine's Canonicity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every world can see a reflexive world / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivational Modal Logics with the Difference Modality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5104715 / rank
 
Normal rank

Latest revision as of 14:17, 27 August 2024

scientific article; zbMATH DE number 7810575
Language Label Description Also known as
English
Decidability of modal logics of non-\(k\)-colorable graphs
scientific article; zbMATH DE number 7810575

    Statements

    Decidability of modal logics of non-\(k\)-colorable graphs (English)
    0 references
    0 references
    28 February 2024
    0 references
    0 references
    chromatic number
    0 references
    modal logic
    0 references
    difference modality
    0 references
    decidability
    0 references
    finite model property
    0 references
    filtration
    0 references