Real addition and the polynomial hierarchy (Q1063589)
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 3918354
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Real addition and the polynomial hierarchy |
scientific article; zbMATH DE number 3918354 |
Statements
Real addition and the polynomial hierarchy (English)
0 references
1985
0 references
It is shown that the problem of deciding the truth of a sentence of the first-order theory of real numbers with addition and order given in prenex form with k-1 quantifier alternations is log-complete for the kth level of the polynomial hierarchy, i.e. \(\Sigma^ p_ k\).
0 references
log-complete
0 references
0.7597806453704834
0 references
0.7597806453704834
0 references
0.7410422563552856
0 references
