Uniform definability in propositional dependence logic

Yang, F.

doi:10.1017/S1755020316000459

Uniform definability in propositional dependence logic

Title

Uniform definability in propositional dependence logic

Author

Yang, F. (TU Delft Ethics & Philosophy of Technology)

Date

2017

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.

Subject

compositionality
dependence logic
inquisitive logic
team semantics
uniform definability

To reference this document use:

http://resolver.tudelft.nl/uuid:4ab895c0-86fa-4baf-a787-1f8b69acaf6a

DOI

https://doi.org/10.1017/S1755020316000459

ISSN

1755-0203

Source

Review of Symbolic Logic, 10 (1), 65-79

Part of collection

Institutional Repository