Specification by quantifier-free theory of superlinear inequalities and complexity of its decidability (Q5457656)
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: Specification by quantifier-free theory of superlinear inequalities and complexity of its decidability |
scientific article; zbMATH DE number 5263408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Specification by quantifier-free theory of superlinear inequalities and complexity of its decidability |
scientific article; zbMATH DE number 5263408 |
Statements
14 April 2008
0 references
quantifier-free theory
0 references
first-order logic
0 references
many-valued logic
0 references
sequent calculus
0 references
decision algorithm
0 references
exp(lin)-time classe of algorithms
0 references
0.7288140058517456
0 references
0.7249522805213928
0 references
