Lower complexity bounds in justification logic (Q408543): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.APAL.2011.09.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.APAL.2011.09.010 / rank | |||
Normal rank | |||
Latest revision as of 16:42, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower complexity bounds in justification logic |
scientific article |
Statements
Lower complexity bounds in justification logic (English)
0 references
10 April 2012
0 references
Exact lower complexity bounds are established for several justification logics.
0 references
justification logic
0 references
logic of proofs
0 references
computational complexity
0 references
\(\Pi^p_2\)-completeness
0 references
derivability problem
0 references
