Order: Listing date First author Impact Pub year Relevance Downloads Order
[Omnibus Review]. Arto Salomaa 1966 - Journal of Symbolic Logic 31 (3):501-502. details Computation and Automata. Arto Salomaa 1985 - Cambridge University Press. details A Theorem Concerning the Composition of Functions of Several Variables Ranging Over a Finite Set. Arto Salomaa 1960 - Journal of Symbolic Logic 25 (3):203-208. details Structures in Logic and Computer Science a Selection of Essays in Honor of A. Ehrenfeucht. Jan Mycielski Grzegorz Rozenberg Arto Salomaa 1997 details Complementarity Versus Universality: Keynotes of DNA Computing. Gheorghe Päun Grzegorz Rozenberg Arto Salomaa 1998 - Complexity 4 (1):14-19. details Akira Nakamura. On an Axiomatic System of the Infinitely Many-Valued Threshold Logics. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 8 , Pp. 71–76. - Akira Nakamura. On the Infinitely Many-Valued Threshold Logics and von Wright's System M″. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 8 , Pp. 147–164. - Akira Nakamura. A Note on Truth-Value Functions in the Infinitely Many-Valued Logics. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 8 , Vol. 9 , Pp. 141–144. - Akira Nakamura. On a Simple Axiomatic System of the Infinitely Many-Valued Logic Based on ∧, →. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 8 , Pp. 251–263. - Akira Nakamura. On an Axiomatic System of the Infinitely Many-Valued Threshold Predicate Calculi. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 8 , Pp. 321–239. - Akira Nakamura. Truth-Value Stipulations for the von Wright System M′ and the He. [REVIEW] Arto Salomaa 1965 - Journal of Symbolic Logic 30 (3):374-375. details Alan Rose. Self-dual binary and ternary connectives for m-valued propositional calculi. Mathematische Annalen, vol. 143 , pp. 448–462. - Alan Rose. Sur certains calculs propositionnels à m valeurs ayant un seul foncteur primitif lequel constitue son propre dual. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 252 , pp. 3176–3178. - Alan Rose. Sur certains calculs propositionnels à m valeurs ayant deux fondeurs primitifs dont chacun est le dual de l'autre. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 252 , pp. 3375–3376. - Alan Rose. Sur un ensemble de foncteurs primitifs pour le calcul propositionnel à m valeurs lequel constitue son propre m-al. Comptes rendus hebdomadaires des séances de l'Académie des Sciences , vol. 254 , pp. 1897–1899. - Alan Rose. Sur un ensemble complet de foncteurs primitifs indépendants pour le calcul propositionnel trivalent lequel constitue son propre trial. Comptes rendus hebdomadaires des séances de l. [REVIEW] Arto Salomaa 1964 - Journal of Symbolic Logic 29 (3):144-145. details S. V. Áblonskij. Funktional'nyé Postroéniá V K-Značnoj Logiké . Sbornik Statéj Po Matématičéskoj Logiké I Éé Priložéniám K Nékotorym Voprosam Kibérnétiki, Trudy Matématičéskogo Instituta Iméni V. A. Stéklova, Vol. 51, Izdatél'stvo Akadémii Nauk SSSR, Moscow1958, Pp. 5–142. [REVIEW] Arto Salomaa 1964 - Journal of Symbolic Logic 29 (4):214-216. details Cuninghame-Green R. A.. Single Primitive Ternary Connectives for the 2-Valued Prepositional Calculus. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 5 , Pp. 206–207.Wheeler Roger F.. Complete Prepositional Connectives. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 7 , Pp. 185–198.Wheeler Roger F.. An Asymptotic Formula for the Number of Complete Prepositional Connectives. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 8 , Pp. 1–4.Wheeler Roger F.. Complete Connectives for the 3-vaIued Prepositional Calculus. Proceedings of the London Mathematical Society, Ser. 3 Vol. 16 , Pp. 167–191. [REVIEW] Arto Salomaa 1968 - Journal of Symbolic Logic 33 (1):127-128. details G. A. Šéstopal. O Čislé Prostyh Bazisov Bulévyh Funkcij. Doklady Akadémii Nauk SSSR, Vol. 140 , Pp. 314–317. - G. A. Šestopal. On the Number of Simple Bases of Boolean Functions. English Translation of the Preceding by E. Mendelson. Soviet Mathematics, Vol. 2 No. 5 , Pp. 1215–1219. - S. V. Áblonskij. O Supérpoziciáh Funkcij V Рκ . Problémy Kibérnétiki, Vol. 9 , Pp. 337–340. - V. V. Martynúk. Isslédovanié Nékotoryh Klassov Funkcij V Mnogoznačnyh Logikah . Problémy Kibérnétiki, Vol. 3, Pp. 49–60. - É. Ú. Zaharov and S. V. Áblonskij. O Nékotoryh Svojstvah Suščéstvénnyh Funkcij Iz Рκ . Problémy Kibérnétiki, Vol. 12 , Pp. 247–252. [REVIEW] Arto Salomaa 1966 - Journal of Symbolic Logic 31 (3):501-502. details Review: A. V. Gladkij, O Raspoznavanii Zaméščaémosti V Rékursivnyh Ázykah; A. V. Gladkij, M. Greendlinger, On the Recognition of Replaceability in Recursive Languages. [REVIEW] Arto Salomaa 1970 - Journal of Symbolic Logic 35 (2):340-340. details A. V. Gladkij. Nékotoryé algoritmičéskié problémy dlá kontékstno-svobodnyh grammatik . Algébra i logika, Séminar, vol. 4 no. 1 , pp. 3–13. - A. V. Gladkij. Algoritmičéskaá néraspoznavaémost′ suščéstvénnoj néoprédélénnosti kontékstno-svobodnyh ázykov . Algébra i logika, Séminar, vol. 4 no. 4 , pp. 53–63. - O. S. Kulagina. Ob odnom sposobé oprédéléniá grammatičéskih ponátij na bazé téorii množéstv . Problémy kibérnétiki, vol. 1 , pp. 203–214. - A. V. Gladku. Konfiguracionnyé haraktéristiki ázykov . Problémy kibérnétiki, vol. 10 , pp. 251–260. - V. D. Lučkin. O rangah konfiguracij kontékstnosvobodnyh ázykov . Algébra i logika, Séminar, vol. 5 no. 3 , pp. 59–70. [REVIEW] Arto Salomaa 1970 - Journal of Symbolic Logic 35 (2):339-340. details Ginsburg Seymour. Algebraic and Automata-Theoretic Properties of Formal Languages. Fundamental Studies in Computer Science, Vol. 2. North-Holland Publishing Company, Amsterdam and Oxford, and American Elsevier Publishing Company, Inc., New York, 1975, Xii + 313 Pp. [REVIEW] Arto Salomaa 1976 - Journal of Symbolic Logic 41 (4):788-789. details Gluškov V. M.. Nékotoryé Problémy Sintéza Cifrovyh Automatov . Žurnal Vycislitél′ Noj Matématiki I Matématičéskoj Fiziki, Vol. 1 , Pp. 371–411.GlušSkov V. M.. Ob Odnom Algoritmé Sintéza Abstraktnyh Avtomatov . Ukrainskij Matématićéskij Žurnal, Vol. 12 , Pp. 147–156. [REVIEW] Arto Salomaa 1969 - Journal of Symbolic Logic 33 (4):629-629. details Jaakko K. Hintikka J.. Loogisen Kielentutkimuksen Näköaloja . Ajatus, Vol. 19 , Pp. 81–96. Arto Salomaa 1963 - Journal of Symbolic Logic 28 (2):165-165. details Kuznécov O. P.. Ob Odnom Klassé Régulárnyh Sobytij . Strukturnáa Téoriá Réléjnyh Ustrojstv, Izdatél′Stvo Akadémii Nauk, SSSR, Moscow, 1963, Pp. 100–109. [REVIEW] Arto Salomaa 1969 - Journal of Symbolic Logic 33 (4):629-629. details Kauppi Raili. Käsitteen sisällys ja ala . Ajatus, vol. 18 , pp. 55–83. Arto Salomaa 1963 - Journal of Symbolic Logic 28 (1):106-106. details Michael A. Arbib. Theories of Abstract Automata. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1969, Xiii + 412 Pp. [REVIEW] Arto Salomaa 1972 - Journal of Symbolic Logic 37 (2):412-413. details Nakamura Akira. On the Infinitely Many-Valued Double-Threshold Logic. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 11 (1965), Pp. 93–101. Nakamura Akira. On a Certain System of Modal Logic. Zeitschrift Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 11 (1965), Pp. 203–207. [REVIEW] Arto Salomaa 1966 - Journal of Symbolic Logic 31 (4):665-665. details On the Infinitely Many-Valued Double-Threshold Logic. Arto Salomaa Akira Nakamura 1966 - Journal of Symbolic Logic 31 (4):665. details On the Number of Simple Bases of Boolean Functions.On Superpositions of Functions in P K.Investigation of Some Classes of Functions in Multivalued Logics.On Some Properties of Essential Functions From P K. [REVIEW] Arto Salomaa G. A. Sestopal E. Mendelson S. V. Ablonskij V. V. Martynuk E. U. Zaharov 1966 - Journal of Symbolic Logic 31 (3):501. details Peter H. Starke. Abstrakte Automaten. VEB Deutscher Verlag der Wissenschaften, Berlin1969, 392 pp. [REVIEW] Arto Salomaa 1972 - Journal of Symbolic Logic 37 (2):413-414. details Peter J. Denning, Jack B. Dennis, and Joseph E. Qualitz. Machines, Languages, and Computation. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1978, Xxii + 601 Pp. [REVIEW] Arto Salomaa 1980 - Journal of Symbolic Logic 45 (3):630-631. details Review: A. R. Turquette, A General Theory of K-Place Stroke Functions in 2-Valued Logic. [REVIEW] Arto Salomaa 1964 - Journal of Symbolic Logic 29 (3):143-143. details Robert E. Clay. A Simple Proof of Functional Completeness in Many-Valued Logics Based on Łukasiewicz's C and N. Notre Dame Journal of Formal Logic, Vol. 3 , Pp. 114–117. - Robert E. Clay. Note on Stupecki T-Functions. The Journal of Symbolic Logic, Vol. 27 No. 1 , Pp. 53–54. [REVIEW] Arto Salomaa 1965 - Journal of Symbolic Logic 30 (1):105. details Robert E. Clay. A Standard Form for Łukasiewicz Many-Valued Logics. Notre Dame Journal of Formal Logic, Vol. 4 , Pp. 59–66. [REVIEW] Arto Salomaa 1965 - Journal of Symbolic Logic 30 (1):105-106. details Review: K. Jaakko, J. Hintikka, On the Logical Study of Language. [REVIEW] Arto Salomaa 1963 - Journal of Symbolic Logic 28 (2):165-165. details Review: Michael A. Arbib, Theories of Abstract Automata. [REVIEW] Arto Salomaa 1972 - Journal of Symbolic Logic 37 (2):412-413. details Review: O. P. Kuznecov, On a Class of Regular Events. [REVIEW] Arto Salomaa 1968 - Journal of Symbolic Logic 33 (4):629-629. details Review: Peter H. Starke, Abstrakte Automaten. [REVIEW] Arto Salomaa 1972 - Journal of Symbolic Logic 37 (2):413-414. details Review: Peter J. Denning, Jack B. Dennis, Joseph E. Qualitz, Machines, Languages, and Computation. [REVIEW] Arto Salomaa 1980 - Journal of Symbolic Logic 45 (3):630-631. details Review: Robert E. Clay, A Standard Form for Lukasiewicz Many-Valued Logics. [REVIEW] Arto Salomaa 1965 - Journal of Symbolic Logic 30 (1):105-106. details Review: Robert E. Clay, A Simple Proof of Functional Completeness in Many-Valued Logics Based on Lukasiewicz's C and N; Robert E. Clay, Note on Slupecki T-Functions. [REVIEW] Arto Salomaa 1965 - Journal of Symbolic Logic 30 (1):105-105. details Review: Raili Kauppi, Intension and Extension of Concepts. [REVIEW] Arto Salomaa 1963 - Journal of Symbolic Logic 28 (1):106-106. details Review: Seymour Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages. [REVIEW] Arto Salomaa 1976 - Journal of Symbolic Logic 41 (4):788-789. details Review: S. V. Ablonskij, Functional Constructions in K-Valued Logic. [REVIEW] Arto Salomaa 1964 - Journal of Symbolic Logic 29 (4):214-216. details Review: V. M. Gluskov, Some Problems of Synthesis of Digital Automata; V. M. Gluskov, On an Algorithm of Synthesis of Abstract Automata. [REVIEW] Arto Salomaa 1968 - Journal of Symbolic Logic 33 (4):629-629. details Turquette A. R.. A General Theory of K-Place Stroke Functions in 2-Valued Logic. Proceedings of the American Mathematical Society, Vol. 13 , Pp. 822–824. [REVIEW] Arto Salomaa 1964 - Journal of Symbolic Logic 29 (3):143-143. details William H. Jobe. Functional Completeness and Canonical Forms in Many-Valued Logics. The Journal of Symbolic Logic, Vol. 27 No. 4 , Pp. 409–422. [REVIEW] Arto Salomaa 1964 - Journal of Symbolic Logic 29 (3):143-144. details
Off-campus access
Using PhilPapers from home?
Create an account to enable off-campus access through your institution's proxy server.
Monitor this page
Be alerted of all new items appearing on this page. Choose how you want to monitor it:
Email
RSS feed
