UNIFORM DEFINABILITY IN PROPOSITIONAL DEPENDENCE LOGIC

Abstract

AbstractBoth 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.