An infinite class of maximal intermediate propositional logics with the disjunction property

Summary Infinitely many intermediate propositional logics with the disjunction property are defined, each logic being characterized both in terms of a finite axiomatization and in terms of a Kripke semantics with the finite model property. The completeness theorems are used to prove that any two logics are constructively incompatible. As a consequence, one deduces that there are infinitely many maximal intermediate propositional logics with the disjunction property.     

Locally uniformly rotund points in convex-transitive Banach spaces

Almost transitive superreflexive Banach spaces have been considered in [C. Finet, Uniform convexity properties of norms on superreflexive Banach spaces, Israel J. Math. 53 (1986) 81–92], where it is shown that they are uniformly convex and uniformly smooth. We characterize such spaces as those convex transitive Banach spaces satisfying conditions much weaker than that of uniform convexity (for example, that of having a weakly locally uniformly rotund point). We note that, in general, the property of convex transitivity for a Banach space is weaker than that of almost transitivity.     

Predicate superintuitionistic logics without interpolation

Predicate superintuitionistic logics are considered. We prove that all such logics that contain a logic characterized by frames whose domains are all finite and are contained in the classical logic of finite domains do not have the interpolation and Beth properties. It is also established that the interpolation property is not shared by all predicate superintuitionistic logics which contain a logic characterized by frames whose domains of nonfinal worlds are all finite and which are contained in a logic characterized by all two-element frames with finite constant domains. Supported by the Competitive Basic Research Center of St. Petersburg State University, grant No. 93-1-88-12. Translated fromAlgebra i Logika, Vol. 35, No. 1, pp. 105–117, January–February, 1996.     

Definability in Normal Extensions of S4

A projective Beth property, PB2, in normal modal logics extending S4 is studied. A convenient criterion is furnished for PB2 to be valid in a larger family of extensions of K4. All locally tabular extensions of the Grzegorczyk logic with PB2 are described. Superintuitionistic logics with the projective Beth property that have no modal companions with this property are found.     

Decidability of the interpolation problem and of related properties in tabular logics

Propositional modal and positive logics are considered as well as extensions of Johansson’s minimal logic. It is proved that basic versions of the interpolation property and of the Beth definability property, and also the Hallden property, are decidable on the class of tabular logics, i.e., logics given by finitely many finite algebras. Algorithms are described for constructing counterexamples to each of the properties mentioned in handling cases where the logic under consideration does not possess the required property.     

Prefinitely axiomatizable modal and intermediate logics

A logic Λ bounds a property P if all proper extensions of Λ have P while Λ itself does not. We construct logics bounding finite axiomatizability and logics bounding finite model property in the lattice of intermediate logics and in the lattice of normal extensions of K4.3. MSC: 03B45, 03B55.     

All finitely axiomatizable subframe logics containing the provability logic CSM_{0} are decidable

In this paper we investigate those extensions of the bimodal provability logic (alias or which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all finitely axiomatizable subframe logics containing are decidable. We note that, as a rule, interesting systems in this class do not have the finite model property and are not even complete with respect to Kripke semantics. Received July 15, 1997     

On squares of modal logics with additional connectives

The paper gives an overview of new results on two-dimensional modal logics of special type, “Segerberg squares.” They are defined as usual squares of modal logics with additional connectives corresponding to the diagonal symmetry and two projections onto the diagonal. In many cases these logics are finitely axiomatizable, complete and have the finite model property. Segerberg squares are interpreted in the classical predicate logic.     

On Finite Model Property for Admissible Rules

Our investigation is concerned with the finite model property (fmp) with respect to admissible rules. We establish general sufficient conditions for absence of fmp w. r. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic λ containing K4 with the co-cover property and of width > 2 has fmp w. r. t. admissibility. Surprisingly many, if not to say all, important modal logics of width > 2 are within the scope of this theorem–K4 itself, S4, GL, K4.1, K4.2, S4.1, S4.2, GL.2, etc. Thus the situation is completely opposite to the case of the ordinary fmp–the absolute majority of important logics have fmp, but not with respect to admissibility. As regards logics of width ≤ 2, there exists a zone for fmp w. r. t. admissibility. It is shown (Theorem 4.3) that all modal logics A of width ≤ 2 extending S4 which are not sub-logics of three special tabular logics (which is equipotent to all these λ extend a certain subframe logic defined over S4 by omission of four special frames) have fmp w.r.t. admissibility.     

The Lyndon property and uniform interpolation over the Grzegorczyk logic

We consider versions of the interpolation property stronger than the Craig interpolation property and prove the Lyndon interpolation property for the Grzegorczyk logic and some of its extensions. We also establish the Lyndon interpolation property for most extensions of the intuitionistic logic with Craig interpolation property. For all modal logics over the Grzegorczyk logic as well as for all superintuitionistic logics, the uniform interpolation property is equivalent to Craig’s property.     

Locally divergence-preserving schemes of higher order

Violation of the divergence constraint on the magnetic flux density in magnetohydrodynamical (MHD) simulations leads to stability problems. It is therefore of great importance to numerically respect this intrinsic constraint. Since the divergence preservation is a local phenomenon inherent in the MHD-system it is appealing to mimic this property numerically by a locally divergence-preserving scheme. A common numerical technique for simulation of the MHD-system of conservation laws is the finite volume (FV) method. In [SISC 26 2005 pp. 1166] a local procedure to redistribute the numerical fluxes in a FV-scheme so that a discrete divergence operator vanishes was presented. This procedure stabilizes the base scheme and respects the accuracy to the second order level. The present note describes a development of the above procedure that complies with the finite volume framework, preserves a fourth order discrete divergence operator locally and retains the accuracy of a generic semi-discrete finite volume scheme up to fourth order. The redistribution of the numerical magnetic field fluxes is formulated in a standard conservative setting, making it trivial to implement the divergence-preserving modification in an existing FV-scheme; see [JCP 227 2008 pp.3405] for the details. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Minimality and Sylow-Permutability in Locally Finite Groups

We give a complete classification of the locally finite groups that are minimal with respect to Sylow-permutability being intransitive.     

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.     

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 Krull-Schmidt theorem for one-dimensional rings of finite Cohen-Macaulay type

This paper determines when the Krull-Schmidt property holds for all finitely generated modules and for maximal Cohen-Macaulay modules over one-dimensional local rings with finite Cohen-Macaulay type. We classify all maximal Cohen-Macaulay modules over these rings, beginning with the complete rings where the Krull-Schmidt property is known to hold. We are then able to determine when the Krull-Schmidt property holds over the non-complete local rings and when we have the weaker property that any two representations of a maximal Cohen-Macaulay module as a direct sum of indecomposables have the same number of indecomposable summands.     

Propositional union closed team logics

In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We show that all these logics are expressively complete, and we introduce sound and complete systems of natural deduction for these logics. We also discuss the locality property and its connection with interpolation in these logics.     

Implicational (semilinear) logics I: a new hierarchy

In abstract algebraic logic, the general study of propositional non-classical logics has been traditionally based on the abstraction of the Lindenbaum-Tarski process. In this process one considers the Leibniz relation of indiscernible formulae. Such approach has resulted in a classification of logics partly based on generalizations of equivalence connectives: the Leibniz hierarchy. This paper performs an analogous abstract study of non-classical logics based on the kind of generalized implication connectives they possess. It yields a new classification of logics expanding Leibniz hierarchy: the hierarchy of implicational logics. In this framework the notion of implicational semilinear logic can be naturally introduced as a property of the implication, namely a logic L is an implicational semilinear logic iff it has an implication such that L is complete w.r.t. the matrices where the implication induces a linear order, a property which is typically satisfied by well-known systems of fuzzy logic. The hierarchy of implicational logics is then restricted to the semilinear case obtaining a classification of implicational semilinear logics that encompasses almost all the known examples of fuzzy logics and suggests new directions for research in the field.     

Subintuitionistic logics and the implications they prove

This is an investigation of the implications of IPC which remain provable when one weakens intuitionistic logic in various ways. The research is concerned with logics with Kripke models as introduced by G. Corsi in 1987, and others like G. Restall, Do?en, Visser. This leads to conservativity results for IPC with regard to classes of implications in some of these logics. Moreover, similar results are reached for some weaker subintuitionistic systems with neighborhood models introduced by the authors in 2016. In addition, the relationship between two types of neighborhood models introduced in that work is clarified. This clarification leads also to modal companions for weaker logics.     

Locally graded groups with complemented infinite nonabelian subgroups

Infinite nonabelian groups with complemented infinite nonabelian subgroups are investigated. It is proved that, under the condition of being locally graded, these groups are locally finite and solvable, and all nonabelian subgroups are complemented in them if and only if they are non-Chernikov groups.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 43, Nos. 7 and 8, pp, 1098–1100, July–August, 1991.