Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1705.00290 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912213396094976 |
|---|---|
| author | Baskar, A. Sreejith, A. V. Thinniyam, R. S. |
| author_facet | Baskar, A. Sreejith, A. V. Thinniyam, R. S. |
| contents | We show that first order logic (FO) and first order logic extended with modulo counting quantifiers (FOMOD) over purely functional vocabularies which extend addition, satisfy the Crane beach property (CBP) if the logic satisfies a normal form (called positional normal form). This not only shows why logics over the addition vocabulary have the CBP but also gives new CBP results, for example for the vocabulary which extends addition with the exponentiation function. The above results can also be viewed from the perspective of circuit complexity. Showing the existence of regular languages not definable in FOMOD[<, +, *] is equivalent to the separation of the circuit complexity classes ACC0 and NC1 . Our theorem shows that a weaker logic , namely, FOMOD[<,+,2^x] cannot define all regular languages. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1705_00290 |
| institution | arXiv |
| publishDate | 2017 |
| record_format | arxiv |
| spellingShingle | Modulo quantifiers over functional vocabularies extending addition Baskar, A. Sreejith, A. V. Thinniyam, R. S. Logic in Computer Science We show that first order logic (FO) and first order logic extended with modulo counting quantifiers (FOMOD) over purely functional vocabularies which extend addition, satisfy the Crane beach property (CBP) if the logic satisfies a normal form (called positional normal form). This not only shows why logics over the addition vocabulary have the CBP but also gives new CBP results, for example for the vocabulary which extends addition with the exponentiation function. The above results can also be viewed from the perspective of circuit complexity. Showing the existence of regular languages not definable in FOMOD[<, +, *] is equivalent to the separation of the circuit complexity classes ACC0 and NC1 . Our theorem shows that a weaker logic , namely, FOMOD[<,+,2^x] cannot define all regular languages. |
| title | Modulo quantifiers over functional vocabularies extending addition |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/1705.00290 |