11 found
Order:
  1.  17
    On minimal and maximal orders of simple processes.Andrzej Rowicki - 1969 - Mathematical Logic Quarterly 15 (23-24):359-384.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  37
    Review: A. I. Mekler, Simplified Algebraic Synthesis of Relay Circuits.Andrzej Rowicki & A. I. Mekler - 1965 - Journal of Symbolic Logic 30 (1):109.
  3.  30
    T. K. Bérénds and A. A. Tal′. Pnévmatičskié réléjnyé shémy . Avtomatika i téléméhanika, vol. 20 , pp. 1483–1495.Andrzej Rowicki - 1964 - Journal of Symbolic Logic 29 (2):100-101.
  4.  48
    V. D. Urin. Uproščénnyj métod sintéza shém s šagovymi péréklúčatélámi . Avtomatika i téléméhanika, vol. 23 , pp. 52–56.Andrzej Rowicki - 1964 - Journal of Symbolic Logic 29 (1):51.
  5.  35
    Františék Svoboda. K. postroéniú péréklúčatél'nyh shém opytnym putém . Bulletin mathématique de la Société des Sciences Mathématiques et Physiques de la République Populaire Roumaine, n.s. vol. 2 no. 2 , pp. 191–201. [REVIEW]Andrzej Rowicki - 1965 - Journal of Symbolic Logic 30 (3):380.
  6.  30
    (1 other version)M. Greniewski. Algebry (m + n)-elementowe i ich zastosowania do układów przekaźnikowo-stykowych ((m + n)-element algebras and their applications to relay-contact systems). Polish, with Russian and English summaries. Zastosowania matematyki, vol. 4 no. 2 (1958), pp. 142–168. [REVIEW]Andrzej Rowicki - 1970 - Journal of Symbolic Logic 34 (4):658-659.
  7.  62
    I. Žuravlév Ú.. O névozmožnosti postroéniá minimal'nyh dizúnktivnyh normal'nyh form funkcij algébry logiki v odnom kassé algoritmov. Doklady Akadémii Nauk SSSR, vol. 132 , pp. 504–506.Žuravlev Yu. I.. On the impossibility of constructing minimal disjunctive normal forms for functions of the algebra of logic in a single class of algorithms. English translation of the preceding by Elliott Mendelson. Soviet mathematics, vol. 1 no. 3 , pp. 581–583. [REVIEW]Andrzej Rowicki - 1965 - Journal of Symbolic Logic 30 (3):379-379.
  8.  46
    Ú. I. Žuravlév. О postroénii minimal′nyh dizúnktivnyh normal′nyh form dlá funkcij algébry logiki . Doklady Akadémii Nauk SSSR, vol. 126 , pp. 263–266. [REVIEW]Andrzej Rowicki - 1966 - Journal of Symbolic Logic 31 (1):140-141.
  9.  42
    Ú. I. Žuravlév. Ob algoritmahj uproščéniá dizúnktivnyh normal′nyh form. Doklady Akadémii Nauk SSSR, vol. 132 , pp. 260–263. - Yu. I. Žuravlev. On simplification algorithms for disjunctive normal forms. English translation of the preceding by E. Mendelson. Soviet mathematics, vol. 1 no. 3 , pp. 526–529. [REVIEW]Andrzej Rowicki - 1966 - Journal of Symbolic Logic 31 (1):141-141.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  10.  24
    Review: U. I. Zuravlev, Algorithms with Finite Memory on Disjunctive Normal Forms. [REVIEW]Andrzej Rowicki - 1968 - Journal of Symbolic Logic 33 (4):630-630.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  30
    U. I. Žuravlév. Algoritmy s konéčnoj pamáťú nad dizúnktivnymi normal′nymi formami . Diskrétnyj analiz , no. 1 , pp. 5–12. [REVIEW]Andrzej Rowicki - 1969 - Journal of Symbolic Logic 33 (4):630.