Tableaux and hypersequents for justification logics (Q408538): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Explicit Provability and Constructive Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introducing Justification into Epistemic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3837723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751361 / 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: Logics With Several Modal Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableaux and Hypersequents for Justification Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the reflected logic of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single step tableaux for modal logics. Computational properties, complexity and methodology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexed systems of sequents and cut-elimination / rank
 
Normal rank

Revision as of 01:07, 5 July 2024

scientific article
Language Label Description Also known as
English
Tableaux and hypersequents for justification logics
scientific article

    Statements

    Tableaux and hypersequents for justification logics (English)
    0 references
    0 references
    10 April 2012
    0 references
    Logics of proofs (now called justification logics), introduced by S. Artemov, are usually based on S4. The author investigates a system S4LPN, introduced by S. Artemov and E. Nogina, which has an additional S5-like schema. He presents rather complicated tableau and hypersequent formulations for S4LPN. It is possible that a much more elegant formulation can be obtained using a cut-free system for S5 due to \textit{G. F. Shvarts} [``Gentzen style systems for K45 and K45D'', Lect. Notes Comput. Sci. 363, 245--256 (1989; Zbl 0677.03010)].
    0 references
    justification logic
    0 references
    hypersequents
    0 references
    tableaux
    0 references
    modal logic
    0 references
    0 references

    Identifiers