44 found
Order:
  1.  15
    A. A. Lápunov. O Logičéskih Shémah Programm. Problémy Kibérnétiki, Vol. 1 , Pp. 46–74. - A. A. Lyapunov. The Logical Structure of Programmes. English Translation of the Preceding. Problems of Cybernetics, Vol. 1 , Pp. 48–81. - A. A. Ljapunow. Über Logische Programm-Schemata. German Translation of the Same. Probleme der Kybernetik, Vol. 1 , Pp. 53–86. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):466-467.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  2.  4
    Asser Günter , Pp. 20–27) has Meanwhile Gone Farther and Shown, Inter Alia, the Equivalence of Kalužnin's Graph-Schematic Algorithm Concept with Asser's Functional-Algorithm Concept. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):364-364.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  10
    Asser Günter. Funktionen-Algorithmen und Graphschemata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 20–27. [REVIEW]E. M. Fels - 1963 - Journal of Symbolic Logic 28 (4):292-292.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  4.  3
    A. A. Markov. O Konstruktivnyh Funkciáh . Problémy Konstruktivnogo Napravléniá V Matématiké, 1, Sbornik Rabot, Edited by N. A. Šanin, Trudy Maté-Matičéskogo Instituta Imèni V. A. Stéklova, Vol. 52, Izdatél′Stvo Akadémii Nauk SSSR, Moscow and Leningrad1958, Pp. 315–348. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (2):255-258.
  5.  13
    A. P. Éršov. Opératornyé Algorifmy. II. Problémy Kibérnétiki, Vol. 8 , Pp. 211–233. - A. P. Jerschow. Operator-Algorithmen. II. German Translation of the Preceding by Heinz D. Modrow. Probleme der Kybernetik, Vol. 8 , Pp. 208–232. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):467.
  6.  10
    G. S. Céjtin. Associativnoé Isčslénié s Nérazréšimoj Problémoj Ekvivaléntnosti . Problémy Konstruktivnogo Napravléniá V Matématiké, 1, Sbornik Rabot, Edited by N. A. Šanin, Trudy Matématičéskogo Instituta Iméni V. A. Stéklova, Vol. 52, Izdatél'stvo Akadémii Nauk SSSR, Moscow and Leningrad1958, Pp. 172–189. [REVIEW]E. M. Fels - 1965 - Journal of Symbolic Logic 30 (2):254-255.
  7.  10
    S. Ú. Maslov. O “Tag”-Problémé E. L. Posta . Problémy Konstruktivnogo Napravléniá V Matématiké, 3, Sbornik Rabot, Edited by N. A. Šanin, Trudy Matématičéskogo Instituta Iméni V. A. Stéklova, Vol. 72, Izdatél′Stvo “Nauka,”Moscow and Leningrad1964, Pp. 57–68. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):526-527.
  8.  2
    Maslov S. Ú.. Préobrazovanié Proizvol′Nyh Kanoničéskih Isčislénij V Kanoničéskié Isčisléniá Spécial′Nyh Tipov. Doklady Akadémii Nauk SSSR, Vol. 147 , Pp. 779–782.Maslov S. Ju.. Transformation of Arbitrary Canonical Calculi Into Canonical Calculi of Special Types. English Translation of the Preceding by Gdss R. N.. Soviet Mathematics, Vol. 3 No. 6 , Pp. 1708–1711. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):527-527.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  7
    S. Ú. Maslov. Nékotoryé Svojstva Apparata Kanoničéskih Isčislénij E. L. Posta . Problémy Konstruktivnogo Napravléniá V Matématiké, 3, Sbornik Rabot, Edited by N. A. Šanin, Trudy Matématičéskogo Instituta Iméni V. A. Stéklova, Vol. 72, Izdatél′Stvo “Nauka,”Moscow and Leningrad1964, Pp. 5–56. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 32 (4):524-526.
  10.  15
    N. A. Šanin. Konstruktivnyé Véščéstvénnyé Ĉisla I Konstruktivnyé Funkcional'nyé Prostranstva . Problémy Konstrukticnogo Napravléniá V Matématik, 2 , Sbornik Rabot, Edited by N. A. Šanin, Trudy Matématičéskogo Instituta Imèni V. A. Stéklova, Vol. 67Izdatél′Stvo Akadémii Nauk SSSR, Moscow and Leningrad1962, Pp. 15–294. [REVIEW]E. M. Fels - 1969 - Journal of Symbolic Logic 34 (2):290-292.
  11.  15
    Ánov Ú. I.. O Logičéskih Shémah Algoritmov . Problémy Kibérnétiki, Vol. 1 , Pp. 75–127.E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-363.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  12.  6
    Ánov Ú. I.. О Ravnosil′Nosti I Préobrazovaniáh Shém Programm . Doklady Akadémii Nauk SSSR, Vol. 113 , Pp. 39–42.E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-391.
    Direct download (5 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  13.  9
    N. M. Nagornyj. Nékotoryé Obobščénia Ponátiá Normaľnogo Algorifma, . Problémy Konstruktivnogo Napravléniá V Matématiké, 1, Sbornik Rabot, Edited by N. A. Šanin. Trudy Matématičéskogo Instituta Iméni V. A. Stéklova, Vol. 52, Izdatéľstvo Akadémii Nauk SSSR, Moscow and Leningrad1958, Pp. 7–65. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):360-362.
  14.  39
    N. N. Vorob′Év. Novyj Algorifm Vyvodimosti V Konstruktivnom Isčislénii Uyskazyvanij . Problémy Konstruktivnogo Napravléniá V Matématiké, 1, Sbornik Rabot, Edited by N. A. Šanin, Trudy Matématičéskogo Instituta Imèni V. A. Stéklova, Vol. 52, Izdatél′Stvo Akadémii Nauk SSSR, Moscow and Leningrad1958, Pp. 193–225. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):108-109.
  15.  6
    On the Reversibility of Algorithms.E. M. Fels & V. S. Cernavskij - 1966 - Journal of Symbolic Logic 31 (4):655.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  3
    Review: A. A. Ljapuno, The Logical Structure of Programmes. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):466-467.
  17. Review: A. A. Markov, On Constructive Functions. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (2):258-258.
     
    Export citation  
     
    Bookmark  
  18.  6
    Review: A. P. Jerschow, Heinz D. Modrow, Operator Algorithmen. II. [REVIEW]E. M. Fels - 1968 - Journal of Symbolic Logic 33 (3):467-467.
  19.  5
    Review: A. P. Ersov, Operator Algorithms. I. Basic Concepts. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):364-366.
  20.  41
    Korolúk V. S.. O ponátii adrésnogo algoritma . Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 4 , pp. 95–110. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):364-366.
    Direct download (7 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  21. Review: E. S. Orlovskij, Some Questions in the Theory of Algorithms. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):108-109.
  22.  2
    Review: Gunter Asser, Funktionen-Algorithmen und Graphschemata. [REVIEW]E. M. Fels - 1963 - Journal of Symbolic Logic 28 (4):292-292.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  23. Review: G. S. Cejtin, Associative Calculus with Unsolvable Equivalence Problem. [REVIEW]E. M. Fels - 1965 - Journal of Symbolic Logic 30 (2):254-255.
     
    Export citation  
     
    Bookmark  
  24.  3
    Review: L. A. Kaluznin, On Algorithmization of Mathematical Problems. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):363-364.
  25. Review: N. A. Sanin, On the Constructive Interpretation of Mathematical Judgments. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (2):255-258.
  26.  2
    Review: N. A. Sanin, Constructive Real Numbers and Constructive Functional Spaces. [REVIEW]E. M. Fels - 1969 - Journal of Symbolic Logic 34 (2):290-292.
  27.  8
    Review: N. M. Nagornyj, Some Generalizations of the Concept of Normal Algorithm. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):360-362.
  28. Review: N. M. Nagornyj, On a Minimal Alphabet of Algorithms Over a Given Alphabet. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):108-108.
  29. Review: N. N. Vorob'ev, A New Algorithm of Deducibility in the Constructive Propositional Calculus. [REVIEW]E. M. Fels - 1964 - Journal of Symbolic Logic 29 (2):109-109.
  30.  7
    Review: N. V. Belakin, The Universality of a Computing Machine with Potentially Infinite Exterior Memory. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):366-366.
  31.  2
    Review: S. Ju. Maslov, Transformation of Arbitrary Canonical Calculi Into CanonicaL Calculi of Special Types. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (4):527-527.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32. Review: S. Ju. Maslov, Elliott Mendelson, Strong Representability of Sets by Calculi. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-392.
  33. Review: S. U. Maslov, On the "Tag" Problem of E. L. Post. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (4):526-527.
  34.  3
    Review: S. U. Maslov, Some Properties of E. L. Post's Apparatus of Canonical Systems. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (4):524-526.
    Direct download  
     
    Export citation  
     
    Bookmark  
  35. Review: S. U. Maslov, Some Methods for the Definition of Sets in Generating Bases. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):392-393.
  36.  8
    Review: U. I. Anov, On Logical Schemata of Algorithms. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-363.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  37. Review: U. I. Anov, On the Equivalence and Transformations of Program Schemata. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-391.
  38. Review: U. I. Anov, On Matrix Schemata. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-391.
  39.  7
    Review: V. K. Detlovs, The Equivalence of Normal Algorithms and Recursive Functions. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):362-362.
  40.  5
    Review: V. S. Koroluk, On the Concept of Address Algorithm. [REVIEW]E. M. Fels - 1962 - Journal of Symbolic Logic 27 (3):366-366.
  41.  3
    Review: V. S. Cernavskij, On the Reversibility of Algorithms. [REVIEW]E. M. Fels - 1966 - Journal of Symbolic Logic 31 (4):655-656.
  42.  8
    S. Ú. Maslov. O Nékotoryh Sposobah Zadaniá Množéstv V Bazisah Poroždéniá. Doklady Akadémii Nauk SSSR, Vol. 153 , Pp. 266–269. - S. Ju. Maslov. Some Methods for the Definition of Sets in Generating Bases. English Translation of the Preceding by Avner Falk. Soviet Mathematics, Vol. 4 No. 6 , Pp. 1649–1652. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):392-393.
  43.  13
    S. Ú. Maslov. О Strogoj Prédstavimosti Množéstv Isčisléniámi. Doklady Akadémii Nauk SSSR, Vol. 152 , Pp. 272–274. - S. Ju. Maslov. Strong Representability of Sets by Calculi. English Translation of the Preceding by Elliott Mendelson. Soviet Mathematics, Vol. 4 No. 5 , Pp. 1292–1295. [REVIEW]E. M. Fels - 1967 - Journal of Symbolic Logic 32 (3):391-392.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44.  15
    V. S. Čérnávskij. Ob Obratimosti Algorifmov . Trudy Moskovskogo Matématičéskogo Obščéstva, Vol. 9 , Pp. 425–453.E. M. Fels - 1966 - Journal of Symbolic Logic 31 (4):655-656.