Several authors have pointed out some limitations inherent in Montague's approach to naturallanguage representation, and have attempted to remedy these limitations by working out suitable extensions of the Montague formalism. One of these limitations originates from the fact that logical connectives and modal operators can only be applied to formulae and not to arbitrary logical expressions, wh...

We introduce distributive unimodal logic as a modal logic of binary relations over posets which naturally generalizes the classical modal logic of binary relations over sets. The relational semantics of this logic is similar to the relational semantics of intuitionistic modal logic and positive modal logic, but it generalizes both of these by placing no restrictions on the accessibility relatio...

DEFINITION The term “temporal logic” is used, in the area of formal logic, to describe systems for representing and reasoning about propositions and predicates whose truth depends on time. These systems are developed around a set of temporal connectives, such as sometime in the future or until, that provide implicit references to time instants. First-order temporal logic is a variant of tempora...

A many-valued modal logic is introduced that combines the standard (crisp) Kripke frame semantics of the modal logic K with connectives interpreted locally as abelian group operations over the real numbers. A labelled tableau system and a sequent calculus admitting cut elimination are then defined for this logic and used to establish completeness of an axiomatic extension of the multiplicative ...

A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identifying quantum models with superpositions of classical models. This novel approach to quantum logic is completely different from the traditional approach of Birkhoff and von Neumann. It has the advantage of making quantum logic ...

In this paper we consider the class of truth-functional many-valued logics with a finite set of truth-values. The main result of this paper is the development of a new binary sequent calculi (each sequent is a pair of formulae) for many valued logic with a finite set of truth values, and of Kripke-like semantics for it that is both sound and complete. We did not use the logic entailment based o...

A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is provided and a coNEXPTIME upper bound obtained for checking validity in the logic. Focussing on the modal-multiplicative fragment, the labelled tableau system...

A structural semantics is developed for a first-order logic, with infinite disjunctions and conjunctions, that is characterised algebraically by quantales. The model structures involved combine the “covering systems” approach of Kripke-Joyal intuitionistic semantics from topos theory with the ordered groupoid structures used to model various connectives in substructural logics. The latter are u...

After recalling the definitions of atomic and molecular logics, we show how notions bisimulation can be automatically defined from truth conditions connectives any these logics. Then, prove a generalization van Benthem modal characterization theorem for Our should uniform contain all conjunctions disjunctions. We use logic, Lambek calculus intuitionistic logic as case study compare in particula...

We propose a new version of formula size game for modal logic. The game characterizes the equivalence of pointed Kripke-models up to formulas of given numbers of modal operators and binary connectives. Our game is similar to the well-known Adler-Immerman game. However, due to a crucial difference in the definition of positions of the game, its winning condition is simpler, and the second player...