Presburger arithmetic with unary predicates is Π11 complete
AbstractWe give a simple proof characterizing the complexity of Presburger arithmetic augmented with additional predicates. We show that Presburger arithmetic with additional predicates is complete. Adding one unary predicate is enough to get hardness, while adding more predicates (of any arity) does not make the complexity any worse.
2013 ◽
Vol 36
(1-2)
◽
pp. 165-170
◽
Keyword(s):
1992 ◽
Vol 436
(1896)
◽
pp. 1-11
◽
2000 ◽
Vol 23
(8)
◽
pp. 579-584
Keyword(s):
2006 ◽
Vol 15
(1)
◽
pp. 31-45
◽
2012 ◽
Vol 55
(2)
◽
pp. 507-511