Computer Science – Logic in Computer Science
Scientific paper
2011-05-17
Computer Science
Logic in Computer Science
21 pages
Scientific paper
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.
Durand Arnaud
Kontinen Juha
No associations
LandOfFree
Hierarchies in Dependence Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Hierarchies in Dependence Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hierarchies in Dependence Logic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-727724