Axiomatizing first-order consequences in dependence logic

DOI10.1016/J.APAL.2013.05.006MaRDI QIDQ388209zbMATH OpenOpenAlexFDO

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)

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

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)

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.

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

Cites work

• scientific article; zbMATH DE number 5853298 (Why is no real title available?)
• scientific article; zbMATH DE number 3464827 (Why is no real title available?)
• scientific article; zbMATH DE number 3482333 (Why is no real title available?)
• scientific article; zbMATH DE number 1086489 (Why is no real title available?)
• scientific article; zbMATH DE number 3250593 (Why is no real title available?)
• scientific article; zbMATH DE number 972408 (Why is no real title available?)
• An introduction to recursively saturated and resplendent models
• Compositional semantics for a language of imperfect information
• Dependence and independence
• Dependence logic. A new approach to independence friendly logic
• General models and entailment semantics for independence logic
• Hierarchies in Dependence Logic
• Some applications of Henkin quantifiers

Cited in

(20)

• Propositional logics of dependence
• Context-specific and local independence in Markovian dependence structures
• Breaking the atom with Samson
• Strongly first order, domain independent dependencies: the union-closed case
• A finite axiomatization of conditional independence and inclusion dependencies
• Boolean dependence logic and partially-ordered connectives
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Dependence logic with generalized quantifiers: axiomatizations
• COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
• 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
• Axiomatizing first-order consequences in independence logic
• On dependence 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)