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)     

Polymodal Lattices and Polymodal Logic

A polymodal lattice is a distributive lattice carrying an n-place operator preserving top elements and certain finite meets. After exploring some of the basic properties of such structures, we investigate their freely generated instances and apply the results to the corresponding logical systems — polymodal logics — which constitute natural generalizations of the usual systems of modal logic familiar from the literature. We conclude by formulating an extension of Kripke semantics to classical polymodal logic and proving soundness and completeness theorems. Mathematics Subject Classification: 03G10, 06D99, 03B45.     

Residuated Structures,Concentric Sums and Finiteness Conditions

This article is motivated by a concern with finiteness conditions on varieties of residuated structures—particularly residuated meet semilattice-ordered commutative monoids. A “concentric sum” construction is developed and is used to prove, among other results, a local finiteness theorem for a class that encompasses all n-potent hoops and all idempotent subdirect products of residuated chains. This in turn implies that a range of residuated lattice-based varieties have the finite embeddability property, whence their quasi-equational theories are decidable. Applications to substructural logics are discussed.     

On non‐compact logics in NEXT(KTB)

In this paper we construct a continuum of logics, extensions of the modal logic T₂ = KTB ⊕ □²p → □³p, which are non‐compact (relative to Kripke frames) and hence Kripke incomplete. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the predicate logics of continuous t-norm BL-algebras

Given a class C of t-norm BL-algebras, one may wonder which is the complexity of the set Taut(C) of predicate formulas which are valid in any algebra in C. We first characterize the classes C for which Taut(C) is recursively axiomatizable, and we show that this is the case iff C only consists of the Gödel algebra on [0,1]. We then prove that in all cases except from a finite number Taut(C) is not even arithmetical. Finally we consider predicate monadic logics Taut_M(C) of classes C of t-norm BL-algebras, and we prove that (possibly with finitely many exceptions) they are undecidable.Mathematics Subject Classification (2000): Primary: 03B50, Secondary: 03B47Acknowledgement The author is deeply indebted to Petr Hájek, whose results about the complexity problems of predicate fuzzy logics constitute the main motivation for this paper, and whose suggestions and remarks have been always stimulating. He is also indebted to Matthias Baaz, who pointed out to him a method used in [BCF] for the case of monadic Gödel logic which works with some modifications also in the case of monadic BL logic.     

Separability of normalizable superintuitionistic propositional logics

The problem of separability of superintuitionistic propositional logics that are extensions of the intuitionistic propositional logic is studied. A criterion of separability of normal superintuitionistic propositional logics, as well as results concerning the completeness of their subcalculi is obtained. This criterion makes it possible to determine whether a normalizable superintuitionistic propositional logic is separable. By means of these results, the mistakes discovered by the author in the proofs of certain statements by McKay and Hosoi are corrected.Translated fromMatematicheskie Zametki, Vol. 64, No. 4, pp. 606–615, October, 1998.This research was supported by the Russian Foundation for Basic Research under grant No. 94-01-00944.     

The lattice of extensions of the minimal logic

In this article, we survey the results on the lattice of extensions of the minimal logic Lj, a paraconsistent analog of the intuitionistic logic Li. Unlike the well-studied classes of explosive logics, the class of extensions of the minimal logic has an interesting global structure. This class decomposes into the disjoint union of the class Int of intermediate logics, the class Neg of negative logics with a degenerate negation, and the class Par of properly paraconsistent extensions of the minimal logic. The classes Int and Neg are well studied, whereas the study of Par can be reduced to some extent to the classes Int and Neg.     

Restricted interpolation property in superintuitionistic logics

The restricted interpolation property IPR in modal and superintuitionistic logics is investigated. It is proved that in superintuitionistic logics of finite slices and in finite-slice extensions of the Grzegorczyk logic, the property IPR is equivalent to the projective Beth property PB2. Supported by RFBR (project No. 06-01-00358) and by the Council for Grants (under RF President) and State Aid of Leading Scientific Schools (grant NSh-335.2008.1). Translated from Algebra i Logika, Vol. 48, No. 1, pp. 54-89, January-February, 2009.     

FINITE REPLACEMENT AND FINITE HILBERT-STYLE AXIOMATIZABILITY

We define a property for varieties V, the f.r.p. (finite replacement property). If it applies to a finitely based V then V is strongly finitely based in the sense of [14], see Theorem 2. Moreover, we obtain finite axiomatizability results for certain propositional logics associated with V, in its generality comparable to well-known finite base results from equational logic. Theorem 3 states that each variety generated by a 2-element algebra has the f.r.p. Essentially this implies finite axiomatizability of a 2-valued logic in any finite language.     

The modal logic of the countable random frame

 We study the modal logic M L ^r of the countable random frame, which is contained in and `approximates' the modal logic of almost sure frame validity, i.e. the logic of those modal principles which are valid with asymptotic probability 1 in a randomly chosen finite frame. We give a sound and complete axiomatization of M L ^r and show that it is not finitely axiomatizable. Then we describe the finite frames of that logic and show that it has the finite frame property and its satisfiability problem is in EXPTIME. All these results easily extend to temporal and other multi-modal logics. Finally, we show that there are modal formulas which are almost surely valid in the finite, yet fail in the countable random frame, and hence do not follow from the extension axioms. Therefore the analog of Fagin's transfer theorem for almost sure validity in first-order logic fails for modal logic. Received: 1 May 2000 / Revised version: 29 July 2001 / Published online: 2 September 2002 Mathematics Subject Classification (2000): 03B45, 03B70, 03C99 Key words or phrases: Modal logic – Random frames – Almost sure frame validity – Countable random frame – Axiomatization – Completeness     

The torsion-free part of the Ziegler spectrum of orders over Dedekind domains

We study the R-torsion-free part of the Ziegler spectrum of an order Λ over a Dedekind domain R. We underline and comment on the role of lattices over Λ. We describe the torsion-free part of the spectrum when Λ is of finite lattice representation type.     

Finite Quasi-uniform Extensions. II

The lattice of finite extensions of quasi-uniformities for prescribed topologies are examined. An example is presented which shows that in the finite and strict case there can occur that there exists no coarsest compatible extension. It is also verified that inf in the lattice of extensions. In the strict case there exists a coarsest compatible extension if and only if there exists a coarsest extension for X {p} for every p Y - X. It is shown that certain special sup-distributive lattices can be represented by the lattice of extensions. For example every finite distributive lattice is isomorphic to the lattice of extensions for a suitable system.     

Frame definability in finitely valued modal logics

In this paper we study frame definability in finitely valued modal logics and establish two main results via suitable translations: (1) in finitely valued modal logics one cannot define more classes of frames than are already definable in classical modal logic (cf. [27, Thm. 8]), and (2) a large family of finitely valued modal logics define exactly the same classes of frames as classical modal logic (including modal logics based on finite Heyting and MV-algebras, or even BL-algebras). In this way one may observe, for example, that the celebrated Goldblatt–Thomason theorem applies immediately to these logics. In particular, we obtain the central result from [26] with a much simpler proof and answer one of the open questions left in that paper. Moreover, the proposed translations allow us to determine the computational complexity of a big class of finitely valued modal logics.     

Interpolation and Definability in Extensions of the Minimal Logic

We study into the interpolation property and the projective Beth property in extensions of Johansson's minimal logic. A family of logics of some special form is considered. Effective criteria are specified which allow us to verify whether an arbitrary logic in this family has a given property. Supported by RFBR grant No. 03-06-80178, by the Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2069.2003.1, and by INTAS grant No. 04-77-7080. __________ Translated from Algebra i Logika, Vol. 44, No. 6, pp. 726–750, November–December, 2005.     

The Projective Beth Property and Interpolation in Positive and Related Logics

We look at the interplay between the projective Beth property in non-classical logics and interpolation. Previously, we proved that in positive logics as well as in superintuitionistic and modal ones, the projective Beth property PB2 follows from Craig's interpolation property and implies the restricted interpolation property IPR. Here, we show that IPR and PB2 are equivalent in positive logics, and also in extensions of the superintuitionistic logic KC and of the modal logic Grz.2. Supported by RFBR grant No. 06-01-00358, by INTAS grant No. 04-77-7080, and by the Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2069.2003.1. __________ Translated from Algebra i Logika, Vol. 45, No. 1, pp. 85–113, January–February, 2006.     

Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property

We provide results allowing to state, by the simple inspection of suitable classes of posets (propositional Kripke frames), that the corresponding intermediate propositional logics are maximal among the ones which satisfy the disjunction property. Starting from these results, we directly exhibit, without using the axiom of choice, the Kripke frames semantics of 2^No maximal intermediate propositional logics with the disjunction property. This improves previous evaluations, giving rise to the same conclusion but made with an essential use of the axiom of choice, of the cardinality of the set of the maximal intermediate propositional logics with the disjunction property. Mathematics Subject Classification: 03B55, 03C90.     

The lattice of extensions of the modal logic of two equivalence relations has the cardinality of the continuum

A continuum of different logics over S5⋇S5 is constructed. This proves that the cardinality of the lattice of all normal extensions of the logic of two equivalence relations Ext(S5⋇S5) is continuum.     

Algorithmic correspondence and canonicity for non-distributive logics

We extend the theory of unified correspondence to a broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as ‘lattices with operators’. Specifically, we introduce a syntactic definition of the class of Sahlqvist formulas and inequalities which applies uniformly to each LE-signature and is given purely in terms of the order-theoretic properties of the algebraic interpretations of the logical connectives. We also introduce the algorithm ALBA, parametric in each LE-setting, which effectively computes first-order correspondents of LE-inequalities, and is guaranteed to succeed on a wide class of inequalities (the so-called inductive inequalities) which significantly extend the Sahlqvist class. Further, we show that every inequality on which ALBA succeeds is canonical. Projecting these results on specific signatures yields state-of-the-art correspondence and canonicity theory for many well known modal expansions of classical and intuitionistic logic and for substructural logics, from classical poly-modal logics to (bi-)intuitionistic modal logics to the Lambek calculus and its extensions, the Lambek-Grishin calculus, orthologic, the logic of (not necessarily distributive) De Morgan lattices, and the multiplicative-additive fragment of linear logic.