Structural completeness in propositional logics of dependence

DOI10.1007/S00153-016-0505-8MaRDI QIDQ334998zbMATH OpenOpenAlexFDO

Authors Rosalie Iemhoff, Fan Yang

Publication date 1 November 2016

Published in Archive for Mathematical Logic (Search for Journal in Brave)

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

zbMATH Keywords

dependence logicinquisitive logicstructural completenesspropositional logicadmissible ruleinference rule

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Intermediate logics (03B55)

Abstract: In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of substitutions under which the logics are closed. We obtain an analogues result with respect to stable substitutions, for the negative variants of some well-known intermediate logics, which are intermediate theories that are closely related to inquisitive logic.

Recommendations

• Propositional logics of dependence
• scientific article; zbMATH DE number 2108194
• Axiomatizing propositional dependence logics
• Logics for propositional determinacy and independence
• Structural Completeness in Substructural Logics

Cites work

• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 1196690 (Why is no real title available?)
• scientific article; zbMATH DE number 1086489 (Why is no real title available?)
• scientific article; zbMATH DE number 4118333 (Why is no real title available?)
• scientific article; zbMATH DE number 2108198 (Why is no real title available?)
• scientific article; zbMATH DE number 3196255 (Why is no real title available?)
• A double team semantics for generalized quantifiers
• A remark on Henkin sentences and their contraries
• A remark on negation in dependence logic
• Admissibility of logical inference rules
• Admissible Rules of Modal Logics
• Admissible rules: from characterizations to applications
• Axiomatizing propositional dependence logics
• Complexity results for modal dependence logic
• Compositional semantics for a language of imperfect information
• Consequence relations and admissible rules
• Dependence logic. A new approach to independence friendly logic
• Dependency as question entailment
• Extended modal dependence logic \(\mathcal{EMDL}\)
• Inquisitive logic
• On the admissible rules of intuitionistic propositional logic
• Propositional logics of dependence
• Some results on intermediate constructive logics
• The expressive power of modal dependence logic
• Unification in intuitionistic logic

Cited in

(17)

• Inquisitive split and structural completeness
• Propositional logics of dependence
• Structural completeness in fuzzy logics
• Lattices of Intermediate Theories via Ruitenburg's Theorem
• Structural completeness in relevance logics
• scientific article; zbMATH DE number 3557785 (Why is no real title available?)
• Propositional union closed team logics
• Uniform definability in propositional dependence logic
• On the complexity of linear temporal logic with team semantics
• A sound and complete axiomatization of embedded cross dependencies
• Inquisitive Heyting algebras
• Tarskian Structured Consequence Relations and Functional Completeness
• Embedding causal team languages into predicate logic
• Some Completeness Results for Propositional Conditional Logics
• scientific article; zbMATH DE number 4008369 (Why is no real title available?)
• Structural completeness and superintuitionistic inquisitive logics
• Propositional team logics

This page was built for publication: Structural completeness in propositional logics of dependence

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