Lower complexity bounds in justification logic (Q408543): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.apal.2011.09.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138829493 / rank | |||
Normal rank | |||
Revision as of 22:48, 19 March 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
