The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(82)90115-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992963060 / rank | |||
Normal rank | |||
Revision as of 21:27, 19 March 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
