From IF to BI. A tale of dependence and separation

DOI10.1007/s11229-008-9415-6zbMath1175.03016arXiv1102.1388OpenAlexW2153017713WikidataQ57006587 ScholiaQ57006587MaRDI QIDQ833040

Samson Abramsky, Jouko Väänänen

Publication date: 11 August 2009

Published in: Synthese (Search for Journal in Brave)

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

zbMATH Keywords

independence-friendly logicfunctional dependencefull abstractiondependence logicteam semanticslogic of bunched implicationsbranching quantifiersquantifiers as adjointsTarski semantics

Mathematics Subject Classification ID

Other nonclassical logic (03B60)

Related Items

Boolean dependence logic and partially-ordered connectives ⋮ Propositional logics of dependence ⋮ AN ALGEBRAIC APPROACH TO INQUISITIVE AND -LOGICS ⋮ Dependence logic with a majority quantifier ⋮ Doubly strongly first order dependencies ⋮ Hintikka's independence-friendly logic meets Nelson's realizability ⋮ Coherence in inquisitive first-order logic ⋮ Separation logic and logics with team semantics ⋮ On intermediate inquisitive and dependence logics: an algebraic study ⋮ Questions and dependency in intuitionistic logic ⋮ Bunched logics displayed ⋮ COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES ⋮ Esakia duals of regular Heyting algebras ⋮ Equilibrium semantics of languages of imperfect information ⋮ General models and entailment semantics for independence logic ⋮ Questions as information types ⋮ Expressing second-order sentences in intuitionistic dependence logic ⋮ Epistemic operators in dependence logic ⋮ Complexity results for modal dependence logic ⋮ Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information ⋮ Transition semantics: the dynamics of dependence logic ⋮ Dynamic Logics of Imperfect Information: From Teams and Games to Transitions ⋮ A simple logic of functional dependence ⋮ Characterizing quantifier extensions of dependence logic ⋮ Propositional team logics ⋮ Generalized quantifiers in dependence logic ⋮ Breaking the Atom with Samson ⋮ Negation and partial axiomatizations of dependence and independence logic revisited ⋮ Disjunction and existence properties in inquisitive first-order logic ⋮ Safe dependency atoms and possibility operators in team semantics ⋮ Expressivity and Complexity of Dependence Logic ⋮ On Strongly First-Order Dependencies ⋮ Dependency as Question Entailment ⋮ Supervenience, Dependence, Disjunction ⋮ A Multi-type Calculus for Inquisitive Logic ⋮ INQUISITIVE BISIMULATION ⋮ On Dependence Logic

Cites Work

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