When possible worlds semantics arrived around 1960, one of its most charming features
was the discovery of simple connections between existing intensional axioms and ordinary …

Modern applications of logic, in mathematics, theoretical computer science, and linguistics,
require combined systems involving many different logics working together. In this book the …

The problems of representing, and working with, uncertain knowledge are ancient problems
dating, at least, from Leibnitz, and later explored by a number of distinguished scholars …

When possible worlds semantics arrived around 1960, one of its most charming features
was the discovery of simple connections between existing intensional axioms and ordinary …

Categorial grammar has traditionally used the λ-calculus to represent meaning. We present
an alternative, dependency-based perspective on linguistic meaning and situate it in the …

The complexity of any logical modeling reflects both the intrinsic structure of a topic
described and the weight of the formal tools. Some of this weight seems inherent in even the …

We expand first order models with a tolerance relation on thedomain. Intuitively, two
elements stand in this relation if they are “cognitively close” for the agent who holds the …

ABSTRACT A propositional temporal logic is introduced whose operators quantify over
intervals of a reference time line. The intervals are specified symbolically, for example 'next …

There is a quantifier scope ambiguity in (1). In addition to the preferred normal scope
reading paraphrased in (1ns), this sentence has the inverse scope reading paraphrased in …

We give a condensed survey of recent research on generalized quantifiers in logic,
linguistics and computer science, under the following headings: Logical definability and …