Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Chagrova, Lilia
Total publications: 26 (26)
in MathSciNet: 11 (11)
in zbMATH: 11 (11)
in Web of Science: 1 (1)
in Scopus: 2 (2)
Cited articles: 3
Citations: 39

Number of views:
This page:49
Associate professor
Candidate of physico-mathematical sciences

https://www.mathnet.ru/eng/person208921
List of publications on Google Scholar
https://zbmath.org/authors/ai:chagrova.l-a
https://mathscinet.ams.org/mathscinet/MRAuthorID/230366
https://elibrary.ru/author_items.asp?authorid=77069
ISTINA https://istina.msu.ru/workers/17899497
https://www.scopus.com/authid/detail.url?authorId=16404533500

Full list of publications:
| scientific publications | by years | by types | by times cited | common list |


Citations (Crossref Cited-By Service + Math-Net.Ru)

   2019
1. G. A. Ignatev, L. A. Chagrova, “Prakticheskaya realizatsiya integratsii semi i shkoly, kak uslovie povysheniya kachestva matematicheskogo obrazovaniya”, Perspektivy razvitiya matematicheskogo obrazovaniya v Tveri i Tverskoi oblasti. Materialy III Vserossiiskoi nauchno-prakticheskoi konferentsii, 2019, 102–105  elib

   2018
2. M. N. Rybakov, L. A. Chagrova, “Algoritmicheskaya nerazreshimost problemy pervoporyadkovoi opredelimosti formul logiki vetvyaschegosya vremeni”, Programmnye produkty i sistemy, 31:3 (2018), 591–597  crossref  isi  elib

   2009
3. A. V. Chagrov, L. A. Chagrova, “Algoritmicheskie problemy okrestnostnoi polnoty normalnykh modalnykh logik”, Shestye Smirnovskie chteniya po logike. Materialy mezhdunarodnoi nauchnoi konferentsii (17-19 iyunya 2009 goda, Moskva), eds. Grigorev Oleg Mikhailovich, Zaitsev Dmitrii Vladimirovich, Ivlev Yurii Vasilevich, Markin Vladimir Ilich, Sovremennye tetradi, 2009, 39–41

   2006
4. A. V. Chagrov, L. A. Chagrova, “Krakh algoritmicheskoi problematiki teorii sootvetstviya?”, Logicheskie issledovaniya, 13 (2006), 248–272  mathscinet  zmath  elib
5. A. Chagrov, L. Chagrova, “The truth about algorithmic problems in correspondence theory”, Advances in Modal Logic, 6, College Publications, London, 2006, 121–138  mathscinet  zmath  elib  scopus

   2004
6. A. V. Chagrov, L. A. Chagrova, “Ob algoritmicheskoi probleme propozitsionalnoi opredelimosti formul pervogo poryadka v semantike formalnoi logiki A.Vissera”, Trudy nauchno-issledovatelskogo seminara Logicheskogo tsentra Instituta filosofii RAN, 17, Izd-vo RAN, Moskva, 2004, 94–102  mathscinet  zmath
7. A. V. Chagrov, L. A. Chagrova, “Algoritmicheskaya problema modalnoi opredelimosti formul pervogo poryadka s ogranicheniyami na chislo peremennykh v modalnykh propozitsionalnykh formulakh”, v sbornike Sovremennaya logika: Problemy teorii, istorii i primeneniya v nauke, Materialy VIII Obscherossiiskoi nauchnoi konferentsii (24-26 iyunya 2004g, Sankt-Peterburg), Izd-vo SPbGU, 2004, 544–546

   2003
8. A. V. Chagrov, L. A. Chagrova, “O semantike Kripke so vzryvayuschimisya mirami dlya bazisnoi logiki”, Chetvertye Smirnovskie chteniya po logike. Materialy mezhdunarodnoi nauchnoi konferentsii (28-30 maya 2005 goda, Moskva), IF RAN, 2003, 53–54

   2002
9. A. V. Chagrov, L. A. Chagrova, “O dvukh vidakh semantiki Kripke dlya bazisnoi logiki A.Vissera”, Trudy nauchno-issledovatelskogo seminara Logicheskogo tsentra Instituta filosofii RAN, 16, Izd-vo RAN, Moskva, 2002, 112–116  mathscinet  zmath
10. A. V. Chagrov, L. A. Chagrova, “Algoritmicheskaya problema pervoporyadkovoi opredelimosti intuitsionistskikh formul na konechnykh shkalakh Kripke”, Materialy yubileinoi nauchnoi konferentsii «Rossiiskoi matematike — trista let» (Tver), Izd-vo Tverskogo gos. un-ta, Tver, 2002, 115–120

   2001
11. A. V. Chagrov, L. A. Chagrova, “Pervoporyadkovaya opredelimost intuitsionistskikh formul na konechnykh shkalakh kripke: algoritmicheskii aspekt”, Treti Smirnovskie chteniya po logike. Materialy mezhdunarodnoi nauchnoi konferentsii. (24-27 maya 2001 goda, Moskva), 2001, 71–75

   1998
12. L. Chagrova, “On the degree of neighborhood incompleteness of normal modal logics”, Advances in Modal Logic, 1, CSLI Publications, Stanford, 1998, 63–72  mathscinet  zmath

   1995
13. A. Chagrov, L. Chagrova, “Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames”, Studia Logica, 55:3 (1995), 421–448  crossref  mathscinet  zmath  elib  scopus 5
14. D. de Jongh, L. A. Chagrova, “The decidability of dependency in intuitionistic propositional logic”, Journal of Symbolic Logic, 60:2 (1995), 498–504  crossref  mathscinet  zmath 9

   1993
15. D. de Jongh, L. A. Chagrova, The Decidability of Dependency in Intuitionistic Propositional Logic, https://eprints.illc.uva.nl/id/eprint/1344/1/ML-1993-20.text.pdf, 1993
16. A. V. Chagrov, L. A. Chagrova, Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames, https://eprints.illc.uva.nl/id/eprint/1331/1/ML-1993-07.text.pdf, 1993

   1991
17. L. Chagrova, “An undecidable problem in correspondence theory”, Journal of Symbolic Logic, 56:4 (1991), 1261–1272  crossref  mathscinet  zmath 25

   1990
18. A. V. Chagrov, L. A. Chagrova, “O pervoporyadkovoi opredelimosti intuitsionistskikh formul v klasse shkal vysoty ne bolee trekh”, Konstruktsii v algebre i logike, Tver, 1990, 117–119  mathscinet

   1989
19. L. A. Chagrova, “O nerazreshimosti pervoporyadkovoi opredelimosti propozitsionalnykh formul”, Neklassicheskie logiki i ikh primenenie, seriya: Trudy nauchno-issledovatelskogo seminara po logike Instituta filosofii AN SSSR, 7, Institut filosofii AN SSSR, Moskva, 1989, 82–85
20. L. A. Chagrova, O probleme opredelimosti propozitsionalnykh formul intuitsionistskoi logiki formulami klassicheskoi logiki pervogo poryadka, dissertatsiya ... kandidata fiziko-matematicheskikh nauk : 01.01.06 / AN Moldav. SSR. In-t matematiki s VTs, Kalinin, 1989 , 143 pp.
21. L. A. Chagrova, “Undecidability of the problem of first-order definability of intuitionistic formulas”, In Russian, Algebraic-logical constructions, Collect. Sci. Works, Kalininskij Gosudarstvennyj Universitet, Kalinin, 1989, 111–116  zmath

   1987
22. L. A. Chagrova, “An algorithm for constructing a first-order equivalent in stages for disjunction-free intuitionistic formulas”, Logical-algebraic constructions, In Russian, Kalinin. Gos. Univ., Kalinin, 1987, 96–100  mathscinet  zmath

   1986
23. L. A. Chagrova, “O pervoporyadkovoi opredelimosti intuitsionistskikh formul s ogranicheniyami na vkhozhdenie svyazok”, Logicheskie metody postroeniya effektivnykh algoritmov, Izd-vo KGU, Kalinin, 1986, 135–136
24. A. V. Chagrov, L. A. Chagrova, “Razreshimost problemy antitablichnosti rasshirenii logiki Gedelya–Leba”, Logicheskie metody postroeniya effektivnykh algoritmov, Izd-vo KGU, Kalinin, 1986, 126–129

   1985
25. L. A. Chagrova, “O ΣΔ-elementarnosti superintuitsionistskikh logik”, Slozhnostnye problemy matematicheskoi logiki, Izd-vo KGU, Kalinin, 1985, 90–94  mathscinet  zmath

   1984
26. L. A. Chagrova, “O razreshimosti protivorechivykh po Kripke modalnykh logik”, Sedmaya Vsesoyuznaya konferentsiya po matematicheskoi logike. , tezisy, Tezisy dokladov, seriya Vsesoyuznaya konferentsiya po matematicheskoi logike (Novosibirsk: Institut matematiki Sibirskogo otdeleniya AN SSSR), 1984, 194

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024