From IF to BI. A tale of dependence and separation
From MaRDI portal
(Redirected from Publication:833040)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 3148408 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 1196690 (Why is no real title available?)
- scientific article; zbMATH DE number 1078592 (Why is no real title available?)
- scientific article; zbMATH DE number 1086489 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 3335235 (Why is no real title available?)
- scientific article; zbMATH DE number 3196255 (Why is no real title available?)
- Adjointness in Foundations
- Combinatory logic. With two sections by William Craig.
- Completeness in the theory of types
- Compositional semantics for a language of imperfect information
- Dependence logic. A new approach to independence friendly logic
- Fully abstract models of typed \(\lambda\)-calculi
- Functional Dependencies in a Relational Database and Propositional Logic
- Hyperclassical Logic (A.K.A. IF Logic) and Its Implications for Logical Theory
- LCF considered as a programming language
- Linear logic
- Monoid based semantics for linear formulas
- On Extensions of Elementary Logic
- Possible worlds and resources: The semantics of \(\mathbf{BI}\)
- Programming Languages and Systems
- Quantales and (noncommutative) linear logic
- Second-Order Logic and Foundations of Mathematics
- Semantics for relevant logics
- Some combinatorics of imperfect information
- The Logic of Bunched Implications
- The semantics and proof theory of the logic of bunched implications
Cited in
(40)- Expressivity and Complexity of Dependence Logic
- A Multi-type Calculus for Inquisitive Logic
- Dependence and independence
- Propositional logics of dependence
- INQUISITIVE BISIMULATION
- 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
- Dependence logic with a majority quantifier
- On intermediate inquisitive and dependence logics: an algebraic study
- Questions and dependency in intuitionistic logic
- Boolean dependence logic and partially-ordered connectives
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
- Hintikka's independence-friendly logic meets Nelson's realizability
- A simple logic of functional dependence
- Esakia duals of regular Heyting algebras
- Compositionality in context
- Reductive logic, proof-search, and coalgebra: a perspective from resource semantics
- Dimension in team semantics
- Epistemic operators in dependence logic
- General models and entailment semantics for independence logic
- Complexity results for modal dependence logic
- Expressing second-order sentences in intuitionistic dependence logic
- Dependency as question entailment
- 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
- Disjunction and existence properties in inquisitive first-order logic
- On dependence 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)
