We show finite model property, disjunction property and decidability for an intuitionistic epistemic logic IEC. Intuitionistic logic is originally a formalisation of a single mathematician whose knowledge increases over time. The logic IEC formalises multiple agents that communicate asynchronously and whose knowledge increases over time. Although soundness and strong completeness for IEC for a ...

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) transl...

We introduce λμ→∧∨⊥, an extension of Parigot’s λμ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutative conversions related to disjunction, is Church-Rosser, strongly normalizing, and such that the normal deductions satisfy the subformula property. From a computer science point of view, λμ→∧∨⊥ may be seen as the core of a typed cbn...

This paper contributes to two recent lines of work on disjunction: on the one hand, work on so-called Hurford disjunctions, i.e., disjunctions where one disjunct entails another, and on the other hand, work in alternative and inquisitive semantics where disjunction has been argued to generate multiple propositional alternatives. We point out that Hurford effects are found not only in disjunctiv...

HE distributive pairing hypothesis of GRELL (1962) aims to elucidate the Tmechanisms involved in chromosome pairing, exchange, and disjunction at meiosis in the female of Drosophila melanogaster. It provides a new interpretation of meiosis which can account for many of the seemingly contradictory reports on chromosome behaviour made by earlier authors. Former ideas on the nature of pairing and ...