Higher-Order Syntax and Saturation Algorithms for Hybrid Logic (Q2867945): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4945233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internalizing labelled deduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof methods for modal and intuitionistic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types, tableaus, and Gödel's God / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263021 / rank
 
Normal rank

Latest revision as of 05:07, 7 July 2024

scientific article
Language Label Description Also known as
English
Higher-Order Syntax and Saturation Algorithms for Hybrid Logic
scientific article

    Statements

    Higher-Order Syntax and Saturation Algorithms for Hybrid Logic (English)
    0 references
    0 references
    0 references
    20 December 2013
    0 references
    0 references
    hybrid logic
    0 references
    modal logic
    0 references
    lambda calculus
    0 references
    tableau systems
    0 references
    decision procedures
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references