Presburger arithmetic with unary predicates is π11 complete

Journal of Symbolic Logic 56 (2):637 - 642 (1991)
We give a simple proof characterizing the complexity of Presburger arithmetic augmented with additional predicates. We show that Presburger arithmetic with additional predicates is Π 1 1 complete. Adding one unary predicate is enough to get Π 1 1 hardness, while adding more predicates (of any arity) does not make the complexity any worse
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274706
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,122
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Added to PP index

Total downloads
9 ( #471,319 of 2,191,314 )

Recent downloads (6 months)
1 ( #290,783 of 2,191,314 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature