research

Uniform Definability in Propositional Dependence Logic

Abstract

Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula 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 (non-compositional) translation exists, neither intuitionistic disjunction nor intuitionistic implication is uniformly definable in propositional dependence logic

    Similar works

    Full text

    thumbnail-image

    Available Versions

    Last time updated on 23/10/2017