Tableaux and hypersequents for justification logics (Q408538): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.apal.2011.09.013 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.APAL.2011.09.013 / rank | |||
Normal rank |
Revision as of 01:09, 9 December 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
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