In this paper I propose a unified account of two phenomena that have so far only been treated independently of each other: (I.) the strong tendency of German demonstrative pronouns (henceforth: D-pronouns or DEM) like der and die to be resolved to antecedents that have not been maximally salient in the preceding sentence, and (II.) the fact that D-pronouns cannot be interpreted as syntactically...

A generic tableau prover has been implemented and integrated with Isabelle [Paulson, 1994]. Compared with classical rst-order logic provers, it has numerous extensions that allow it to reason with any supplied set of tableau rules. It has a higherorder syntax in order to support user-de ned binding operators, such as those of set theory. The uni cation algorithm is rst-order instead of higher-o...

The main contribution of this work is twofold. It presents a modular tableau calculus, in the free-variable style, treating the main domain variants of quantified modal logic and dealing with languages where rigid and non-rigid designation can coexist. The calculus uses, to this end, light and simple semantical annotations. Such a general proof-system results from the fusion into a unified fram...

We analyse the problem of constructing a deterministic proof procedure for free variable clausal tableaux that performs depth-first proof search without backtracking; and we present a solution based on a fairness strategy. That strategy uses weight orderings and a notion of tableau subsumption to avoid proof cycles and it employs reconstruction steps to handle the destructiveness of free variab...

For conventional logic institutions, when one extends the sentences to contain open sentences, their satisfaction is then parameterized. For instance, in the first-order logic, the satisfaction is parameterized by the valuation of unbound variables, while in modal logics it is further by possible worlds. This paper proposes a uniform treatment of such parameterization of the satisfaction relati...

Although induction is omnipresent, inductive theorem proving in the form of descente infinie has not yet been integrated into full first-order deductive calculi. We present such an integration that even works for higher-order logic. This integration is based on lemma and induction hypothesis application for free variable sequent and tableau calculi. We discuss the appropriateness of these types...

This extended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality. Two variables are called independent when it is sound to instantiate them differently. The goal of the uniform variable splitting technique, first presented in [14], is to label variables differently (modulo a set of equations) exactly whe...

Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper tableaux are a generalization of hyper tableaux, where branch closing substitutions, from the point of view of model generation, give rise to constraints on satisfying assignments for the branch. These variable constraints...