23 found
Order:
Disambiguations
Larisa Maksimova [27]Larisa L. Maksimova [3]
  1.  39
    On maximal intermediate logics with the disjunction property.Larisa L. Maksimova - 1986 - Studia Logica 45 (1):69 - 75.
    For intermediate logics, there is obtained in the paper an algebraic equivalent of the disjunction propertyDP. It is proved that the logic of finite binary trees is not maximal among intermediate logics withDP. Introduced is a logicND, which has the only maximal extension withDP, namely, the logicML of finite problems.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  2.  42
    Amalgamation and interpolation in normal modal logics.Larisa Maksimova - 1991 - Studia Logica 50 (3-4):457 - 471.
    This is a survey of results on interpolation in propositional normal modal logics. Interpolation properties of these logics are closely connected with amalgamation properties of varieties of modal algebras. Therefore, the results on interpolation are also reformulated in terms of amalgamation.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   26 citations  
  3.  51
    Interpolation properties of superintuitionistic logics.Larisa L. Maksimova - 1979 - Studia Logica 38 (4):419 - 428.
    A family of prepositional logics is considered to be intermediate between the intuitionistic and classical ones. The generalized interpolation property is defined and proved is the following.Theorem on interpolation. For every intermediate logic L the following statements are equivalent:(i) Craig's interpolation theorem holds in L, (ii) L possesses the generalized interpolation property, (iii) Robinson's consistency statement is true in L.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  4.  28
    Intuitionistic logic and implicit definability.Larisa Maksimova - 2000 - Annals of Pure and Applied Logic 105 (1-3):83-102.
    It is proved that there are exactly 16 superintuitionistic propositional logics with the projective Beth property. These logics are finitely axiomatizable and have the finite model property. Simultaneously, all varieties of Heyting algebras with strong epimorphisms surjectivity are found.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  5. Definability and Interpolation in Non-Classical Logics.Larisa Maksimova - 2006 - Studia Logica 82 (2):271-291.
    Algebraic approach to study of classical and non-classical logical calculi was developed and systematically presented by Helena Rasiowa in [48], [47]. It is very fruitful in investigation of non-classical logics because it makes possible to study large families of logics in an uniform way. In such research one can replace logics with suitable classes of algebras and apply powerful machinery of universal algebra. In this paper we present an overview of results on interpolation and definability in modal and positive logics,and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  6.  33
    On variable separation in modal and superintuitionistic logics.Larisa Maksimova - 1995 - Studia Logica 55 (1):99 - 112.
    In this paper we find an algebraic equivalent of the Hallden property in modal logics, namely, we prove that the Hallden-completeness in any normal modal logic is equivalent to the so-called super-embedding property of a suitable class of modal algebras. The joint embedding property of a class of algebras is equivalent to the Pseudo-Relevance Property. We consider connections of the above-mentioned properties with interpolation and amalgamation. Also an algebraic equivalent of of the principle of variable separation in superintuitionistic logics will (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  7.  29
    Projective Beth Property in Extensions of Grzegorczyk Logic.Larisa Maksimova - 2006 - Studia Logica 83 (1):365-391.
    All extensions of the modal Grzegorczyk logic Grz possessing projective Beth's property PB2 are described. It is proved that there are exactly 13 logics over Grz with PB2. All of them are finitely axiomatizable and have the finite model property. It is shown that PB2 is strongly decidable over Grz, i.e. there is an algorithm which, for any finite system Rul of additional axiom schemes and rules of inference, decides if the calculus Grz+Rul has the projective Beth property.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  12
    Complexity of some problems in modal and superintuitionistic logics.Larisa Maksimova & Andrei Voronkov - 2000 - Bulletin of Symbolic Logic 6:118-119.
  9.  8
    Restricted Interpolation in Modal Logics.Larisa Maksimova - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 297-311.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  10.  13
    Temporal logics of “the next” do not have the beth property.Larisa Maksimova - 1991 - Journal of Applied Non-Classical Logics 1 (1):73-76.
  11. Problems in Set Theory, Mathematical Logic and the Theory of Algorithms.Igor Lavrov, Larisa Maksimova & Giovanna Corsi - 2005 - Studia Logica 79 (3):409-410.
     
    Export citation  
     
    Bookmark   2 citations  
  12.  28
    Complexity of interpolation and related problems in positive calculi.Larisa Maksimova - 2002 - Journal of Symbolic Logic 67 (1):397-408.
    We consider the problem of recognizing important properties of logical calculi and find complexity bounds for some decidable properties. For a given logical system L, a property P of logical calculi is called decidable over L if there is an algorithm which for any finite set Ax of new axiom schemes decides whether the calculus L + Ax has the property P or not. In [11] the complexity of tabularity, pre-tabularity, and interpolation problems over the intuitionistic logic Int and over (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13.  20
    Definability theorems in normal extensions of the probability logic.Larisa L. Maksimova - 1989 - Studia Logica 48 (4):495-507.
    Three variants of Beth's definability theorem are considered. Let L be any normal extension of the provability logic G. It is proved that the first variant B1 holds in L iff L possesses Craig's interpolation property. If L is consistent, then the statement B2 holds in L iff L = G + {0}. Finally, the variant B3 holds in any normal extension of G.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14. Problems in Set Theory, Mathematical Logic and the Theory of Algorithms.Igor Lavrov, Larisa Maksimova, Giovanna Corsi & Valentin Shehtman - 2005 - Studia Logica 81 (2):283-285.
     
    Export citation  
     
    Bookmark  
  15. A Short Scientific Autobiography.Larisa Maksimova - 2018 - In Sergei Odintsov (ed.), Larisa Maksimova on Implication, Interpolation, and Definability. Cham, Switzerland: Springer Verlag.
    No categories
     
    Export citation  
     
    Bookmark  
  16.  6
    Interpolation and Beth Definability over the Minimal Logic.Larisa Maksimova - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 459-463.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  17.  29
    Interpolation and Definability over the Logic Gl.Larisa Maksimova - 2011 - Studia Logica 99 (1-3):249-267.
    In a previous paper [ 21 ] all extensions of Johansson’s minimal logic J with the weak interpolation property WIP were described. It was proved that WIP is decidable over J. It turned out that the weak interpolation problem in extensions of J is reducible to the same problem over a logic Gl, which arises from J by adding tertium non datur. In this paper we consider extensions of the logic Gl. We prove that only finitely many logics over Gl (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  23
    Interpolation and implicit definability in extensions of the provability logic.Larisa Maksimova - 2008 - Logic and Logical Philosophy 17 (1-2):129-142.
    The provability logic GL was in the field of interest of A.V. Kuznetsov, who had also formulated its intuitionistic analog—the intuitionisticprovability logic—and investigated these two logics and their extensions.In the present paper, different versions of interpolation and of the Bethproperty in normal extensions of the provability logic GL are considered. Itis proved that in a large class of extensions of GL almost all versions of interpolation and of the Beth propertyare equivalent. It follows that in finite slice logics over GL (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19. Interpolation in Superintuitionistic and Modal Predicate Logics with Equality.Larisa Maksimova - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 133-140.
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  20. Projective Beth;s Properties in Infinite Slice Extensions of the Modal Logic K4.Larisa Maksimova - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 349-363.
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  21.  10
    Interpolation and Definability: Modal and Intuitionistic Logics.Dov M. Gabbay & Larisa Maksimova - 2005 - Oxford, England: Oxford University Press UK.
    This book is a specialized monograph on interpolation and definability, a notion central in pure logic and with significant meaning and applicability in all areas where logic is applied, especially computer science, artificial intelligence, logic programming, philosophy of science and natural language. Suitable for researchers and graduate students in mathematics, computer science and philosophy, this is the latest in the prestigous world-renowned Oxford Logic Guides, which contains Michael Dummet's Elements of intuitionism, J. M. Dunn and G. Hardegree's Algebraic Methods in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  43
    Alan Ross Anderson, Nuel D. BelnapJr., and J. Michael Dunn. Entailment. The logic of relevance and necessity. Volume II. Princeton University Press, Princeton and Oxford1992, xxvii + 749 pp. [REVIEW]Larisa Maksimova - 1996 - Journal of Symbolic Logic 61 (1):338-341.
  23.  6
    Review: Alan Ross Anderson, Entailment. The Logic of Relevance and Necessity. [REVIEW]Larisa Maksimova - 1996 - Journal of Symbolic Logic 61 (1):338-341.