Hierarchies in inclusion logic with lax semantics

2014/01/14 by Miika Hannula, Hannula, Miika
Computer Science · Mathematics · #03C80 #F.4.1 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #acm:03C80 #cs.LO #math.LO #msc:03C80

paper · pdf · doi:10.48550/arxiv.1401.3235

arxiv created 2014/01/14 · arxiv updated 2014/01/15

Abstract

We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case of universal quantifiers, the corresponding hierarchy collapses at the first level. Arity hierarchy is shown to be strict by relating the question to the study of arity hierarchies in fixed point logics.

Related

• Hierarchies in independence logic
• Hierarchies in independence and inclusion logic with strict semantics
• Inclusion Logic and Fixed Point Logic
• Complexity Thresholds in Inclusion Logic
• Expressibility and inexpressibility in propositional team logics