Works by L. A. Chagrova ( view other items matching `L. A. Chagrova`, view all matches )

  1. A. V. Chagrov & L. A. Chagrova (1995). Algorithmic Problems Concerning First-Order Definability of Modal Formulas on the Class of All Finite Frames. Studia Logica 55 (3):421 - 448.
    The main result is that is no effective algorithmic answer to the question:how to recognize whether arbitrary modal formula has a first-order equivalent on the class of finite frames. Besides, two known problems are solved: it is proved algorithmic undecidability of finite frame consequence between modal formulas; the difference between global and local variants of first-order definability of modal formulas on the class of transitive frames is shown.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Dick de Jongh & L. A. Chagrova (1995). The Decidability of Dependency in Intuitionistic Propositional Logi. Journal of Symbolic Logic 60 (2):498-504.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  3. L. A. Chagrova (1991). An Undecidable Problem in Correspondence Theory. Journal of Symbolic Logic 56 (4):1261-1272.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation