2000 character limit reached
Hierarchies in Dependence Logic (1105.3324v1)
Published 17 May 2011 in cs.LO
Abstract: We study fragments of dependence logic defined either by restricting the number k of universal quantifiers or the width of dependence atoms in formulas. We find the sublogics of existential second-order logic corresponding to these fragments of dependence logic. We also show that these both ways of defining fragments of dependence logic give rise to a hierarchy in expressive power with respect to k.