One quantifier alternation in first-order logic with modular predicates
© 2015 EDP Sciences. Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[ < , MOD] with order comparison x < y and predicates for x ≡ i mod n has been investigated by Barrington et al. The study of FO[ < , MOD]-fragments was initi...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Default Article |
| Published: |
2015
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/31955 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|