RUS  ENG
Full version
PEOPLE

Mints Grigorii Efroimovich

Publications in Math-Net.Ru

  1. Logical equations in monadic logic

    Zap. Nauchn. Sem. POMI, 358 (2008),  251–270
  2. Intuitionistic frege systems are polynomially equivalent

    Zap. Nauchn. Sem. POMI, 316 (2004),  129–146
  3. A method of epsilon substitution for the predicate logic with equality

    Zap. Nauchn. Sem. POMI, 220 (1995),  93–122
  4. A normal form theorem for second-order classical logic with an axiom of choice

    Izv. Akad. Nauk SSSR Ser. Mat., 52:3 (1988),  581–600
  5. The completeness of structural synthesis rules

    Dokl. Akad. Nauk SSSR, 263:2 (1982),  291–295
  6. A primitive recursive bound of strong normalization for predicate calculus

    Zap. Nauchn. Sem. LOMI, 88 (1979),  131–136
  7. A new reduction sequence for arithmetic

    Zap. Nauchn. Sem. LOMI, 88 (1979),  106–130
  8. Closed categories and the theory of proofs

    Zap. Nauchn. Sem. LOMI, 68 (1977),  83–114
  9. The universality of the canonical tree

    Dokl. Akad. Nauk SSSR, 227:4 (1976),  808–811
  10. What can be done with PRA?

    Zap. Nauchn. Sem. LOMI, 60 (1976),  93–102
  11. Proof theory (arithmetic and analysis)

    Itogi Nauki i Tekhniki. Ser. Algebra. Topol. Geom., 13 (1975),  5–49
  12. Finite investigation of infinite derivations

    Zap. Nauchn. Sem. LOMI, 49 (1975),  67–122
  13. Finite investigation of infinite derivations

    Zap. Nauchn. Sem. LOMI, 49 (1975),  51–66
  14. On $E$-theorems

    Zap. Nauchn. Sem. LOMI, 40 (1974),  110–118
  15. Heytiag predicate calculus with $\varepsilon$-symbol

    Zap. Nauchn. Sem. LOMI, 40 (1974),  101–109
  16. The Skolem method in intuitionistic calculi

    Trudy Mat. Inst. Steklov., 121 (1972),  67–99
  17. Cut-elimination theorem for relevant logics

    Zap. Nauchn. Sem. LOMI, 32 (1972),  90–97
  18. Derivability of admissible rules

    Zap. Nauchn. Sem. LOMI, 32 (1972),  85–89
  19. Exact estimates for provability of the rule of transfinite induction in initial parts of arithmetic

    Zap. Nauchn. Sem. LOMI, 20 (1971),  134–144
  20. Quantifier-free and one-quantifier systems

    Zap. Nauchn. Sem. LOMI, 20 (1971),  115–133
  21. On semantics of modal logic

    Zap. Nauchn. Sem. LOMI, 16 (1969),  147–151
  22. A computer algorithm for establishing deducibility, based on the inverse method

    Zap. Nauchn. Sem. LOMI, 16 (1969),  8–19
  23. Solvability of the problem of deducibility in LJ for a class of formulas which do not contain negative occurrences of quantors

    Trudy Mat. Inst. Steklov., 98 (1968),  121–130
  24. The construction of conservative logical inferences

    Trudy Mat. Inst. Steklov., 98 (1968),  112–120
  25. Some calculi of modal logic

    Trudy Mat. Inst. Steklov., 98 (1968),  88–111
  26. The independence of postulates of natural calculi

    Zap. Nauchn. Sem. LOMI, 8 (1968),  192–195
  27. Permissible and derivable rules

    Zap. Nauchn. Sem. LOMI, 8 (1968),  189–191
  28. A disjunctive interpretation of the $LJ$ calculus

    Zap. Nauchn. Sem. LOMI, 8 (1968),  182–188
  29. The implicative complexity of axiomatics

    Zap. Nauchn. Sem. LOMI, 8 (1968),  175–181
  30. Cut-free calculi of the $S5$-type

    Zap. Nauchn. Sem. LOMI, 8 (1968),  166–174
  31. On embedding operations

    Zap. Nauchn. Sem. LOMI, 4 (1967),  160–167
  32. Embedding operations related to the S. Kripke's "semantics"

    Zap. Nauchn. Sem. LOMI, 4 (1967),  152–159
  33. Varying of proof search tactics in sequenzen-calculi

    Zap. Nauchn. Sem. LOMI, 4 (1967),  134–151
  34. Analog of the Herbrand's theorem for the intuitionistic predicate calculus

    Zap. Nauchn. Sem. LOMI, 4 (1967),  123–133
  35. Choice of terms in quantifier rules of the intuitionistic pridicate calculus

    Zap. Nauchn. Sem. LOMI, 4 (1967),  112–122
  36. Herbrand's theorem for calculus of predicates with equality and functional symbols

    Dokl. Akad. Nauk SSSR, 169:2 (1966),  273–275
  37. The method of Skolem for the elimination of positive quantifiers in sequential calculi

    Dokl. Akad. Nauk SSSR, 169:1 (1966),  24–27
  38. Insolvability in the constructive calculus of predicates of certain classes of formulae containing only one-place predicate variables

    Dokl. Akad. Nauk SSSR, 163:2 (1965),  295–297
  39. On predicate and operator variants of the formation of the theories of constructive mathematics

    Trudy Mat. Inst. Steklov., 72 (1964),  383–436
  40. A generalization of the theorems of V. I. Glivenko and G. Kreisel to a class of formulae of the predicate calculus

    Dokl. Akad. Nauk SSSR, 152:3 (1963),  553–554
  41. On the predicate of differentiability and the differentiation operator in constructive mathematical analysis

    Dokl. Akad. Nauk SSSR, 147:5 (1962),  1032–1034
  42. An analogue of Herbrand's theorem for the constructive predicate calculus

    Dokl. Akad. Nauk SSSR, 147:4 (1962),  783–786

  43. Nikolai Aleksandrovich Shanin (obituary)

    Uspekhi Mat. Nauk, 68:4(412) (2013),  173–176
  44. Mikhail Abramovich Taitslin (1936–2013)

    Sib. Èlektron. Mat. Izv., 10 (2013),  54–65
  45. Nikolai Aleksandrovich Shanin (on his 80th birthday)

    Uspekhi Mat. Nauk, 56:3(339) (2001),  181–184
  46. Nikolai Aleksandrovich Shanin (on his seventieth birthday)

    Uspekhi Mat. Nauk, 45:1(271) (1990),  205–206
  47. Sergei Yur'evich Maslov (obituary)

    Uspekhi Mat. Nauk, 39:2(236) (1984),  129–130
  48. Nikolai Aleksandrovich Shanin (on his sixtieth birthday)

    Uspekhi Mat. Nauk, 35:2(212) (1980),  241–245
  49. Corrigenda and addenda to the article “On predicate and operator variants of the formation of the theories of constructive mathematics”

    Trudy Mat. Inst. Steklov., 93 (1967),  257–258


© Steklov Math. Inst. of RAS, 2025