Axiomatizing first-order consequences in dependence logic

DOI10.1016/J.APAL.2013.05.006zbMATH Open1315.03062arXiv1208.0176OpenAlexW2963371301MaRDI QIDQ388209FDOQ388209

Authors: Juha Kontinen, Jouko Väänänen 

Publication date: 19 December 2013

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Abstract: Dependence logic, introduced in [8], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the respective Completeness Theorem.

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

Recommendations

• Axiomatizing first-order consequences in independence logic
• Axiomatizing first order consequences in inclusion logic
• Axiomatizing propositional dependence logics
• Logical consequence and first-order soundness and completeness: a bottom up approach
• Axiomatization of a Denotational Semantics for First-order Logic
• First-order theories of abstract dependence relations
• Dependence logic with generalized quantifiers: axiomatizations
• Dependence logic with generalized quantifiers: axiomatizations
• On first-order conditional logics
• scientific article; zbMATH DE number 589741

zbMATH Keywords

independence-friendly logicnatural deductiondependence logicgame logicindependence logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic with extra quantifiers and operators (03C80) Database theory (68P15) Second- and higher-order model theory (03C85)

Cites Work

• Dependence and independence
• Dependence logic. A new approach to independence friendly logic
• Compositional semantics for a language of imperfect information
• Title not available (Why is that?)
• General models and entailment semantics for independence logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some applications of Henkin quantifiers
• Hierarchies in Dependence Logic
• Title not available (Why is that?)
• An introduction to recursively saturated and resplendent models
• Title not available (Why is that?)

Cited In (20)

• Context-specific and local independence in Markovian dependence structures
• Propositional logics of dependence
• Breaking the atom with Samson
• Strongly first order, domain independent dependencies: the union-closed case
• A finite axiomatization of conditional independence and inclusion dependencies
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Boolean dependence logic and partially-ordered connectives
• COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
• Dependence logic with generalized quantifiers: axiomatizations
• Axiomatizations of team logics
• A sound and complete axiomatization of embedded cross dependencies
• Dependence and Independence in Social Choice: Arrow’s Theorem
• A logical approach to context-specific independence
• A Logical Approach to Context-Specific Independence
• Axiomatization of a Denotational Semantics for First-order Logic
• Dependence logic with generalized quantifiers: axiomatizations
• On dependence logic
• Axiomatizing first-order consequences in independence logic
• Axiomatizing first order consequences in inclusion logic
• Hilbert-style axiomatization of first-degree entailment and a family of its extensions

This page was built for publication: Axiomatizing first-order consequences in dependence logic

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