RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Subscription
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Mat. Sb.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Mat. Sb., 1928, Volume 35, Number 3-4, Pages 311–377 (Mi msb7400)  

This article is cited in 5 scientific papers (total in 5 papers)

L'arithmétisation de la logique symbolique

J. J. Gégalkine


Full text: PDF file (5794 kB)

Bibliographic databases:


Citation: J. J. Gégalkine, “L'arithmétisation de la logique symbolique”, Mat. Sb., 35:3-4 (1928), 311–377

Citation in format AMSBIB
\Bibitem{Geg28}
\by J.~J.~G\'egalkine
\paper L'arithm\'etisation de la logique symbolique
\jour Mat. Sb.
\yr 1928
\vol 35
\issue 3-4
\pages 311--377
\mathnet{http://mi.mathnet.ru/msb7400}
\zmath{https://zbmath.org/?q=an:54.0058.02}


Linking options:
  • http://mi.mathnet.ru/eng/msb7400
  • http://mi.mathnet.ru/eng/msb/v35/i3/p311

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. E. Gorodetsky, V. V. Dubarenko, “A combinatorial method for the evaluation of probabilities of complex Boolean functions”, Comput. Math. Math. Phys., 39:7 (1999), 1201–1203  mathnet  zmath  elib
    2. A. D. Zakrevskii, “Algorithms for synthesis of polynomials implementing weakly specified boolean functions and systems”, Autom. Remote Control, 65:6 (2004), 978–996  mathnet  crossref  mathscinet  zmath  isi  elib
    3. Kotenko A.G., “O podkhodakh k snizheniyu vychislitelnoi slozhnosti logicheskikh zadach analiza riska”, Izvestiya Peterburgskogo universiteta putei soobscheniya, 2011, no. 1, 180–189  elib
    4. S. B. Gashkov, I. S. Sergeev, “A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials”, Sb. Math., 203:10 (2012), 1411–1447  mathnet  crossref  crossref  mathscinet  zmath  isi  elib
    5. E. A. Kalinina, G. M. Khitrov, “Osobennosti vektornogo prostranstva uporyadochennykh $(0,1)$-naborov iz $n$ elementov nad polem po modulyu $2$”, Vestn. S.-Peterburg. un-ta. Ser. 10. Prikl. matem. Inform. Prots. upr., 2014, no. 1, 62–71  mathnet
  • Математическiй сборникъ
    Number of views:
    This page:606
    Full text:240

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018