Weak interpolation in extensions of the logics <Emphasis Type="Italic">S</Emphasis><Subscript>4</Subscript> and <Emphasis Type="Italic">K</Emphasis><Subscript>4</Subscript>

Conditions are specified which are necessary and sufficient for a logic over K4 to possess the weak interpolation property. For this goal to be met, simple transitive modal algebras are described, and we establish a criterion for the class of such algebras to be amalgamable. For extensions of K4, the weak interpolation property is proved decidable. 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. 47, No. 6, pp. 705–722, November–December, 2008.     

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.     

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.     

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.     

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.     

Automatic recognition of interpolation in modal calculi

We deal with some issues on automatic recognition of interpolation properties in modal calculi extending the logics S5 and S4.3. Supported by RFBR grant No. 06-01-00358 and by INTAS grant No. 04-77-7080. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 103–119, January–February, 2007.     

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.     

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.     

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.     

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.     

Complex algebras of subalgebras

Let V be a variety of algebras. We specify a condition (the so-called generalized entropic property), which is equivalent to the fact that for every algebra A ∈ V, the set of all subalgebras of A is a subuniverse of the complex algebra of the subalgebras of A. The relationship between the generalized entropic property and the entropic law is investigated. Also, for varieties with the generalized entropic property, we consider identities that are satisfied by complex algebras of subalgebras. Dedicated to George Gr?tzer on the occasion of his 70th birthday Supported by INTAS grant No. 03-51-4110. Supported by MŠMTČR (project MSM 0021620839) and by the Grant Agency of the Czech Republic (grant No. 201/05/0002). Translated from Algebra i Logika, Vol. 47, No. 6, pp. 655–686, November–December, 2008.     

Conjugately dense subgroups of free products of groups with amalgamation

A subgroup having non-empty intersection with each class of conjugate elements of the group is said to be conjugately dense. It is shown that, under certain conditions, the number of conjugately dense subgroups in a free product with amalgamation is not less than some cardinal. As a consequence, P. Neumann’s conjecture in the Kourovka notebook (Question 6.38) is refuted. It is also stated that a modular group and a non-Abelian group of countable or finite rank possess continuum many pairwise non-conjugate conjugately dense subgroups. Supported by RFBR grant No. 03-01-00905. __________ Translated from Algebra i Logika, Vol. 45, No. 5, pp. 520–537, September–October, 2006.     

Isomorphically rigid algebras

Various classes of non-associative algebras possessing the property of being rigid under abstract isomorphisms are studied. Supported by RFBR grant No. 06-01-00159a. __________ Translated from Algebra i Logika, Vol. 46, No. 4, pp. 483–502, July–August, 2007.     

Infinite commensurable hyperbolic groups are bi-Lipschitz equivalent

It is proved that commensurable hyperbolic groups are bi-Lipschitz equivalent. Therefore, subgroups of finite index in an arbitrary hyperbolic group also share this property. In addition, it is shown that any two separated nets Γ¹ and Γ² in the hyperbolic space Hⁿ of dimension n≥2 are bi-Lipschitz-equivalent. These results answer the questions posed in [1]. Supported by RFFR grant No. 96-01-01781. Translated fromAlgebra i Logika, Vol. 36, No. 3, pp. 259–272, May–June, 1997.     

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.     

Elementary equivalence for lattices of subalgebras of free algebras

A class of varieties V (including all finitely based lattice varieties) is determined for which the elementary equivalence of lattices of subalgebras of free V-algebras, F_v(X) and F_v(Y), is equivalent to sets X and Y being second-order equivalent. Supported by RFFR grant No. 99-01-00571. Supported by the National Research Foundation of the Republic of South Africa, and by the University of Cape Town Research Committee. Translated fromAlgebra i Logika, Vol. 39, No. 5, pp. 595–601, September–October, 2000.     

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.     

Irreducible characters of the group S n that are semiproportional on A n

Previously, we dubbed the conjecture that the alternating group A_n has no semiproportional irreducible characters for any natural n [1]. This conjecture was then shown to be equivalent to the following [3]. Let α and β be partitions of a number n such that their corresponding characters χ^α and χ^β in the group S_n are semiproportional on A_n. Then one of the partitions α or β is self-associated. Here, we describe all pairs (α, β) of partitions satisfying the hypothesis and the conclusion of the latter conjecture. Supported by RFBR (grant No. 07-01-00148) and by RFBR-NSFC (grant No. 05-01-39000). __________ Translated from Algebra i Logika, Vol. 47, No. 2, pp. 135–156, March–April, 2008.     

Necessary and Sufficient Conditions for Weak No-Arbitrage in Securities Markets with Frictions

In this paper we consider a financial market model with frictions which include transaction costs, bid-ask spread and taxes. By using optimization, linear and nonlinear programming and convex programming techniques, several necessary and sufficient conditions are derived for the weak no-arbitrage. Some results on state prices are also provided. The results of this paper can provide at least some theoretical insight to the problem. This research was supported in part by a grant of the National Excellent Ph.D. Thesis Project of China (No. 200267), a grant of the National Natural Science Foundation of China (No. 10171115), a “Tenth Five-Year Plan” project of Ministry of Education of China (No. 01JA630009), a grant of the Natural Science Foundation of Guangdong Province (No. 011193), two grants from the Research Grants Council of Hong Kong (CityU 1081/02E, HKU 7139/01H), and a research grant of the University of Hong Kong.