Coherence and Computational Complexity of Quantifier-free Dependence Logic Formulas

Authors:
Jarmo Kontinen
Affiliations:
, Bochum, Germany
Venue:
Studia Logica
Year:
2013

Citing 3
Cited 0

Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)

Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)
Dependence Logic: A New Approach to Independence Friendly Logic (London Mathematical Society Student Texts)

Dependence Logic: A New Approach to Independence Friendly Logic (London Mathematical Society Student Texts)
On Definability in Dependence Logic

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the computational complexity of the model checking problem for quantifier-free dependence logic $${(\mathcal{D})}$$ formulas. We characterize three thresholds in the complexity: logarithmic space (LOGSPACE), non-deterministic logarithmic space (NL) and non-deterministic polynomial time (NP).