On Presburger Arithmetic Extended with Modulo Counting Quantifiers

DOI10.1007/978-3-662-46678-0_24zbMATH Open1461.03054OpenAlexW2161010252MaRDI QIDQ2949452FDOQ2949452

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) First-order arithmetic and fragments (03F30) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (9)

• Quantifier elimination for counting extensions of Presburger arithmetic
• Title not available (Why is that?)
• Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
• Expansions of Presburger arithmetic with the exchange property
• On Presburger arithmetic extended with non-unary counting quantifiers
• On the locality of arb-invariant first-order formulas with modulo counting quantifiers
• Bounding quantification in parametric expansions of Presburger arithmetic
• On decidable extensions of Presburger arithmetic: from A. Bertrand numeration sytems to Pisot numbers
• Title not available (Why is that?)

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)