Skip to main content
SpringerLink
Log in

Mathematical Logic in the Former Soviet Union: Brief History and Current Trends

  • Chapter
Logic and Scientific Methods

Part of the book series: Synthese Library ((SYLI,volume 259))

Abstract

Scientific life in the former Soviet Union (for short: fSU), as well as life in general, has changed drastically in recent years.1 Those changes are not specific for Mathematical Logic but without taking them into consideration, our situation in ML cannot be understood properly.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Action and Norm (Logical and Onthological Aspects of the Theory of Action) (collection of papers). Kiev, 1995 (in Russian: Deistvie i norma (logicheskie i ontologicheskie aspekty teorii deistviya)).

    Google Scholar 

  2. Adyan S.I., Makanin G.S. Investigations on algorithmic questions of algebra. Proc. Steklov Inst. Math., 3 (1986), 207–226.

    Google Scholar 

  3. Archangelski D.A., Dekhtyar M.I., Kruglov E., Musikaev I.Kh., Taitslin M.A. Concurrency problem for Horn fragment of Girard’s linear logic. LN in CS, 813 (1994), 18–22.

    Google Scholar 

  4. Archangelski D.A., Taitslin M.A. Linear logic with fixed resources. Ann. Pure and Appl. Logic, 67 (1994), 3–28.

    Article  Google Scholar 

  5. Arslanov M.M. On the structure of degrees below O’. LN in Math., 1432 (1990), 23–32.

    Google Scholar 

  6. Arslanov M.M., Lempp L., Shore R.A. Interpolating d-r.e. and REA degrees between r.e. degrees. Ann. Pure and Appl. Logic, 1995, to appear.

    Google Scholar 

  7. Arslanov M.M., Lempp L., Shore R.A. On isolating r.e. and isolated d.-r.e. degrees. Proc. of London Math. Society, 1995, to appear.

    Google Scholar 

  8. Artemov S.N. Logic of proofs. Ann. Pure and Appl. Logic, 67 (1994), 29–59.

    Article  Google Scholar 

  9. Artemov S.N, Chuprina A.V. Logic of proofs with complexity operators. University of Amsterdam, ILLC Research report ML-94–07, 1994. Proc. Int. Conf. on Logic and Algebra in Memory of R.Magari, Siena, 1994, to appear.

    Google Scholar 

  10. Artemov S.N., Krupski V.N. Data storage interpretation of labeled modal logic. Techn. Rep. IAM 95–002, University of Berne (1995), Ann. Pure and Appl. Logic, to appear.

    Google Scholar 

  11. Artemov S.N., Montagna F. On first order theories with provability operator. J. Symb. Logic, 59 (1994), no.4, 1139–1153.

    Article  Google Scholar 

  12. Badaev S.A. Minimal numberings of positively computable families. Algebra i Logika, 33 (1994), no.4, 13–28 (in Russian).

    Google Scholar 

  13. Barzdins G. Inductive synthesis of term rewriting systems. LN in CS, 502 (1991), 253–285.

    Google Scholar 

  14. Barzdins J., Brazma A., Kinber E. Models of inductive syntactical synthesis. Machine Intelligence, 12 (1991), 139–148.

    Google Scholar 

  15. Beklemishev L.D. Provability logics for natural Turing progressions of arithmetical theories. Studia Logica, 50 (1991), 107–128.

    Article  Google Scholar 

  16. Beklemishev L.D. Iterated local reflection vs iterated consistency. Utrecht Research Inst. for Philosophy, Logic Group Preprint Series, no.118, 1994.

    Google Scholar 

  17. Belegradek O.V. Quasiunitriangular groups. J. Symb. Logic, 58 (1993), no.1, 205–218.

    Article  Google Scholar 

  18. Belegradek O.V. On the model theory of unitriangular groups. Ann. Pure and Appl. Logic, 68 (1994), 225–261.

    Article  Google Scholar 

  19. Bezhanishvili G. The lattice of quantified extensions of the three-valued intermediate propositional logic. Proc. LFMPS’95, to appear.

    Google Scholar 

  20. Bulitko V.K. On characterizing complete sets. Izvestiya Akademii Nauk SSSR, ser. Matematicheskaya, 55 (1991), no.2, 227–253 (in Russian). English translation: Mathematics of the USSR: Izvestija 38 (1992), no.2, 225–249.

    Google Scholar 

  21. Bulitko V.K. On some complexity characteristics of immune sets. Math. Logic Quarterly, 41 (1995), no.3, to appear.

    Google Scholar 

  22. Chagrov A.V. Decidable modal logic with undecidable problem of admissibility for inference rules. Algebra i Logika, 31 (1992), no.1, 83–93 (in Russian). English translation: Algebra and Logic, 31 (1992), no.1, 53–61.

    Article  Google Scholar 

  23. Chagrov A., Zakharyaschev M. The undecidability of the disjunction property of propositional logics and the other related problems. J. Symb. Logic, 58 (1993), 967–1002.

    Article  Google Scholar 

  24. Chagrov A., Zakharyaschev M. On the independent axiomatizability of modal and intermediate logics. J. Logic and Computation, 1995, to appear.

    Google Scholar 

  25. Chagrova L.A. An undecidable problem in correspondence theory. J. Symb. Logic, 56 (1991), no.4, 1261–1272.

    Article  Google Scholar 

  26. Cucu I.V., Ratsa M.F. Parametric completeness in the logic of simpliest pseudoBoolean algebra with incomparable elements. Buletinul Academie de Ştiinţe a Republicii Moldova. Matematica, 1992, no.1, 46–51 (in Russian).

    Google Scholar 

  27. Dantsin E. Probabilistic logic programs and their semantics. LN in CS, 592 (1992), 152–164.

    Google Scholar 

  28. Dantsin E. Randomized proofs in arithmetic. Zapiski Nauchnykh Seminarov POMI, 220 (1995), 49–71 (in Russian).

    Google Scholar 

  29. Degtev A.N. A problem of P. Odifreddi. Sibirskii Matematicheskii Zhurnal, 30 (1989), no.1, 185–187 (in Russian). English translation: Siberian Mathematical Journal, 30 (1989), no.1, 144–146.

    Google Scholar 

  30. Dobritsa V.P. Computable semilattices of indexations for classes of constructive models. Matematicheskie Zametki, 55 (1994), no.5, 43–50 (in Russian).

    Google Scholar 

  31. Dzhaparidze G.K. Provability logic with modalities for arithmetical complexities. Bull. Acad. Sci. Georgian SSR, 138 (1990), no.3, 481–484. An extended version of that work is: Dzhaparidze G. The logic of the arithmetical hierarchy. Ann. Pure and Appl. Logic, 66 (1994), 89–112.

    Google Scholar 

  32. Ershov Yu.L. Theory of domains and nearby. LN in CS, 735 (1993), 1–7.

    Google Scholar 

  33. Ershov Yu.L. RC*-fields. Algebra i Logika, 33 (1994), no.4, 367–386 (in Russian).

    Article  Google Scholar 

  34. Ershov Yu.L. Fields with continuous locally elementary properties, I, II. Algebra i Logika, 33 (1994), no.6, 628–653;

    Google Scholar 

  35. Ershov Yu.L. Fields with continuous locally elementary properties, I, II. Algebra i Logika, 34, 1995, no.3, 262–273 (in Russian).

    Article  Google Scholar 

  36. Ershov Yu.L. Definability in hereditary finite superstructures. Doklady Akademii Nauk, 340 (1995), no.1, 12–14 (in Russian).

    Google Scholar 

  37. Ershov Yu.L. Nice local-global fields. Doklady Akademii Nauk, 1995, to appear (in Russian) .

    Google Scholar 

  38. Ershov Yu.L. Model theory of nice global fields. Vol. Abstracts, 10th Int. Congress of LMPS, Florence, 1995, p.72.

    Google Scholar 

  39. Esakia L. Amended intuitionistic logic and formal provability. Proc. LFMPS’95, 1995, to appear.

    Google Scholar 

  40. Fedoryaev S.T. Countability of widths of algebraic reducibility structures for models in some classes. Siberian Adv. Math., 3 (1993), no.2, 81–102.

    Google Scholar 

  41. Fermuller C., Leitsch A., Tammet T., Zamov N. Resolution methods for the decision problem. LN in AI, 679 (1993).

    Book  Google Scholar 

  42. “Foundations and mathematical logic”. In: Istoriya Otechestvennoi Matematiki, 4, book 2, Naukova dumka, Kiev, 1970, 392–454 (in Russian).

    Google Scholar 

  43. Freivalds R. Complexity of probabilistic versus deterministic automata. LN in CS, 502 (1991), 565–613.

    Google Scholar 

  44. Freivalds R., Jain S. Kolmogorov numberings and minimal identification. LN in CS, 904 (1995), 182–195.

    Google Scholar 

  45. Freivalds R., Karpinski M. Lower space bounds for randomized computation. LN in CS, 820 (1994), 580–592.

    Google Scholar 

  46. Freivalds R., Kinber E., Smith C.H. On the intrinsic complexity of learning. LN in CS, 904 (1995), 154–168.

    Google Scholar 

  47. Freivalds R., Smith C.H. On the role of procrastination in machine learning. Information and Computation, 107 (1993), no.2, 237–271.

    Article  Google Scholar 

  48. Gabbay D., Shehtman V.B. Undecidability of modal and intermediate first-order logics with two individual variables. J. Symb. Logic, 58 (1993), no.3, 800–823.

    Article  Google Scholar 

  49. Gomolko A.L. Negation as inconsistency. LN in CS, 832 (1994), 128–138.

    Google Scholar 

  50. Goncharov S.S. Positive computable numberings. Doklady Akademii Nauk, 332 (1993), no.2, 142–143 (in Russian). English translation: Russian Academy of Sciences: Doklady. Mathematics, 48 (1994), no.2, 268–270.

    Google Scholar 

  51. Goncharov S.S. A unique positive numbering. Siberian Adv. Math., 4 (1994), no.1, 52–64.

    Google Scholar 

  52. Gordon E.I. Reals in Boolean-valued models of set theory and K-spaces. Doklady Akademii Nauk SSSR, 237 (1977), no.4, 773–775 (in Russian). English translation: Soviet Mathematics Doklady, 18 (1977), no.6, 1481–1484.

    Google Scholar 

  53. Gordon E.I. Nonstandard analysis and compact abelian groups. Sibirskii Matematicheskii Zhurnal, 32 (1991), no.2, 26–40 (in Russian). English translation: Siberian Mathematical Journal, 32 (1991), no.1, 197–209.

    Google Scholar 

  54. Gordon E.I. Nonstandard analysis and locally compact abelian groups. Acta Appl. Math., 25 (1991), 221–239.

    Google Scholar 

  55. Hrushovski E., Zilber B.I. Zariski geometries. Bull. AMS, 28 (1993), 315–323.

    Article  Google Scholar 

  56. Jockusch C.G., Jr., Shore R.A. Pseudo-jump operators II. J. Symb. Logic, 49 (1984), 1205–1236.

    Article  Google Scholar 

  57. Kanovei V.G. Undecidable hypotheses in Edward Nelson’s internal set theory. Russ. Math. Surveys, 46 (1991), no.6, 1–54.

    Article  Google Scholar 

  58. Kanovei V.G. Uniqueness, collection, and external collapse of cardinals in IST and models of Peano arithmetic. J. Symb. Logic, 60 (1995), no.1, 318–324.

    Article  Google Scholar 

  59. Kanovei V.G., Reeken M. Internal approach to external sets and universies. Studia Logica, 54 (1995), no.5, no.6; 55 (1996), no.4, to appear.

    Google Scholar 

  60. Kanovich M.I. The multiplicative fragment of linear logic is NP-complete. University of Amsterdam, ITLI Technical Report X-91–13, 1991.

    Google Scholar 

  61. Kanovich M.I. Petri nets, Horn programs, linear logic, and vector games. Ann. Pure and Appl. Logic, 75 (1995), 105–135.

    Article  Google Scholar 

  62. Kasymov N.Kh. On algebras over negative equivalences. Algebra i Logika, 1995, to appear (in Russian).

    Google Scholar 

  63. Kopylov A.P. Decidability of linear affine logic. CNRS, Laboratoire de Math. Discrètes, Pretirage 94–32, 1994.

    Google Scholar 

  64. Kratko M.I., Khruzin A.N. Unsolvability of certain problems in the theory of Redding automata. Doklady Akademii Nauk, 329 (1993), no.4, 416–418 (in Russian). English translation: Russian Academy of Sciences: Doklady. Mathematics, 47 (1993), no.2, 285–288.

    Google Scholar 

  65. Kriaciukas V. Nonclassical models for logic programs. LN in AI, 567 (1991), 179–190.

    Google Scholar 

  66. Kudaibergenov K.Zh. Homogeneous models of stable theories. Siberian Adv. Math., 3 (1993), no.3, 1–33.

    Google Scholar 

  67. Kusraev A.G., Kutateladze S.S. Nonstandard Methods in Analysis. Kluwer Acad. Publ., 1994.

    Book  Google Scholar 

  68. “Alexandr Vladimirovich Kuznetsov (obituary)” Russ. Math. Surveys, 41 (1986), no.2, 185–187.

    Google Scholar 

  69. Li M., Vitányi P. An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, N.Y. e.a., 1993.

    Book  Google Scholar 

  70. Logic and Problems of Rationality (collection of papers). Kiev, 1993 (in Russian: Logika i problemy ratsional’nosti).

    Google Scholar 

  71. Lorents P. Algebraic framework for knowledge acquisition. Technical report. TRITA-ITR-93:10, ISSN 1103–534X, ISRN KTH/IT/R-93/10-SE. December 1993.

    Google Scholar 

  72. Lyubetsky V.A. Heyting valued analysis: P. Novikov’s hypothesis. Contemporary Math., 131 (1992), part 1, 565–583.

    Article  Google Scholar 

  73. Lyubetsky V.A. Transfer theorems and modal operators. Logicheskie Issledovaniya, 3, Nauka, Moscow, 1995, 210–235 (in Russian).

    Google Scholar 

  74. Maksimova L.L. Amalgamation and interpolation in normal modal logics. Studia Logica, 50 (1991), no.3/4.

    Article  Google Scholar 

  75. Maksimova L.L. An analogue of Beth’s theorem in normal extensions of the modal logic K4. Sibirskii Matematicheskii Zhurnal, 33 (1992), no.6, 118–130 (in Russian). English translation: Siberian Mathematical Journal, 33 (1993), no.6, 1052–1065.

    Google Scholar 

  76. Maksimova L.L. Definability and interpolation in classical modal logic. Contemporary Mathematics, 131 (1992), part 3, 583–599.

    Article  Google Scholar 

  77. “Anatolii Ivanovich Mal’tsev (obituary)” Uspekhi Matematich. Nauk, 23 (1968), no.3, 159–170 (in Russian). English translation: Russian Mathematical Surveys, 23 (1968), no.3, 157–168.

    Google Scholar 

  78. Marandjian H.B. Selected Topics in Recursive Function Theory in Computer Science. DTH, Lyngby, 1990.

    Google Scholar 

  79. Marandjian H.B. General form recursive equations I. LN in CS, 1995, to appear.

    Google Scholar 

  80. Marchenkov S.S. Basis by superposition for classes of recursive functions. Matematicheskie Voprosy Kibernetiki, issue 3, Nauka, Moskow, 1991, 115–139 (in Russian).

    Google Scholar 

  81. “Andrei Andreevich Markov (on his 60-th birthday)” Russ. Math. Surveys, 19 (1964), no.3, 181–196.

    Google Scholar 

  82. “Andrei Andreevich Markov (on his seventieth birthday)”. Russ. Math. Surveys, 29 (1974), no.6, 171–175.

    Google Scholar 

  83. Matiyasevich Yu.V. Hilbert’s 10th Problem. MIT Press, 1993.

    Google Scholar 

  84. Meskhi V. Heyting Algebras with a Regular Involution. Metsniereba, Tbilisi, 1990 (in Russian: Algebry Geitinga s regulyarnoi involyutsiyei).

    Google Scholar 

  85. Molchanov V.A. Nonstandard extensions of uniform algebraic systems. Sibirskii Matematicheskii Zhurnal, 35 (1994), no.5, 1094–1105 (in Russian).

    Google Scholar 

  86. Musikaev I.Kh., Taitslin M.A. Limitations of the program memory and the expressive power of dynamic logics. Information and Computation, 103 (1993), no.2, 195–203.

    Article  Google Scholar 

  87. Nogina E.Yu. Logic of proofs with the strong provability operator. University of Amsterdam, ILLC Research report ML-94–10, 1994.

    Google Scholar 

  88. “Petr Sergeevich Novikov (on his seventieth birthday)” Uspekhi Matematicheskikh Nauk, 26 (1971), no.5, 231–242 (in Russian). English translation: Russian Mathematical Surveys, 26 (1971), no.5, 165–176.

    Google Scholar 

  89. Omarov A.I. Syntactical description of filtered formulas. Soviet Math. Dokl., 139 (1991), no.1, 58–61.

    Google Scholar 

  90. Omelyanchik V.I. Logical Foundations of Modal Realism. Kiev, 1993 (in Russian: Logicheskie osnovaniya modal’nogo realizma).

    Google Scholar 

  91. Orevkov V.P. Complexity of Proofs, and their Transformations in Axiomatic Theories. AMS translations, 128 (1993).

    Google Scholar 

  92. Pentus M. Lambek grammars are context free. Proc. of the 8th Symposium LICS’93, IEEE Computer Society Press, Montreal, 1993.

    Google Scholar 

  93. Pentus M. Lambek calculus is L-complete. Proc. 9th Symposium LICS’94, IEEE Computer Society Press, Paris, 1994.

    Google Scholar 

  94. Pentus M. Models for the Lambek calculus. Ann. Pure and Appl. Logic, 75 (1995), 177–212.

    Article  Google Scholar 

  95. Peretyat’kin M.G. Expressive power of finitely axiomatizable theories. Parts I, II, III. Siberian Adv. Math., 3 (1993), no.2, 153–197;

    Google Scholar 

  96. Peretyat’kin M.G. Expressive power of finitely axiomatizable theories. Parts I, II, III. Siberian Adv. Math., 3 (1993), no.3, 123–145;

    Google Scholar 

  97. Peretyat’kin M.G. Expressive power of finitely axiomatizable theories. Parts I, II, III. Siberian Adv. Math., 3 (1993), no.4, 131–201.

    Google Scholar 

  98. Plisko V. A formalization of the Tennenbaum Theorem and its applications to modified realizability and Gödel interpretation. Vol. Abstracts, 10th Int. Congress of LMPS, Florence, 1995, p.57.

    Google Scholar 

  99. Pliuskeviciene A. Gentzen-type calculi for modal logic S4 with Barcan formula. LN in AI, 592 (1991), 381–390.

    Google Scholar 

  100. Pliuskeviciene A. Specialization of derivations in Hoare-like logic with recursive procedures. Proc. Int. Conf. “Software Engineering and Knowlege Engineering”, 1994, 124–130.

    Google Scholar 

  101. Pliuskevicius R. Investigation of finitary calculus for discrete linear time logic. LN in CS, 502 (1991), 504–528.

    Google Scholar 

  102. Pliuskevicius R. On saturated calculi for linear temporal logic. LN in CS, 711 (1993), 640–649.

    Google Scholar 

  103. Pliuskevicius R. On the saturation principle for linear temporal logic. LN in CS, 713 (1993), 289–300.

    Google Scholar 

  104. Ratsa M. Expressiveness in Propositional Calculi. Shtiintsa, Kishinev, 1991 (in Russian: Vyrazimost’ v ischislenii vyskazyvanii).

    Google Scholar 

  105. Razborov A. An equivalence beetween second order bounded domain arithmetic and first order bounded arithmetic. In: Arithmetic, Proof Theory and Computational Complexity, (Clote P. and Krajicek J. eds.), Oxford University Press, 1992, 247–277.

    Google Scholar 

  106. Razborov A. Bounded Arithmetic and lower bounds in Boolean complexity. Feasible Mathematics II (1993), should have appeared.

    Google Scholar 

  107. Razborov A. On provability disjoint NP-pairs. Basic Research in CS Center, Technical Report RS-94–36, Aarhus, Denmark, 1994.

    Google Scholar 

  108. Razborov A. Unprovabilty of lower bounds on circuit size in certain fragments of Bounded Arithmetic. Izvestiya Academii Nauk, ser. Matematika, 59 (1995), no.1, 201–224.

    Google Scholar 

  109. Rybakov V.V. Logical equations and admissible rules with parameters in modal logic of provability. Studia Logica, 49 (1990), no.2, 215–239.

    Article  Google Scholar 

  110. Rybakov V.V. Intermediate logics preserving admissible inference rules of Heyting calculus. Math. Logic Quarterly, 39 (1993), 403–415.

    Article  Google Scholar 

  111. Rybakov V.V. Hereditarily structurally complete modal logics. J. Symb. Logic, 60 (1995), no.1, 266–288.

    Article  Google Scholar 

  112. Sakalauskaite J. A sequent calculus for a first order linear temporal logic with explicit time. LN in AI, 592 (1991), 442–451.

    Google Scholar 

  113. Sakalauskaite J. A sequent calculus for a first order linear temporal logic with equality. LN in AI, 620 (1992), 430–440.

    Google Scholar 

  114. Sazonov V.Yu. A logical approach to the problem P=NP? LN in CS, 88 (1980), 562–575.

    Google Scholar 

  115. Shavrukov V.Yu. A note on the diagonalizable algebras of PA and ZF. Ann. Pure and Appl. Logic, 61 (1993), 161–173.

    Article  Google Scholar 

  116. Shehtman V.B. Derived sets in Euclidean spaces and modal logic. University of Amsterdam, ITLI Prepublication Series, X-90–05, 1990.

    Google Scholar 

  117. Shehtman V.B. A logic with progressive tenses. In: Diamonds and Defaults: Studies in Pure and Applied Intensional Logic. (M. De Rijke, ed.), Kluwer Acad. Publ., 1993, 255–285.

    Google Scholar 

  118. Shehtman V.B. Sahlqvist completeness theorem in modal predicate logic. Vol. Abstracts, 10th Int. Congress of LMPS, Florence, 1995, p.173.

    Google Scholar 

  119. Sidon T. Craig interpolation property in modal logics with provability interpretations. LN in CS, 813 (1994), 329–330.

    Google Scholar 

  120. Skvortsov D.P. On finite intersections of intermediate predicate logics. Proc. Int. Conf. on Logic and Algebra in Memory of R.Magari, Siena, 1994, to appear.

    Google Scholar 

  121. Skvortsov D.P. On the predicate logic of finite Kripke frames. Studia Logica, 54 (1995), no.1, 79–88.

    Article  Google Scholar 

  122. Skvortsov D.P. Not every intermediate predicate logic over a finite frame is finitely axiomatizable. Vol. Abstracts, 10th Int. Congress of LMPS, Florence, 1995, p.175.

    Google Scholar 

  123. Skvortsov D.P., Shehtman V.B. Maximal Kripke-type semantics for modal and superintuitionistic predicate logics. Ann. Pure and Appl. Logic, 63 (1993), no.1, 69–101.

    Article  Google Scholar 

  124. Stolboushkin A.P., Taitslin M.A. Finite queries do not have effective syntax. UCLA, preprint, 1994.

    Google Scholar 

  125. Stolboushkin A.P., Taitslin M.A. Normalizable linear orders and generic computations in finite models. UCLA, preprint, 1994 (submitted to LICS’95).

    Google Scholar 

  126. Uspensky V.A. Kolmogorov and mathematical logic. J. Symb. Logic, 57 (1992), no.2, 385–412.

    Article  Google Scholar 

  127. Uspensky V., Semenov A. Algorithms: Main Ideas and Applications. Kluwer Acad. Publ., 1993.

    Book  Google Scholar 

  128. Valiev M. Π 11 -universality of some propositional logics of concurrent programs. Theor. CS, 119 (1993), 223–232.

    Article  Google Scholar 

  129. Vazhenin Yu.M. Critical theories. Sibirskii Matematicheskii Zhurnal, 29 (1988), no.1, 23–31 (in Russian). English translation: Siberian Mathematical Journal, 29 (1988), no.1, 17–23.

    Google Scholar 

  130. Vereshchagin N.K. Relationships between NP-sets, Co-NP-sets and P-sets relative to random oracles. Proc. 8th Annual IEEE Conf. on Structure in Complexity Theory, 1993, San-Diego CA, 132–138.

    Google Scholar 

  131. Vereshchagin N.K. Relativizable and non-relativizable theorems in the polynomial theory of algorithms. Izvestiya Akademii Nauk, ser. Matematicheskaya, 57 (1993), no.2, 51–90 (in Russian).

    Google Scholar 

  132. Vereshchagin N.K. NP-sets are Co-NP-immune relative to a random oracle. Proc. Third Israel Symposium on Theory of Computing and Systems, 1995, 40–45.

    Google Scholar 

  133. Vovk V.G., V’yugin V.V. On the empirical validity of the Bayesian method. J. Royal Statist. Soc. B, 55 (1993), no.1, 253–266.

    Google Scholar 

  134. Vovk V.G., V’yugin V.V. Frequential level of impossibility with some applications. J. Royal Statist. Soc. B, 56 (1994), no.1, 115–123.

    Google Scholar 

  135. V’yugin V.V. Algorithmic entropy (complexity) of finite objects and its application to defining randomness and amount of information. Selecta Mathematica (formerly Sovietica), 13 (1994), no.4, 357–389.

    Google Scholar 

  136. Yanovskaya S.A. Foundations and mathematical logic. In: Matematika v SSSR za Tridtsat’ Let, Gostekhizdat, Moscow, 1948, 11–50 (in Russian).

    Google Scholar 

  137. Yanovskaya S.A. Mathematical logic and foundations. In: Matematika v SSSR za Sorok Let, 1, Fizmatlit, Moscow, 1959, 13–120 (in Russian) .

    Google Scholar 

  138. Zakharyaschev M. Canonical formulas for K4. Part I: basic results. J. Symb. Logic, 57 (1992), 1377–1402.

    Article  Google Scholar 

  139. Zakharyaschev M. A sufficient condition fot the finite model property of modal logics above K4. Bull. of the IGPL, 1 (1993), 13–22.

    Article  Google Scholar 

  140. Zakharyaschev M., Alekseev A. The finitely axiomatizable normal extension of K4.3 are decidable. Math. Logic Quarterly, 1995, to appear.

    Google Scholar 

  141. Zilber B. Quazi-Riemann manifolds. In: Proc. Europ. Logic Coll., Kiel, 1993, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Russia

    Vladimir A. Uspensky

Authors
  1. Vladimir A. Uspensky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Florence, Italy

    Maria Luisa Dalla Chiara

  2. University of Amsterdam, The Netherlands

    Kees Doets  & Johan van Benthem  & 

  3. University of Milan, Italy

    Daniele Mundici

  4. Stanford University, USA

    Johan van Benthem

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Uspensky, V.A. (1997). Mathematical Logic in the Former Soviet Union: Brief History and Current Trends. In: Dalla Chiara, M.L., Doets, K., Mundici, D., van Benthem, J. (eds) Logic and Scientific Methods. Synthese Library, vol 259. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-0487-8_26

Download citation

  • DOI: https://doi.org/10.1007/978-94-017-0487-8_26

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4786-1

  • Online ISBN: 978-94-017-0487-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation