✦ LIBER ✦

Tractable Fragments of Presburger Arithmetic

✍ Scribed by K. Subramani

Publisher: Springer
Year: 2004
Tongue: English
Weight: 217 KB
Volume: 38
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-004-1220-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generic Complexity of Presburger Arithme

Generic Complexity of Presburger Arithmetic

✍ Alexander N. Rybalov 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 270 KB

Complexity of Presburger Arithmetic with

Complexity of Presburger Arithmetic with Fixed Quantifier Dimension

✍ U. Schöning 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 61 KB

The complexity of presburger arithmetic

The complexity of presburger arithmetic with bounded quantifier alternation depth

✍ Martin Fürer 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 683 KB

A 222pn upper bound on the complexity of

A 222pn upper bound on the complexity of Presburger Arithmetic

✍ Derek C. Oppen 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 605 KB

Overspill and fragments of arithmetic

✍ C. Dimitracopoulos 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 310 KB

Fragments of Arithmetic and true sentenc

Fragments of Arithmetic and true sentences

✍ Andrés Cordón-Franco; Alejandro Fernández-Margarit; F. Félix Lara-Martín 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

Paris and C. Dimitracopoulos, the class of the Πn+1-sentences true in the standard model is the only (up to deductive equivalence) consistent Πn+1-theory which extends the scheme of induction for parameter free Πn+1-formulas. Motivated by this result, we present a systematic study of extensions of b