On Presburger Arithmetic Extended with Modulo Counting Quantifiers

DOI10.1007/978-3-662-46678-0_24zbMath1461.03054OpenAlexW2161010252MaRDI QIDQ2949452

Peter Habermehl, Dietrich Kuske

Publication date: 1 October 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-662-46678-0_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30)

Related Items (2)

On Presburger arithmetic extended with non-unary counting quantifiers ⋮ Quantifier elimination for counting extensions of Presburger arithmetic

This page was built for publication: On Presburger Arithmetic Extended with Modulo Counting Quantifiers