The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 04:57, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of Presburger arithmetic with bounded quantifier alternation depth |
scientific article |
Statements
The complexity of Presburger arithmetic with bounded quantifier alternation depth (English)
0 references
1982
0 references
decision problem for first order theories
0 references