In the formal study of security protocols and access control systems, fragments of intuitionistic logic play a vital role. These are required to be efficient, and are typically disjunction-free. In this paper, we study the complexity of adding disjunction to these subsystems. Our lower bound results show that very little needs to be added to disjunction to get co-NP-hardness, while our upper bo...

A sample of 100 trisomy 18 conceptuses analysed separately and together with a published sample of 61 conceptuses confirms that an error in maternal meiosis II (MII) is the most frequent cause of non-disjunction for chromosome 18. This is unlike all other human trisomies that have been studied, which show a higher frequency in maternal meiosis I (MI). Maternal MI trisomy 18 shows a low frequenc...

The generalized conjunction/disjunction function (GCD) is a continuous logic function of two or more variables that integrates conjunctive and disjunctive properties in a single function. It is used as a mathematical model of simultaneity and replaceability of inputs. Special cases of this function include the full (pure) conjunction, the partial conjunction, the arithmetic mean, the partial di...

The partial conjunction/disjunction function (PCD) integrates conjunctive and disjunctive features in a single function. Special cases of this function include the pure conjunction, the pure disjunction, and the arithmetic mean. PCD enables a continuous transition from the pure conjunction to the pure disjunction, using a parameter that specifies a desired level of conjunction (andness) or disj...

In Japanese a certain kind of phrase, which Kuroda (1965) calls "indetenninate", can function as a wh-phrase, existential quantifier or universal quantifier depending on context and the use of particles. I argue that "indetenninates" are contrastive-focused, and that the meanings of existential and universal quantifiers are made of (in)finite application of disjunction ("ka") and conjunction ("...

In this paper we define a class of nested logic programs, nested logic programs with ordered disjunction (LPODs), which allows to specify qualitative preferences by means of nested preference expressions. For doing this we extend the syntax of logic programs with ordered disjunction (LPODs) to capture more general expressions. We define the LPODs semantics in a simple way and we extend most of ...

In this extended commentary I discuss the problem of how to account for “conjunctive” readings of some sentences with embedded disjunctions for globalist analyses of conversational implicatures. Following Franke (2010, 2009), I suggest that earlier proposals failed, because they did not take into account the interactive reasoning of what else the speaker could have said, and how else the hearer...