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 runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Our work is based on tracematches, an extension to AspectJ, which allows programmers to specify traces via regular expressions with free variables. In this paper we present a staged static analysis which speeds up trace matching by reducing the required runtime instru...