In this paper it is argued that Hintikka’s game theoretical semantics for Independence Friendly logic does not formalize the intuitions about independent choices; it rather is a formalization of imperfect information. Furthermore it is shown that the logic has several strange properties (e.g. renaming of bound variables is not allowed). An alternative semantics is proposed which formalizes intu...

Several variants of a first-order simplification rule for nonnormal form tableaux using syntactic constraints are presented. These can be used as a framework for porting methods like unit resolution or hyper tableaux to non-normal form free variable tableaux.

An alternative approach to the semantics of definite descriptions was proposed by Heim in her dissertation [1982]. Heim assigns to pragmatics a larger part of the task of specifying the meaning of definite descriptions than the neo-Russellians do. In Heim’s theory, definite and indefinite NPs are semantically equivalent, and both introduce free variables. The truth conditions proposed by Heim f...

$

In this paper, I propose that the availability of a bound variable reading for pronouns is predictable from their morphological structure of the pronouns. More specifically I argue that noun-containing pronouns cannot be bound variables. My proposal is different from D&W's (2002) argument in that in their theory, every DPs cannot have a bound variable reading, while in my theory, even DPs can h...

Looking broadly at the central part of the Book of Revelation, one notices a very special concern with chronology. This central part of the text (Rev 11-13) describes events occurring during various periods of time, all of which appear to be of more or less the same duration and equivalent to three and a half years. Three different expressions of time are mentioned: 1260 days is found twice (at...

The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techniques. Functional decomposition is a powerful decomposition method that breaks a Boolean function into a set of subfunctions and a composition function. Little attention has so far been given to the problem of selecting good subfunctio...

ion over assignments (^) allows us to bring the free variable pronoun into the scope of the quantifier. The indefinite's translation contains a state (=assignment) switcher {x\d}. This effectively associates a free variable d with the indefinite, though unlike DRT, solely for binding purposes. When {x\d} is prefixed to a proposition p, it sets the discourse marker d in p to the value of x, the ...

Variables on which constraints are imposed incrementally can be said to carry \existential" force in the following sense. Under a translation, commonly used in analyzing natural language discourse, of rst-order formulas into programs from quantiied dynamic logic, such a variable is introduced (at the level of formulas) by an existential quantiier. The present paper extends that translation to s...