Oct 9, 2019 · Logics based on team semantics, such as inquisitive logic and dependence logic, are not closed under uniform substitution.

In fact, we show that extending the logical repertoire of inquisitive logic by means of tensor disjunction leads to an independent set of connectives; that is,.

A question that has been open for some time in this area is whether the tensor disjunction used in propositional dependence logic is definable in inquisitive ...

Oct 18, 2019 · Logics based on team semantics, such as inquisitive logic and dependence logic, are not closed under uniform substitution.

In fact, we show that extending the logical repertoire of inquisitive logic by means of tensor disjunction leads to an independent set of connectives; that is,.

A question that has been open for some time in this area is whether the tensor disjunction used in propositional dependence logic is definable in inquisitive ...

Oct 18, 2019 · Logics based on team semantics, such as inquisitive logic and dependence logic, are not closed under uniform substitution.

A question that has been open for some time in this area is whether the tensor disjunction used in propositional dependence logic is definable in inquisitive ...

Undefinability in Inquisitive Logic with Tensor · List of references · Publications that cite this publication.

Undefinability in Inquisitive Logic with Tensor. I. Ciardelli, and F. Barbero. LORI, volume 11813 of Lecture Notes in Computer Science, page 29-42.