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.     

Superintuitionistic logics and the projective beth property

It is proved that in superintuitionistic logics, the projective Beth property follows from the Craig interpolation property, but the converse does not hold. A criterion is found which allows us to reduce the problem asking whether the projective Beth property is valid in superintuitionistic logics to suitable properties of varieties of pseudoboolean algebras. It is shown that the principle of variable separation follows from the projective Beth property. On the other hand, the interpolation property in a logic L implies the projective Beth property in Δ(L). Supported by RFFR grants No. 96-01-01552 and No. 99-01-00600. Translated fromAlgebra i Logika, Vol. 38, No. 6, pp. 680–696, November–December, 1999.     

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.     

Interpolation in superintuitionistic predicate logics with equality

It is shown that the Craig interpolation property and the Beth property are preserved under passage from a superintuitionistic predicate logic to its extension via standard axioms for equality, and under adding formulas of pure equality as new axioms. We find an infinite independent set of formulas which, though not equivalent to formulas of pure equality, may likewise be added as new axiom schemes without loss of the interpolation, or Beth, property. The formulas are used to construct a continuum of logics with equality, which are intermediate between the intuitionistic and classical ones, having the interpolation property. Moreover, an equality-free fragment of the logics constructed is an intuitionistic predicate logic, and formulas of pure equality satisfy all axioms of the classical predicate logic. Supported by RFFR grant No. 96-01-01552. Translated fromAlgebra i Logika, Vol. 36, No. 5, pp. 543–561, September–October, 1997.     

A method of proving interpolation in paraconsistent extensions of the minimal logic

The interpolation property in extensions of Johansson’s minimal logic is investigated. The construction of a matched product of models is proposed, which allows us to prove the interpolation property in a number of known extensions of the minimal logic. It is shown that, unlike superintuitionistic, positive, and negative logics, a sum of J-logics with the interpolation property CIP may fail to possess _CIP, nor even the restricted interpolation property. 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-4787.2006.1. __________ Translated from Algebra i Logika, Vol. 46, No. 5, pp. 627–648, September–October, 2007.     

Projective beth properties in modal and superintuitionistic logics

Projective Beth properties in superintuitionistic and normal modal logics are considered. Their interrelations and connections with interpolation properties of the logics are established. Algebraic counterparts for the projective Beth properties are found out. Supported by the Russian Humanitarian Science Foundation, grant No. 97-03-04089. Translated fromAlgebra i Logika, Vol. 38, No. 3, pp. 316–333, May–June, 1999.     

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.     

A sufficient condition of type (Ω) for tame splitting of short exact sequences of Fréchet spaces

In a previous paper, the quotient spaces of (s) in the tame category of nuclear Fréchet spaces have been characterized by property (ΩDZ) corresponding to the topological condition (Ω) of D. Vogt and M. J. Wagner. In addition, a splitting theorem has been proved which provides the existence of a tame linear right inverse of a tame linear map on the assumption that the kernel of the given map has property (ΩDZ) and that certain tameness conditions hold. In this paper it is proved that property (Ω) in standard form (i.e., the dual norms ‖ ‖ _n ^* are logarithmically convex) implies the tame splitting condition (ΩDZ) for any tamely nuclear Fréchet space equipped with a grading defined by sermiscalar products. As an application, property (ΩDZ) is verified for the kernels of any hypoelliptic system of linear partial differential operators with constant coefficients on ℝ^N or on a bounded convex region in ℝ^N.     

The Beth property and interpolation in lattice-based algebras and logics

We deal with logics based on lattices with an additional unary operation. Interrelations of different versions of interpolation, the Beth property, and amalgamation, as they bear on modal logics and varieties of modal algebras, superintuitionistic logics and varieties of Heyting algebras, positive logics and varieties of implicative lattices, have been studied in many works. Sometimes these relations can and sometimes cannot be extended to the logics without implication considered in the paper. Supported by INTAS (grant No. 04-77-7080) and by RFBR (grant No. 06-01-00358). Supported by INTAS grant No. 04-77-7080. __________ Translated from Algebra i Logika, Vol. 47, No. 3, pp. 307–334, May–June, 2008.     

Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas

An infinitary calculus for a restricted fragment of the first-order linear temporal logic is considered. We prove that for this fragment one can construct the infinitary calculusG _Lω ^* without contraction on predicate formulas. The calculusG _Lω ^* possesses the following properties: (1) the succedent rule for the existential quantifier is included into the corresponding axiom; (2) the premise of the antecedent rule for the universal quantifier does not contain a duplicate of the main formula. The soundness and completness ofG _Lω ^* are also proved. Institute of Mathematics and Informatics, Akademijos 4, 2600 Vilnius, Lithuania. Translated from Lietuvos Matematikos Rinkinys, Vol. 39, No. 3, pp. 378–397, July–September, 1999. Translated by R. Lapinskas     

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.     

Algebraic semantics for superintuitionistic predicate logics

We construct a unified algebraic semantics for superintuitionistic predicate logics. Assigned to each predicate logic is some deductive system of a propositional language which is kept fixed throughout all predicate superintuitionistic ones. Given that system, we build up a variety of algebras w.r.t. which a given logic is proved to be strongly complete. Supported by the Russian Arts Foundation (RAF), grant No. 97-03-04089a. Translated fromAlgebra i Logika, Vol. 38, No. 1, pp. 68–95, January–February, 1999.     

A Modal Logic That is Complete with Respect to Strictly Linearly Ordered <Emphasis Type="Italic">A</Emphasis>-Models

An axiomatization is furnished for a polymodal logic of strictly linearly ordered A-frames: for frames of this kind, we consider a language of polymodal logic with two modal operators, □_< and □_≺. In the language, along with the operators, we introduce a constant β, which describes a basis subset. In the language with the two modal operators and constant β, an Lα-calculus is constructed. It is proved that such is complete w.r.t. the class of all strictly linearly ordered A-frames. Moreover, it turns out that the calculus in question possesses the finite-model property and, consequently, is decidable. __________ Translated from Algebra i Logika, Vol. 44, No. 5, pp. 560–582, September–October, 2005. 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.     

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     

Van der waerden and ramsey type games

Let us consider the following 2-player game, calledvan der Waerden game. The players alternately pick previously unpicked integers of the interval {1, 2, ...,N}. The first player wins if he has selected all members of ann-term arithmetic progression. LetW*(n) be the least integerN so that the first player has a winning strategy. By theRamsey game on k-tuples we shall mean a 2-player game where the players alternately pick previously unpicked elements of the completek-uniform hypergraph ofN verticesK _N ^k , and the first player wins if he has selected allk-tuples of ann-set. LetR _k*(n) be the least integerN so that the first player has a winning strategy. We prove (W* (n))¹/n → 2,R ₂*(n)<(2+ε) ⁿ andR _k ^* n<2 ^nk / ^k! fork ≧3.     

Irreducible characters with equal roots in the groups Sn and An

We show that treating of (non-trivial) pairs of irreducible characters of the group S_n sharing the same set of roots on one of the sets A_n and S_n \ A_n is divided into three parts. This, in particular, implies that any pair of such characters χ^α and χ^β (α and β are respective partitions of a number n) possesses the following property: lengths d(α) and d(β) of principal diagonals of Young diagrams for α and β differ by at most 1. Supported by RFBR grant No. 04-01-00463 and by RFBR-NSFC grant No. 05-01-39000. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 3–25, January–February, 2007.     

Barwise's information frames and modal logics

 The paper studies Barwise's information frames and answers the John Barwise question: to find axiomatizations for the modal logics generated by information frames. We find axiomatic systems for (i) the modal logic of all complete information frames, (ii) the logic of all sound and complete information frames, (iii) the logic of all hereditary and complete information frames, (iv) the logic of all complete, sound and hereditary information frames, and (v) the logic of all consistent and complete information frames. The notion of weak modal logics is also proposed, and it is shown that the weak modal logics generated by all information frames and by all hereditary information frames are K and K4 respectively. To develop general theory, we prove that (i) any Kripke complete modal logic is the modal logic of a certain class of information frames and that (ii) the modal logic generated by any given class of complete, rarefied and fully classified information frames is Kripke complete. This paper is dedicated to the memory of talented mathematician John Barwise. Received: 7 May 2000 Published online: 10 October 2002 Key words or phrases: Knowledge presentation – Information – Information flow – Information frames – Modal logic-Kripke model     

Weak Morrey spaces and strong solutions to the Navier-Stokes equations

We consider the Cauchy problem of Navier-Stokes equations in weak Morrey spaces. We first define a class of weak Morrey type spaces Mp*,λ(Rn) on the basis of Lorentz space Lp,∞ = Lp*(Rn)(in particular, Mp*,0(Rn) = Lp,∞, if p ＞ 1), and study some fundamental properties of them; Second,bounded linear operators on weak Morrey spaces, and establish the bilinear estimate in weak Morrey spaces. Finally, by means of Kato's method and the contraction mapping principle, we prove that the Cauchy problem of Navier-Stokes equations in weak Morrey spaces Mp*,λ(Rn) (1＜p≤n) is time-global well-posed, provided that the initial data are sufficiently small. Moreover, we also obtain the existence and uniqueness of the self-similar solution for Navier-Stokes equations in these spaces, because the weak Morrey space Mp*,n-p(Rn) can admit the singular initial data with a self-similar structure. Hence this paper generalizes Kato's results.     

A Euclidean Ramsey Problem

   Abstract. Let C _n denote the set of points in R ⁿ whose coordinates are all 0 or 1 , i.e., the vertex set of the unit n -cube. Graham and Rothschild [2] proved that there exists an integer N such that for n ≥ N , any 2-coloring of the edges of the complete graph on C _n contains a monochromatic plane K ₄ . Let N ^* be the minimum such N . They noted that N ^* must be at least 6 . Their upper bound on N ^* has come to be known as Graham's number , often cited as the largest number that has ever been put to any practical use. In this note we show that N ^* must be at least 11 and provide some experimental evidence suggesting that N ^* is larger still.