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...

Full description

Bibliographic Details

Main Authors:	Manfred Kufleitner, Tobias Walter
Format:	Default Article
Published:	2015
Subjects:	Theory of computation not elsewhere classified Other information and computing sciences not elsewhere classified untagged Computation Theory and Mathematics Information and Computing Sciences not elsewhere classified
Online Access:	https://hdl.handle.net/2134/31955
Tags:	Add Tag No Tags, Be the first to tag this record!