Loop-free calculus for modal logic S4. I (Q392988): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Proof methods for modal and intuitionistic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loop-free decision procedure for modal propositional logics K4, S4 and S5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Method to Obtain Termination in Backward Proof Search for Modal Logic S4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716271 / rank
 
Normal rank

Revision as of 05:27, 7 July 2024

scientific article
Language Label Description Also known as
English
Loop-free calculus for modal logic S4. I
scientific article

    Statements

    Identifiers