Uniform definability in propositional dependence logic

Fan Yang*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

4 Citations (Scopus)
27 Downloads (Pure)


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 languageEnglish
Pages (from-to)65-79
Number of pages15
JournalReview of Symbolic Logic
Issue number1
Publication statusPublished - 2017


  • compositionality
  • dependence logic
  • inquisitive logic
  • team semantics
  • uniform definability


Dive into the research topics of 'Uniform definability in propositional dependence logic'. Together they form a unique fingerprint.

Cite this