Axiomatizing first-order consequences in independence logic

DOI10.1016/J.APAL.2014.09.002zbMATH Open1343.03027arXiv1304.4164OpenAlexW2963823733MaRDI QIDQ466449FDOQ466449

Authors: Miika Hannula 

Publication date: 27 October 2014

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

Abstract: Independence logic cannot be effectively axiomatized. However, first-order consequences of independence logic sentences can be axiomatized. In this article we give an explicit axiomatization and prove that it is complete in this sense. The proof is a generalization of the similar result for dependence logic.

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

Recommendations

• Axiomatizing first-order consequences in dependence logic
• Axiomatizing first order consequences in inclusion logic
• Negation and partial axiomatizations of dependence and independence logic revisited
• Negation and partial axiomatizations of dependence and independence logic revisited
• Dependence logic with generalized quantifiers: axiomatizations

zbMATH Keywords

axiomatizationindependence logic

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic with extra quantifiers and operators (03C80) Proof theory in general (including proof-theoretic semantics) (03F03)

Cites Work

• Dependence and independence
• On the undecidability of implications between embedded multivalued database dependencies
• Dependence logic. A new approach to independence friendly logic
• Axiomatizing first-order consequences in dependence logic
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Title not available (Why is that?)
• A finite axiomatization of conditional independence and inclusion dependencies
• Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
• General models and entailment semantics for independence logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• A remark on negation in dependence logic
• Some applications of Henkin quantifiers
• An introduction to recursively saturated and resplendent models
• On dependence logic

Cited In (13)

• Expressivity and Complexity of Dependence Logic
• Propositional union closed team logics
• A finite axiomatization of conditional independence and inclusion dependencies
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
• Dependence and Independence in Social Choice: Arrow’s Theorem
• A logical approach to context-specific independence
• A Logical Approach to Context-Specific Independence
• Detection of First Order Axiomatic Theories
• Axiomatizing first-order consequences in dependence logic
• Axiomatizing first order consequences in inclusion logic
• Hilbert-style axiomatization of first-degree entailment and a family of its extensions
• Negation and partial axiomatizations of dependence and independence logic revisited

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

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