Presburger arithmetic with unary predicates is <i>Π</i><sub>1</sub><sup>1</sup> complete (Q3984438)
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 26215
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Presburger arithmetic with unary predicates is <i>Π</i><sub>1</sub><sup>1</sup> complete |
scientific article; zbMATH DE number 26215 |
Statements
Presburger arithmetic with unary predicates is <i>Π</i><sub>1</sub><sup>1</sup> complete (English)
0 references
27 June 1992
0 references
extensions of Presburger arithmetic
0 references
undecidability
0 references
complexity of logical theories
0 references
0.8310413360595703
0 references
0.7687143087387085
0 references
0.763813316822052
0 references
