Complexity of Subcases of Presburger Arithmetic (Q3340842): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| label / en | label / en | ||
Complexity of Subcases of Presburger Arithmetic | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/1999283 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4249272358 / rank | |||
Normal rank | |||
| Property / title | |||
Complexity of Subcases of Presburger Arithmetic (English) | |||
| Property / title: Complexity of Subcases of Presburger Arithmetic (English) / rank | |||
Normal rank | |||
Revision as of 21:06, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of Subcases of Presburger Arithmetic |
scientific article |
Statements
1984
0 references
complexity of decidable theories
0 references
lower bounds for lengths of formulas
0 references
Presburger arithmetic
0 references
Complexity of Subcases of Presburger Arithmetic (English)
0 references
