Apr 8, 2022 · Abstract:We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, ...
Jul 12, 2023 · Abstract. We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, ...
The main result shows that satisfaction for this logic is decidable in two-fold exponential space, and if only threshold- and exact-counting quantifiers are ...
Oct 22, 2024 · They allow more general counting operations in quantifiers, but only unary quantifiers. The move from unary to non-unary quantifiers is non- ...
This noteworthy result shows that there is still room to extend Presburger arithmetic with non-trivial counting quantifiers without increasing the computational ...
This paper gives a thorough overview of what is known about first-order logic with counting quantifiers and with arithmetic predicates.
Mar 29, 2022 · We give a new quantifier elimination procedure for Presburger arithmetic extended with a unary counting quantifier.
On Presburger arithmetic extended with non-unary counting quantifiers ; मुख्य लेखकों: Peter Habermehl ; स्वरूप: लेख ; भाषा: English ; प्रकाशित: Logical ...
The basic idea is that a synchronous three-tape automaton can verify the equation k + ` = m (in terms of the codings of the numbers k, `, and m) and ...
We give a quantifier elimination procedures for the extension of Presburger arithmetic with a unary threshold counting quantifier $\exists^{\ge c} y$ that ...
Missing: non- | Show results with:non-