From IF to BI. A tale of dependence and separation

DOI10.1007/S11229-008-9415-6zbMATH Open1175.03016DBLPjournals/synthese/AbramskyV09arXiv1102.1388OpenAlexW2153017713WikidataQ57006587 ScholiaQ57006587MaRDI QIDQ833040FDOQ833040

Authors: Samson Abramsky, Jouko Väänänen 

Publication date: 11 August 2009

Published in: Synthese (Search for Journal in Brave)

Abstract: We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Vaananen, and their compositional semantics due to Hodges. We show how Hodges' semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics is the logic of Bunched Implications due to Pym and O'Hearn, which combines intuitionistic and multiplicative connectives. This introduces several new connectives not previously considered in logics of informational dependence, but which we show play a very natural role, most notably intuitionistic implication. As regards the quantifiers, we show that their interpretation in the Hodges semantics is forced, in that they are the image under the general construction of the usual Tarski semantics; this implies that they are adjoints to substitution, and hence uniquely determined. As for the dependence predicate, we show that this is definable from a simpler predicate, of constancy or dependence on nothing. This makes essential use of the intuitionistic implication. The Armstrong axioms for functional dependence are then recovered as a standard set of axioms for intuitionistic implication. We also prove a full abstraction result in the style of Hodges, in which the intuitionistic implication plays a very natural r^ole.

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

Recommendations

• Dependence and independence
• Separation -- past, present, and future
• From the Monster to the bimonster
• scientific article; zbMATH DE number 1222325
• Publication:4938989
• Bipolarity and the relational division
• From bi-facial truth to bi-facial proofs

zbMATH Keywords

team semanticsindependence-friendly logicfull abstractiondependence logicfunctional dependencelogic of bunched implicationsbranching quantifiersquantifiers as adjointsTarski semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Cites Work

• Dependence logic. A new approach to independence friendly logic
• Compositional semantics for a language of imperfect information
• Title not available (Why is that?)
• LCF considered as a programming language
• Possible worlds and resources: The semantics of \(\mathbf{BI}\)
• The semantics and proof theory of the logic of bunched implications
• The Logic of Bunched Implications
• Title not available (Why is that?)
• Linear logic
• Combinatory logic. With two sections by William Craig.
• Some combinatorics of imperfect information
• Quantales and (noncommutative) linear logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Programming Languages and Systems
• Completeness in the theory of types
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functional Dependencies in a Relational Database and Propositional Logic
• On Extensions of Elementary Logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Adjointness in Foundations
• Semantics for relevant logics
• Fully abstract models of typed \(\lambda\)-calculi
• Second-Order Logic and Foundations of Mathematics
• Hyperclassical Logic (A.K.A. IF Logic) and Its Implications for Logical Theory
• Monoid based semantics for linear formulas

Cited In (40)

• Expressivity and Complexity of Dependence Logic
• A Multi-type Calculus for Inquisitive Logic
• Dependence and independence
• INQUISITIVE BISIMULATION
• Propositional logics of dependence
• Breaking the atom with Samson
• Questions as information types
• Compactness in team semantics
• Characterizing quantifier extensions of dependence logic
• Separation logic and logics with team semantics
• On intermediate inquisitive and dependence logics: an algebraic study
• Questions and dependency in intuitionistic logic
• Dependence logic with a majority quantifier
• Boolean dependence logic and partially-ordered connectives
• COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
• Esakia duals of regular Heyting algebras
• Compositionality in context
• Reductive logic, proof-search, and coalgebra: a perspective from resource semantics
• Hintikka's independence-friendly logic meets Nelson's realizability
• A simple logic of functional dependence
• Dimension in team semantics
• Epistemic operators in dependence logic
• General models and entailment semantics for independence logic
• Dependency as question entailment
• Complexity results for modal dependence logic
• Expressing second-order sentences in intuitionistic dependence logic
• Equilibrium semantics of languages of imperfect information
• Supervenience, dependence, disjunction
• AN ALGEBRAIC APPROACH TO INQUISITIVE AND -LOGICS
• Safe dependency atoms and possibility operators in team semantics
• Generalized quantifiers in dependence logic
• Bunched logics displayed
• On dependence logic
• Disjunction and existence properties in inquisitive first-order logic
• Coherence in inquisitive first-order logic
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• On strongly first-order dependencies
• Dynamic logics of imperfect information: from teams and games to transitions
• Doubly strongly first order dependencies
• Propositional team logics

This page was built for publication: From IF to BI. A tale of dependence and separation

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