A new distance function dist (A,B) for fuzzy sets A and B is introduced. It is based on the descriptive complexity, i.e., the number of bits (on average) that are needed to describe an element in the symmetric difference of the two sets. The distance gives the amount of additional information needed to describe any one of the two sets given the other. We prove its mathematical properties and pe...

Syntactic constraints in Koskenniemi's Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turns out that although the constraints in Voutilainen's (1994) FSIG description of English make use of several extensions to regular expressions, the description as a whole reduces to a finite combination of union, compleme...

0

This paper investigates the working-method of three important philosophers of explanation: Carl Hempel, Philip Kitcher and Wesley Salmon. We argue that they do three things: (i) construct an explication in the sense of Carnap, which then is used as a tool to make (ii) descriptive and (iii) normative claims about the explanatory practice of scientists. We also show that they did well with respec...

We investigate the conversion of one-way nondeterministic finite automata and context-free grammars into Parikh equivalent oneway and two-way deterministic finite automata, from a descriptional complexity point of view. We prove that for each one-way nondeterministic automaton with n states there exist Parikh equivalent one-way and two-way deterministic automata with e √ n·lnn) and p(n) states,...

The present study extends the previous research on the social influences on quitting by investigating inconsistencies between different types of social norms and their main and moderating effects on quitting intentions. The theory of planned behaviour (TPB) served as the theoretical framework. Social influences were operationalised by subjective quitting norm (significant others' expectations t...

A new approach is suggested under the slogan “Keep it Descriptive Stupid” (KIDS) that encapsulates a trend in increasingly descriptive agentbased social simulation. The KIDS approach entails one starts with the simulation model that relates to the target phenomena in the most straightforward way possible, taking into account the widest possible range of evidence, including anecdotal accounts an...

We propose a new descriptive complexity notion of uniformity for branching programs solving problems defined on structured data. We observe that FO[=]-uniform (n-way) branching programs are unable to solve the tree evaluation problem studied by Cook, McKenzie, Wehr, Braverman and Santhanam [8] because such programs possess a variant of their thriftiness property. Similarly, FO[=]-uniform (n-way...

ing from the terminological details of mediaeval semantics, Lambert’s rule requires that denotational terms in a present-tensed sentence denote the current satisfiers of their associated descriptive conditions, rather than past or future (or merely possible) such satisfiers. Later rules of the Summa Lamberti require denotational terms in pasttensed sentences to denote the past satisfiers of the...