Negative modal schemes

We deal with the question of whether solutions of modal propositional negative schemes are definable on Kripke models. It is shown that there exists a formula by which a solution of such a scheme is defined in every Kripke model with the ascending chain condition, in which the solution exists. We present an algorithm for constructing such a defining formula. Supported by RFFR grant No. 96-01-01552. Translated fromAlgebra i Logika, Vol. 37, No. 3, pp. 329–337, May–June, 1998.     

Linear differential operators with unbounded operator coefficients and semigroups of bounded operators

Associated with a family of evolution operators in a complex Banach space is a linear unbounded operator, which is studied with the aid of a semigroup of difference operators and a difference operator in a sequence space. Some formulas for the spectra of the linear operators in question (in particular, for abstract hyperbolic differential operators) and the spectrum mapping theorem for the semigroup of difference operators are obtained. Translated fromMatematicheskie Zametki, Vol. 59, No. 6, pp. 811–820, June, 1996. This research was supported by the Russian Foundation for Basic Research under grant No. 95-01-00032 and by the International Science Foundation under grant No. NZA000 and grant No. NZA300.     

Growth functions,rewriting systems,and the Euler characteristic

We present a formula that expresses the number of admissible words for an arbitrary system of prohibitions in terms of the generating series. We also indicate applications of this formula to the calculation of the topological entropy of symbolic systems and to the calculation of growth functions of groups and algebras. Translated fromMatematicheskie Zametki, Vol. 58, No. 5, pp. 653–668, November, 1995. This research was partially supported by the Russian Foundation for Basic Research under grant No. 94-01-00820 and by the International Science Foundation grant MV1000.     

Intermediate predicate logic without the beth property

It is shown that a logic J _fd ^* characterized by all Kripke frames the domains of all nonmaximal worlds of which are finite lacks the Beth property. The logic is the first example of an intermediate superintuitionistic logic without the Beth property. The interpolation and the Beth properties are also proved missing in all predicate superintuitionistic logics which contain J _fd ^* and are contained in a logic characterized by frames of the form〈N _n , ≤,{Dk}k∈N n〉. Supported by the Russian Foundation for Humanities, grant No. 97-03-04089. Translated fromAlgebra i Logika, Vol. 37, No. 1, pp. 107–117, January–February, 1998.     

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.     

The class of groups all of whose subgroups with lesser number of generators are free is generic

It is shown that, in a certain statistical sense, in almost every group withm generators andn relations (withm andn chosen), any subgroup generated by less thanm elements (which need not belong to the system of generators of the whole group) is free. In particular, this solves Problem 11.75 from the Kourov Notebook. In the proof we introduce a new assumption on the defining relations stated in terms of finite marked groups. Translated fromMatematicheskie Zametki, Vol. 59, No. 4, pp. 489–496, April, 1996. The research of the second author was partially supported by the Russian Foundation for Basic Research under grant No. 94-0101541 and by the International Science Foundation under grant No. MID000.     

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.     

Asymptotics ast → ∞ of the solutions of nonlinear equations with nonsmall initial perturbations

A new method is proposed for finding asymptotics ast → ∞ of the solutions of the Cauchy problem for nonlinear evolution equations with nonsmall initial data. Translated fromMatematicheskie Zametki, Vol. 59, No. 6, pp. 855–864, June, 1996. This research was supported by the Russian Foundation for Basic Research under grant No. 93-011-134 and by the International Science Foundation under grant No. BX000.     

Lattices embeddable in subsemigroup lattices. II. Cancellative semigroups

Repnitskii proved that any lattice embeds in a subsemigroup lattice of some commutative, cancellative, idempotent free semigroup with unique roots. In that proof, use is made of a result by Bredikhin and Schein stating that any lattice embeds in a suborder lattice of suitable partial order. Here, we present a direct proof of Repnitskii’s result which is independent of Bredikhin-Schein’s, thus giving the answer to the question posed by Shevrin and Ovsyannikov. Supported by INTAS grant No. 03-51-4110; RF Ministry of Education grant No. E02-1.0-32; Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2112.2003.1; a grant from the Russian Science Support Foundation; SB RAS Young Researchers Support project No. 11. __________ Translated from Algebra i Logika, Vol. 45, No. 4, pp. 436–446, July–August, 2006.     

Extension by zero of functions of several variables

We obtain sufficient conditions on a domainG ⊂ ℝn for functions defined onG to be extendable by zero to the entire space ℝn with smoothness preserved in an integral norm. Translated fromMatematicheskie Zametki, Vol. 64, No. 3, pp. 351–365, September, 1998. This research was supported by the Russian Foundation for Basic Research under grant No. 96-01-00243 and by program “Leading Science Schools” under grant No. 96-15-96102.     

Freedom from the interpolation property for tense calculi associated with Ershov spaces

We study into the question whether calculi associated with Ershov topological spaces possess Craig’s 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. 6, pp. 745–762, November–December, 2007.     

Integrable boundary conditions for many-component burgers equations

Infinite series of boundary conditions that are consistent with even-order higher symmetries and ensure the integrability of a Burgers type equation are constructed. Translated fromMatematicheskie Zametki, Vol. 60, No. 6, pp. 888–901, December, 1996. This research was supported by the Russian Foundation for Basic Research under grant No. 93-011-16008 and by the International Science Foundation under grant Nos. MLY00 and RK2000.     

Singular integral operators on complicated contours and pseudodifferential operators

We apply the pseudodifferential operator technique to the study of algebras of singular operators on complicated contours. This technique is used to construct a symbolic calculus for theC ^*-algebra generated by singular integral operators whose coefficients may have singularities of the second kind on complicated contours; the curves forming a node are not required to have a tangent at the node. Translated fromMatematicheskie Zametki, Vol. 58, No. 1, pp. 67–85, July, 1995. This work was partially supported by the Russian Foundation for Basic Research under grant No. 93-04-691.     

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.     

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.     

Modules over quantum polynomials

We describe the structure of finitely generated modules over general quantum Laurent polynomials and prove that Artin modules over general quantum Laurent polynomials are cyclic. Translated fromMatematicheskie Zametki, Vol. 59, No. 4, pp. 497–503, April, 1996. This research was partially supported by the Russian Foundation for the Basic Research under grant No. 93-011-1544 and by the INTAS program under grant No. 93-2618.     

Integral characteristics in the inverse problem of magnetotelluric sounding

This article examines some aspects of the one-dimensional inverse problem of magnetotelluric sounding. A uniqueness theorem is proved in the presence ofS-surfaces. A numerical algorithm based on transformation formulas is proposed. This research was partially supported by Russian Foundation for Basic Research (grant No. 96-01-00410) and by the State Scientific-Technical Program “Future Information Technologies” (grant No. 0201.06.010). Translated from Chislennye Metody v Matematicheskoi Fizike, Moscow State University, pp. 53–66, 1998.     

Lattices embeddable in subsemigroup lattices. I. Semilattices

V. B. Repnitskii showed that any lattice embeds in some subsemilattice lattice. In his proof, use was made of a result by D. Bredikhin and B. Schein, stating that any lattice embeds in the suborder lattice of a suitable partial order. We present a direct proof of Repnitskii’s result, which is independent of Bredikhin—Schein’s, giving the answer to a question posed by L. N. Shevrin and A. J. Ovsyannikov. We also show that a finite lattice is lower bounded iff it is isomorphic to the lattice of subsemilattices of a finite semilattice that are closed under a distributive quasiorder. Supported by INTAS grant No. 03-51-4110; RF Ministry of Education grant No. E02-1.0-32; Council for Grants (under RF President) and State Aid of Fundamental Science Schools, project NSh-2112.2003.1; a grant from the Russian Science Support Foundation; SB RAS Young Researchers Support project No. 11. __________ Translated from Algebra i Logika, Vol. 45, No. 2, pp. 215–230, March–April, 2006.     

Carter subgroups of finite almost simple groups

In the paper we work to complete the classification of Carter subgroups in finite almost simple groups. In particular, it is proved that Carter subgroups of every finite almost simple group are conjugate. Based on our previous results, together with those obtained by F. Dalla Volta, A. Lucchini, and M. C. Tamburini, as a consequence we derive that Carter subgroups of every finite group are conjugate. Supported by RFBR grant No. 05-01-00797; by the Council for Grants (under RF President) for Support of Young Russian Scientists via projects MK-1455.2005.1 and MK-3036.2007.1; by SB RAS Young Researchers Support grant No. 29; via Integration Project No. 2006.1.2. __________ Translated from Algebra i Logika, Vol. 46, No. 2, pp. 157–216, March–April, 2007.     

Modified realizability and predicate logic

Semantics of predicate formulas based on the notion of modified realizability for arithmetic formulas and interpretations of the language of arithmetic in all finite types are considered. For a number of natural constructive interpretations, the corresponding predicate logic of modified realizability is proved to be nonarithmetical. Translated fromMatematicheskie Zametki, Vol. 61, No. 2, pp. 259–269, February, 1997. This research was supported by the Russian Foundation for Basic Research under grant No. 95-01-00416 and by the International Science Foundation under grant No. NFQ000. Translated by V. N. Dubrovsky