Lower complexity bounds in justification logic (Q408543)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower complexity bounds in justification logic |
scientific article; zbMATH DE number 6022772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower complexity bounds in justification logic |
scientific article; zbMATH DE number 6022772 |
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
0.9264565706253052
0 references
0.8590165376663208
0 references
0.8581949472427368
0 references
0.8190941214561462
0 references
0.8181636929512024
0 references
