The complexity of presburger arithmetic with bounded quantifier alternation depth

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

It is shown how the method of Fischer and Rabin can be extended to get good lower bounds for Presburger arithmetic with a bounded number of quantifier alternations. In this case, the complexity is one exponential lower than in the unbounded case. This situation is typical for first order theories.

Original languageEnglish (US)
Pages (from-to)105-111
Number of pages7
JournalTheoretical Computer Science
Volume18
Issue number1
DOIs
StatePublished - Jan 1 1982

Fingerprint

Alternation
Quantifiers
Lower bound
First-order

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{ecf76bc9ea5a408da1f443131be87f54,
title = "The complexity of presburger arithmetic with bounded quantifier alternation depth",
abstract = "It is shown how the method of Fischer and Rabin can be extended to get good lower bounds for Presburger arithmetic with a bounded number of quantifier alternations. In this case, the complexity is one exponential lower than in the unbounded case. This situation is typical for first order theories.",
author = "Martin Furer",
year = "1982",
month = "1",
day = "1",
doi = "10.1016/0304-3975(82)90115-3",
language = "English (US)",
volume = "18",
pages = "105--111",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

The complexity of presburger arithmetic with bounded quantifier alternation depth. / Furer, Martin.

In: Theoretical Computer Science, Vol. 18, No. 1, 01.01.1982, p. 105-111.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The complexity of presburger arithmetic with bounded quantifier alternation depth

AU - Furer, Martin

PY - 1982/1/1

Y1 - 1982/1/1

N2 - It is shown how the method of Fischer and Rabin can be extended to get good lower bounds for Presburger arithmetic with a bounded number of quantifier alternations. In this case, the complexity is one exponential lower than in the unbounded case. This situation is typical for first order theories.

AB - It is shown how the method of Fischer and Rabin can be extended to get good lower bounds for Presburger arithmetic with a bounded number of quantifier alternations. In this case, the complexity is one exponential lower than in the unbounded case. This situation is typical for first order theories.

UR - http://www.scopus.com/inward/record.url?scp=0001042546&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0001042546&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(82)90115-3

DO - 10.1016/0304-3975(82)90115-3

M3 - Article

AN - SCOPUS:0001042546

VL - 18

SP - 105

EP - 111

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1

ER -