On Presburger arithmetic extended with non-unary counting quantifiers
We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are given as terms while moduli and thresholds are given explicitly...
| Hlavní autoři: | , |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Logical Methods in Computer Science e.V.
2023-07-01
|
| Edice: | Logical Methods in Computer Science |
| Témata: | |
| On-line přístup: | https://lmcs.episciences.org/9329/pdf |