The complexity of decision procedures in relevance logic II (Q4948542)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1429786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of decision procedures in relevance logic II |
scientific article; zbMATH DE number 1429786 |
Statements
The complexity of decision procedures in relevance logic II (English)
0 references
28 June 2000
0 references
decision procedure
0 references
implication-conjunction fragments
0 references
lower bound on the complexity
0 references
upper bound
0 references
Ackermann function
0 references
0.8256741166114807
0 references
0.8150107860565186
0 references
