Coherence and computational complexity of quantifier-free dependence logic formulas

DOI10.1007/s11225-013-9481-8zbMath1283.03065MaRDI QIDQ1956380

Jarmo Kontinen

Publication date: 13 June 2013

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: http://www.illc.uva.nl/dependence/proceedings.pdf

zbMATH Keywords

complexity; computational complexity; coherence; model checking; logic; dependence; team; quantifier-free dependence logic

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Unnamed Item, CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES, Expressivity and Complexity of Dependence Logic, Complexity thresholds in inclusion logic, COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES, Upwards closed dependencies in team semantics, Approximation and dependence via multiteam semantics, Expressivity of imperfect information logics without identity, Complexity of syntactical tree fragments of independence-friendly logic, A parameterized view on the complexity of dependence logic, Coherence in inquisitive first-order logic, Separation logic and logics with team semantics, Embedding causal team languages into predicate logic, Boolean dependence logic and partially-ordered connectives

Cites Work

• Finite model theory and its applications.
• On definability in dependence logic
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item