Abstract
Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of propositional dependence logic without these two connectives. We show that although such a (noncompositional) translation exists, neither intuitionistic disjunction nor intuitionistic implication is uniformly definable in propositional dependence logic.
Original language | English |
---|---|
Pages (from-to) | 65-79 |
Number of pages | 15 |
Journal | Review of Symbolic Logic |
Volume | 10 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2017 |
Keywords
- compositionality
- dependence logic
- inquisitive logic
- team semantics
- uniform definability