On Presburger arithmetic extended with modulo counting quantifiers
From MaRDI portal
Recommendations
- Presburger arithmetic with bounded quantifier alternation
- scientific article; zbMATH DE number 1253963
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity
- Complexity of Presburger arithmetic with fixed quantifier dimension
- Subclasses of Presburger arithmetic and the polynomial-time hierarchy
Cited in
(15)- Quantifier elimination for counting extensions of Presburger arithmetic
- Effective Quantifier Elimination for Presburger Arithmetic with Infinity
- scientific article; zbMATH DE number 6680147 (Why is no real title available?)
- scientific article; zbMATH DE number 1929303 (Why is no real title available?)
- Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
- Expansions of Presburger arithmetic with the exchange property
- Presburger arithmetic with bounded quantifier alternation
- On Presburger arithmetic extended with non-unary counting quantifiers
- On the use of non-deterministic automata for Presburger arithmetic
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- Bounding quantification in parametric expansions of Presburger arithmetic
- On the complexity of linear arithmetic with divisibility
- On decidable extensions of Presburger arithmetic: from A. Bertrand numeration sytems to Pisot numbers
- Complexity of short Presburger arithmetic
- scientific article; zbMATH DE number 4031630 (Why is no real title available?)
This page was built for publication: On Presburger arithmetic extended with modulo counting quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949452)