On the complexity of the closed fragment of Japaridze's provability logic (Q482919)
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: On the complexity of the closed fragment of Japaridze's provability logic |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of the closed fragment of Japaridze's provability logic |
scientific article |
Statements
On the complexity of the closed fragment of Japaridze's provability logic (English)
0 references
15 December 2014
0 references
provability logic
0 references
computational complexity
0 references
closed fragment
0 references
0.8669031262397766
0 references
0.8594645857810974
0 references
0.8312604427337646
0 references
0.8241485357284546
0 references
