✦ LIBER ✦

Generic Complexity of Presburger Arithmetic

✍ Scribed by Alexander N. Rybalov

Publisher: Springer
Year: 2008
Tongue: English
Weight: 270 KB
Volume: 46
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-008-9120-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Tractable Fragments of Presburger Arithm

Tractable Fragments of Presburger Arithmetic

✍ K. Subramani 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 217 KB

Generic cuts in models of arithmetic

✍ Richard Kaye 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB

## Abstract We present some general results concerning the topological space of cuts of a countable model of arithmetic given by a particular indicator __Y__. The notion of “indicator” is de.ned in a novel way, without initially specifying what property is indicated and is used to de.ne a topologi

Test complexity of generic polynomials

✍ Peter Bürgisser; Thomas Lickteig; Michael Shub 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 595 KB