Larisa Maksimova

Larisa Lvovna Maksimova (Russian: Лариса Львовна Максимова, born 1943) is a Russian mathematical logician known for her research in non-classical logic.

Education and career

Maksimova was born on November 5, 1943, near Novosibirsk, the daughter of two biologists who had temporarily moved there from Tomsk State University to escape the war. She grew up in Novosibirsk, where her parents became geographers at the Novosibirsk Pedagogical Institute. She studied mechanics and mathematics at Novosibirsk State University, publishing her first paper on Wilhelm Ackermann's axioms for strict implication in relevance logic in 1964 and graduating in 1965.[1]

Meanwhile, in 1964, she joined the Sobolev Institute of Mathematics, and has remained there for the rest of her career. She defended her doctorate at Novosibirsk State University in 1968, a year after the death of her primary mentor at the university, Anatoly Maltsev. She completed a habilitation at the Sobolev Institute in 1986, and was promoted to full professor in 1993.[1]

Contributions

Maksimova's books include

• Problems in Set Theory, Mathematical Logic and the Theory of Algorithms (with Igor Lavrov, Izdat Nauka, 1975, 1984, and 1995; translated into English by Valentin Shehtman, Kluwer, 2003)[2]
• Interpolation and Definability: Modal and Intuitionistic Logics (with Dov Gabbay, Clarendon Press, 2005)[3]

Recognition

Maksimova won the Maltsev Prize of the Russian Academy of Sciences in 2009, for her papers on definability and interpolation in non-classical logic.[4] With several others from the Sobolev Institute, she won the Russian Federation Government Prize in Education in 2010.[5] She is the subject of a festschrift, Larisa Maksimova on Implication, Interpolation, and Definability (Sergei Odintsov, ed., Springer, 2018).

References

1. Maksimova, Larisa (2018), "A short scientific autobiography", in Odintsov, Sergei (ed.), Larisa Maksimova on Implication, Interpolation, and Definability, Springer, pp. 21–32, doi:10.1007/978-3-319-69917-2_2
2. Reviews of Problems in Set Theory, Mathematical Logic and the Theory of Algorithms:
   • Baldwin, John T. (June 2004), Bulletin of Symbolic Logic, 10 (2): 222–223, doi:10.1017/s1079898600004005CS1 maint: untitled periodical (link)
   • Mendelson, Elliott (April 2005), Studia Logica, 79 (3): 409–410, doi:10.1007/s11225-005-3613-8, JSTOR 20016698CS1 maint: untitled periodical (link)
   • Palka, Ewa (November 2005), Studia Logica, 81 (2): 283–285, doi:10.1007/s11225-005-3707-3, JSTOR 20016745CS1 maint: untitled periodical (link)
3. Review of Interpolation and Definability:
   • Plotkin, J. M. (2006), Mathematical Reviews, doi:10.1093/acprof:oso/9780198511748.001.0001, ISBN 9780198511748, MR 2153890CS1 maint: untitled periodical (link)
4. Премия имени А.И. Мальцева [Prize named after A. I. Maltsev] (in Russian), Russian Academy of Sciences, retrieved 2018-11-07
5. Winners of awards, Sobolev Institute of Mathematics, retrieved 2018-11-07