Presburger arithmetic with unary predicates is <i>Π</i><sub>1</sub><sup>1</sup> complete (Q3984438): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2274706 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980102547 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5573961 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Propositional dynamic logic of nonregular programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of logical theories / rank | |||
Normal rank | |||
Latest revision as of 13:07, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Presburger arithmetic with unary predicates is <i>Π</i><sub>1</sub><sup>1</sup> complete |
scientific article |
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
