Hierarchies in independence and inclusion logic with strict semantics

From MaRDI portal
Publication:5262488

DOI10.1093/LOGCOM/EXU057zbMATH Open1345.03051arXiv1401.3232OpenAlexW2964104541MaRDI QIDQ5262488FDOQ5262488


Authors: Miika Hannula, Juha Kontinen Edit this on Wikidata


Publication date: 15 July 2015

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Abstract: We study the expressive power of fragments of inclusion and independence logic defined by restricting the number k of universal quantifiers in formulas. Assuming the so-called strict semantics for these logics, we relate these fragments of inclusion and independence logic to sublogics ESO_f(kforall) of existential second-order logic, which in turn are known to capture the complexity classes NTIME_{RAM}(n^k).


Full work available at URL: https://arxiv.org/abs/1401.3232




Recommendations





Cited In (17)





This page was built for publication: Hierarchies in independence and inclusion logic with strict semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262488)