We investigate the indenti ability in the limit of subclasses of generalized quanti ers de nable in Presburger arithmetic.

The aim of this paper is to study the n-variable fragment of rst order logic from a modal perspective. We deene a modal formalism called cylindric mirror modal logic, and show how it is a modal version of rst order logic with substitution. In this approach, we can deene a semantics for the language which is closely related to algebraic logic, as we nd Polyadic Equality Algebras as the modal or ...

Whenever we have data represented by constraints (such as order, linear, polynomial, etc.), running time for many constraint processing algorithms can be considerably lowered if it is known that certain variables in those constraints are independent of each other. For example, when one deals with spatial and temporal databases given by constraints, the projection operation, which corresponds to...

Hybrid logics were proposed in [15] as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as formulae. In addition, hybrid logics may contain quanti ers to bind the labels. Thus, hybrid logics have both Kripke semantics and a rst-order binding apparatus. We present pre xed tableau calculi for weak hybrid l...

This paper sets out a philosophical interpretation of the model theory in Mares and Goldblatt “An Alternative Semantics for Quanti…ed Relevant Logic” (The Journal of Symbolic Logic 71 (2006)). This interpretation distinguishes between truth conditions and information conditions. Whereas the usual Tarskian truth condition holds for universally quanti…ed statements, their information condition is...

One of the distinguishing features of Standard ML is the use of type generativity. Each declaration of a datatype binds a globally fresh type name to the type identiier introduced. Type generativity has been regarded as an extra-logical device which, though desirable in a programming language to ensure data abstraction, bears no close resemblance to type theoretic constructs. We show that it co...

1 Quantiiers as Modal Operators 1.1 Motivations The semantics for quantiiers described in this paper can be viewed both as a new semantics for generalized quantiiers and as a new look at standard rst-order quantiication, bringing the latter closer to modal logic. The standard semantics for generalized quantiiers interprets a monadic generalized quantiier Q as a set of subsets of a domain. For e...