|
Nikolai Shanin
Nikolai Aleksandrovich Shanin (Russian: Николай Александрович Шанин) was a Soviet and Russian mathematician and the founder of a school of constructive mathematics in Leningrad (now Saint Petersburg). He was born on May 25, 1919, in Pskov, Russia, to a family of doctors and passed away on September 17, 2011, in Saint Petersburg, Russia.[1] His father, Alexander Protasyevich Shanin (Russian: Александр Протасьевич Шанин, 1886–1973[2]), was a well-known specialist in skin cancer. In 1935, N. A. Shanin entered the Faculty of Mathematics and Mechanics at Leningrad State University and began his PhD studies there in 1939. Andrey Andreyevich Markov, Jr. became his supervisor, while his second supervisor was Pavel Sergeyevich Alexandrov. Markov’s ideas and personality had a decisive influence on the development of Shanin’s research interests. In 1942, he defended his PhD dissertation, “On the Extension of Topological Spaces,” and in 1946, his D.Sc. dissertation, “On the Product of Topological Spaces.” From 1941 to 1945, during the war between the USSR and Germany, Shanin served in the Red Army. In October 1945, he became a senior research fellow at the Steklov Mathematical Institute of the USSR Academy of Sciences in the Leningrad (later Saint Petersburg) division (LOMI/POMI),[3] where he worked until the end of his life. While working at the Academy of Sciences, he also taught for many years at Leningrad (later Saint Petersburg) State University in the Faculty of Mathematics and Mechanics—where he became a professor in 1957—as well as in the Faculty of Philosophy. Shanin’s research activity can be divided into two periods: topological and logical-constructivist.[4] The first period lasted until the late 1940s. His contributions to general topology[5] remained influential for many years.[6] The second period, which lasted much longer, not only produced numerous scientific results but also led to the formation of a major Leningrad school of mathematical logic and proof theory. This work extended into areas such as computability (e.g., Yuri Matiyasevich[7]), algorithmics, computational complexity,[8] and the application of computers to mathematical research.[9][10] For A. A. Markov Jr. and later N. A. Shanin, the ineffectiveness of purely existential theorems was a source of "discomfort" in the foundations of mathematics, making the ideas of intuitionism particularly appealing. N. A. Shanin began by generalizing the approach of A. N. Kolmogorov[11] and K. Gödel[12] on embedding operations that transform a formula F of classical logic into a formula Fᶜ' of intuitionistic (constructive) logic, such that Fᶜ' is deducible in intuitionistic logic if and only if F is deducible in classical logic. Moreover, this transformation aimed to preserve the syntax of F as much as possible. Shanin developed a series of sophisticated and general operations and, in particular, described classes of classical formulas containing ∃ and ∨ that remain deducible in intuitionistic logic without modification.[13] This paper[13] was among the first works on intuitionistic logic (a term often replaced by "constructive" logic, in part for political reasons) in the USSR and significantly influenced research in the field. Later, Shanin applied his ideas to other formal systems. N. A. Shanin’s next area of research focused on constructive semantics and was also influenced by intuitionism. However, the semantics of intuitionism was somewhat vague. The first rigorous semantics for intuitionistic logic was S. C. Kleene’s realizability.[14] According to Kleene, a formula ∀x∃y A(x,y) is true if there exists an algorithm that, for each x, constructs y such that A(x,y) holds. In Kleene’s realizability, however, the transformed formula is not necessarily simpler than the original one. Shanin introduced a procedure (algorithm) known as the **elicitation of constructive problems**,[15] which reduces the initial formula to a formula of the form ∃x1...∃xkF , where F contains neither ∃ nor ∨. Due to embedding operations, it then suffices to prove F within classical logic. This procedure significantly facilitated communication between the Russian constructivist school and constructivists in the West, particularly intuitionists. Kleene later observed[16] that, in purely logical terms, Shanin’s algorithm follows from just two principles: Markov's principle and a variant of the Church–Turing thesis. Further development of these ideas led to a **finitary** approach (in the sense of Hilbert) to constructive mathematics.[17] Building on constructive semantics, N. A. Shanin began, in the mid-1950s, a revision of classical mathematics—particularly calculus and functional analysis—from a constructivist perspective.[18][19] A priori, it is not obvious which notion of a computable real number is the most productive. Shanin defined a **constructive real number** as a "duplex," where both rational approximations and the rate of convergence are given by algorithms, and demonstrated that this approach is effective. Similar algorithmic approaches to real numbers were later developed in the West[20] (see computable number). In 1961, N. A. Shanin organized a **mathematical logic** research group at the Leningrad Department of the Steklov Mathematical Institute of the USSR Academy of Sciences. The group's initial goal was to develop and implement an algorithm for automatic theorem proving, focusing primarily on classical propositional calculus. The first three members of the group were Gennady Davydov (1939–2016), Sergey Maslov (1939–1982), and Grigory Mints (1939–2014). More researchers joined in subsequent years, including V. P. Orevkov [1], A. O. Slissenko, and Yu. V. Matiyasevich. During this period, there was widespread global enthusiasm for automatic theorem proving, particularly in pure logic. Starting from Gentzen’s sequent calculus, Shanin developed a proof search algorithm designed to produce **natural, human-friendly proofs**. He emphasized the use of heuristics and aimed to generate results in the form of **natural deduction**. The algorithm was successfully implemented[21] and demonstrated excellent performance. N. A. Shanin was a dynamic and energetic professor who excelled at explaining fundamental concepts of logic, particularly those lacking formal mathematical definitions, using simpler notions (e.g., integers). His analysis of various semantic issues had a significant influence on philosophers.[22] He had many doctoral students,[23] who work both in Russia and in other countries, including the United States and France. Further reading
References
External links
|
||||||||||||||||||||||||||||||
Portal di Ensiklopedia Dunia
