2008
DOI: 10.1007/s11229-008-9415-6
|View full text |Cite
|
Sign up to set email alerts
|

From IF to BI

Abstract: We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

2
122
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 74 publications
(124 citation statements)
references
References 25 publications
2
122
0
Order By: Relevance
“…In the past decade, both areas of research have grown rapidly. 1 With the exception of Punčochář's work [20,23], discussed in Section 5, the research has focused on enriching existing systems of classical logic (propositional, modal, or first-order) with questions and dependence formulas. However, there is no a priori reason why investigating the logic of questions and dependency would require a commitment to an underlying classical logic of statements.…”
Section: Introductionmentioning
confidence: 99%
“…In the past decade, both areas of research have grown rapidly. 1 With the exception of Punčochář's work [20,23], discussed in Section 5, the research has focused on enriching existing systems of classical logic (propositional, modal, or first-order) with questions and dependence formulas. However, there is no a priori reason why investigating the logic of questions and dependency would require a commitment to an underlying classical logic of statements.…”
Section: Introductionmentioning
confidence: 99%
“…This yields a decomposition of these atoms into more basic and better-behaved operationswhich allows for a natural proof-theory. While the possibility of such a decomposition was noted by Abramsky and Väänänen (2009), the present work casts new light on this connection in several ways. First, we can now see that this decomposition reflects a fundamental connection between dependencies and questions: a dependency is a case of entailment having questions as its protagonists; since entailments can be internalized as implications, dependencies can be expressed as implications between questions.…”
Section: Dependence Logicmentioning
confidence: 63%
“…. ., S T x (α k ), S T x (β)) and the intuitionistic disjunction ∨ can both be defined in first-order dependence logic in terms of the other atoms and connectives 1…”
Section: Proofmentioning
confidence: 99%