- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Arto Salomaa
38 found
Order:
- [Omnibus Review].Arto Salomaa - 1966 - Journal of Symbolic Logic 31 (3):501-502.
- Computation and automata.Arto Salomaa - 1985 - New York: Cambridge University Press.This introduction to certain mathematical topics central to theoretical computer science treats computability and recursive functions, formal languages and automata, computational complexity, and cruptography. The presentation is essentially self-contained with detailed proofs of all statements provided. Although it begins with the basics, it proceeds to some of the most important recent developments in theoretical computer science.
- Complementarity versus universality: Keynotes of DNA computing.Gheorghe Päun, Grzegorz Rozenberg & Arto Salomaa - 1998 - Complexity 4 (1):14-19.No categories
- 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.
- 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.
- 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.
- On the Infinitely Many-Valued Double-Threshold Logic.Arto Salomaa & Akira Nakamura - 1966 - Journal of Symbolic Logic 31 (4):665.
- Review: S. V. Ablonskij, Functional Constructions in k-Valued Logic. [REVIEW]Arto Salomaa - 1964 - Journal of Symbolic Logic 29 (4):214-216.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.Export citation
Bookmark - 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.
- 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.
- Review: K. Jaakko, J. Hintikka, On the Logical Study of Language. [REVIEW]Arto Salomaa - 1963 - Journal of Symbolic Logic 28 (2):165-165.
- Review: Michael A. Arbib, Theories of Abstract Automata. [REVIEW]Arto Salomaa - 1972 - Journal of Symbolic Logic 37 (2):412-413.
- Review: O. P. Kuznecov, On a Class of Regular Events. [REVIEW]Arto Salomaa - 1968 - Journal of Symbolic Logic 33 (4):629-629.
- Review: Peter H. Starke, Abstrakte Automaten. [REVIEW]Arto Salomaa - 1972 - Journal of Symbolic Logic 37 (2):413-414.
- 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.Export citation Bookmark
- Review: Robert E. Clay, A Standard Form for Lukasiewicz Many-Valued Logics. [REVIEW]Arto Salomaa - 1965 - Journal of Symbolic Logic 30 (1):105-106.
- 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.
- Review: Raili Kauppi, Intension and Extension of Concepts. [REVIEW]Arto Salomaa - 1963 - Journal of Symbolic Logic 28 (1):106-106.
- Review: Seymour Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages. [REVIEW]Arto Salomaa - 1976 - Journal of Symbolic Logic 41 (4):788-789.
- 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.
- 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.
- 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.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-67c5d994d4-9fnpl uwo