J. J. Gégalkine, “Sur le calcul des propositions dans la logique symbolique”, Sb. Math., 34:1 (1927)

Citation in format AMSBIB

\Bibitem{Geg27}

\by J.~J.~G\'egalkine

\paper Sur le calcul des propositions dans la logique symbolique

\jour Sb. Math.

\yr 1927

\vol 34

\issue 1

\mathnet{http://mi.mathnet.ru/eng/sm7433}

\zmath{https://zbmath.org/?q=an:53.0043.01}

This publication is cited in the following 8 articles:

Trifonov P., “Randomized Polar Subcodes With Optimized Error Coefficient”, IEEE Trans. Commun., 68:11 (2020), 6714–6722
Kotenko A.G., “O podkhodakh k snizheniyu vychislitelnoi slozhnosti logicheskikh zadach analiza riska”, Izvestiya Peterburgskogo universiteta putei soobscheniya, 2011, no. 1, 180–189 On approaches to reducing computational complexity of logical problems of risk analysis
Goryushkin A.P., “Ob odnoelementnoi funktsionalnoi polnote v algebre bulevykh funktsii”, Vestnik kraunts. fiziko-matematicheskie nauki, 2:1 (2011), 7–16 About 1-element functional fullness in algebra of the boolean functions
T. I. Zaripov, R. Kh. Latypov, “Uskorennye algoritmy spektralnykh preobrazovanii reshayuschikh diagramm”, Issled. po inform., 10, Otechestvo, Kazan, 2006, 19–36
V. S. Vykhovanets, “Algebraic decomposition of discrete functions”, Autom. Remote Control, 67:3 (2006), 361–392
V. S. Vykhovanets, V. D. Malyugin, “Multiplikativnaya algebra i ee primenenie v logicheskoi obrabotke dannykh”, Probl. upravl., 3 (2004), 67–77
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
Mikhalev A. Zolotykh A., “Standard Grobner-Shirshov Bases of Free Algebras Over Rings, I. Free Associative Algebras”, Int. J. Algebr. Comput., 8:6 (1998), 689–726