Tableaux and hypersequents for justification logics (Q408538): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(8 intermediate revisions by 7 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.apal.2011.09.013 / rank | |||
Property / review text | |||
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)]. | |||
Property / review text: 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)]. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B45 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B42 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03F45 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6022769 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
justification logic | |||
Property / zbMATH Keywords: justification logic / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hypersequents | |||
Property / zbMATH Keywords: hypersequents / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tableaux | |||
Property / zbMATH Keywords: tableaux / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
modal logic | |||
Property / zbMATH Keywords: modal logic / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Grigori Mints / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.apal.2011.09.013 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1981979308 / rank | |||
Normal rank | |||
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 | |||
Property / DOI | |||
Property / DOI: 10.1016/J.APAL.2011.09.013 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:42, 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