Quantifier elimination for counting extensions of Presburger arithmetic

DOI10.1007/978-3-030-99253-8_12OpenAlexW4226061243MaRDI QIDQ6181930

Dmitry Chistikov, Alessio Mansutti, Christoph Haase

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-99253-8_12

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (1)

On Presburger arithmetic extended with non-unary counting quantifiers

Cites Work

• The complexity of almost linear diophantine problems
• The complexity of logical theories
• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• Monadic decomposition in integer linear arithmetic
• Theory of computation.
• On Presburger Arithmetic Extended with Modulo Counting Quantifiers
• The Härtig quantifier: a survey
• Monadic Decomposition
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Arithmetic, first-order logic, and counting quantifiers
• Presburger Arithmetic, Rational Generating Functions, and Quasi-Polynomials
• Axiomatische Untersuchungen über Einige mit der Presburgerschen Arithmetik Verwandte Systeme

This page was built for publication: Quantifier elimination for counting extensions of Presburger arithmetic