Craig interpolation for semilinear substructural logics

The Craig interpolation property is investigated for substructural logics whose algebraic semantics are varieties of semilinear (subdirect products of linearly ordered) pointed commutative residuated lattices. It is shown that Craig interpolation fails for certain classes of these logics with weakening if the corresponding algebras are not idempotent. A complete characterization is then given of axiomatic extensions of the “R‐mingle with unit” logic (corresponding to varieties of Sugihara monoids) that have the Craig interpolation property. This latter characterization is obtained using a model‐theoretic quantifier elimination strategy to determine the varieties of Sugihara monoids admitting the amalgamation property.     

关于BCI逻辑的一种偏序代数

通常,人们认为Kiyoshi Iséki在20世纪60年代引入的BCI-代数是组合逻辑中BCI逻辑的代数对等物。然而这种广为人知的断言却是有问题的,因为BCI逻辑关于BCI代数是不完备的。在本文中,我们引入一种称为MPE的偏序代数。在MPE中的每个不等式对应BCI逻辑中的一个重言式且反之亦然,从而MPE代数是与BCI逻辑完备的代数类。     

On n ‐contractive fuzzy logics

It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w. r. t. the class of all finite MTL‐chains. In order to reach a deeper understanding of the structure of this class, we consider the extensions of MTL by adding the generalized contraction since each finite MTL‐chain satisfies a form of this generalized contraction. Simultaneously, we also consider extensions of MTL by the generalized excluded middle laws introduced in [9] and the axiom of weak cancellation defined in [31]. The algebraic counterpart of these logics is studied characterizing the subdirectly irreducible, the semisimple, and the simple algebras. Finally, some important algebraic and logical properties of the considered logics are discussed: local finiteness, finite embeddability property, finite model property, decidability, and standard completeness. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Sequent calculi for branching time temporal logics of knowledge and beliefwith awareness: Completeness and decidability

In this paper, we consider branching time temporal logic CT L with epistemic modalities for knowledge (belief) and with awareness operators. These logics involve the discrete-time linear temporal logic operators “next” and “until” with the branching temporal logic operator “on all paths”. In addition, the temporal logic of knowledge (belief) contains an indexed set of unary modal operators “agent i knows” (“agent i believes”). In a language of these logics, there are awareness operators. For these logics, we present sequent calculi with a restricted cut rule. Thus, we get proof systems where proof-search becomes decidable. The soundness and completeness for these calculi are proved. Published in Lietuvos Matematikos Rinkinys, Vol. 47, No. 3, pp. 328–340, July–September, 2007.     

Clausal resolution for normal modal logics

We present a clausal resolution-based method for normal modal logics. Differently from other approaches, where inference rules are based on the syntax of a particular set of axioms, we focus on the restrictions imposed on the binary accessibility relation for each particular normal logic. We provide soundness and completeness results for all fifteen families of multi-modal normal logics whose accessibility relations have the property of being non-restricted, reflexive, serial, transitive, Euclidean, or symmetric.     

A normal form which preserves tautologies and contradictions in a class of fuzzy logics

Most of the normal forms for fuzzy logics are versions of conjunctive and disjunctive classical normal forms. Unfortunately, they do not always preserve tautologies and contradictions which is important, for example, for automated theorem provers based on refutation methods.De Morgan implicative systems are triples like the De Morgan systems, which consider fuzzy implications instead of t-conorms. These systems can be used to evaluate the formulas of a propositional language based on the logical connectives of negation, conjunction and implication. Therefore, they determine different fuzzy logics, called implicative De Morgan fuzzy logics.In this paper, we will introduce a normal form for implicative De Morgan systems and we will show that for implicative De Morgan fuzzy logics whose t-norms are strict, this normal form preserves contradictions as well as tautologies.     

The finite model property for semilinear substructural logics

In this paper, we show that the finite model property fails for certain non‐integral semilinear substructural logics including Metcalfe and Montagna's uninorm logic and involutive uninorm logic, and a suitable extension of Metcalfe, Olivetti and Gabbay's pseudo‐uninorm logic. Algebraically, the results show that certain classes of bounded residuated lattices that are generated as varieties by their linearly ordered members are not generated as varieties by their finite members.     

Model-Theoretic Investigations into Consequence Operation (Cn) in Quantum Logics: An Algebraic Approach

In this paper, we present the fundamentals of the so-called algebraic approach to propositional quantum logics. We define the set of formulae describing quantum reality as a free algebra freely generated by the set of quantum proportional variables. We define the general notion of logic as a structural consequence operation. Next, we introduce the concept of logical matrices understood as a model of quantum logics. We give the definitions of two quantum consequence operations defined in these models.     

Weighted logics for artificial intelligence – an introductory discussion

Before presenting the contents of the special issue, we propose a structured introductory overview of a landscape of the weighted logics (in a general sense) that can be found in the Artificial Intelligence literature, highlighting their fundamental differences and their application areas.