Skip to main content

A Survey of Many-Valued Logic (1966–1974)

  • Chapter
Modern Uses of Multiple-Valued Logic

Part of the book series: Episteme ((EPIS,volume 2))

Abstract

The bibliography has been modelled closely in format on that of Rescher’s in his book many Valued-Logic. This format was picked rather than, say, that of Moisil’s excellent bibliography in his Essais sur le Logiques non-chrysippiènnes for two reasons:(1) Rescher’s book, and hence his bibliography, is more easily accessible to general audiences than is Moisil’s, so that an extension of Rescher’s bibliography is more likely to be useful; (2) the format of Rescher’s bibliography is more helpful than that of Moisil’s.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Jan Łukasiewicz: ‘Über den Satz des Widerspruchs bei Aristoteles,’ Bulletin international de I’Académie des Sciences de Cracovie, Classe de Philosophie (Cracow, 1910), 15–38. [English translation (‘On the Principle of Contradiction in Aristotle’) by Vernon Wedin in The Review of Metaphysics 24 (1971), 485–509.] [Reviewed by Ivo Thomas in JSL 39 (1974), 619.]

    Google Scholar 

  2. Tadeusz Kotarbiński: ‘Zagadnienie istnienia pryszłosci (On the problem of existence of future events),’ Przeglgd Filozoficzny 16 (1913), 74–92. Reprinted in Tadeusz Kotarbinski, Wybór Pism, vol. 1, Warsaw 1957, pp. 116–144. L

    Google Scholar 

  3. Jan Łukasiewicz: ‘Treść wykładu pożegnalnego prof. Jana Łukasiewicza, wygłoszonego w auli Uniwersytetu warszawskiego dnia 7-go Marca 1918,’ Pro Arte et Studio 11 (1918), Warszawa-Kraków-Lwów-Poznań (Gebethner and Wolff), pp. 3–4. Reprinted in Wiadomości 45 no. 501 (1955), p. 4. [English translation (‘Farewell Lecture by Professor Jan Łukasiewicz, delivered in the Warsaw University Lecture Hall on March 7, 1918’) by Olgierd Wojtasiewicz in Łukasiewicz (1970), pp. 84–86.]

    Google Scholar 

  4. Jan Łukasiewicz: ‘O logice trojwartosciowej’ Ruch Filozoficzny 5 (1920), 169–171. [English translation (‘On Three-valued Logic’) by H. Hiż in McCall (1967), pp. 16–18. English translation (‘On Three-valued Logic’) by Olgierd Wojtasiewicz in Łukasiewicz (1970), pp. 87–88.]

    Google Scholar 

  5. Jan Łukasiewicz: ‘Logika dwuwartosciowa,’ Przeglqd Filozoficzny 23 (1921), 189–205. [English translation (‘Two-valued Logic’) by Olgierd Wojtasiewicz in Lukasiewicz (1970), pp. 89–109.]

    Google Scholar 

  6. ‘O determinizmie,’ in Lukasiewicz (1961), pp. 114–126. [English translation (‘On Determinism’) by Zbigniew Jordan in McCall (1967), pp. 19–39. English translation reprinted in Lukasiewicz (1970), pp. 110–128.] [Reviewed by Rose Rand in JSL 33 (1968), 130.]

    Google Scholar 

  7. Jan Łukasiewicz: Elementy Logiki Matematycznej. Warsaw (Pans- twowe Wydawnictwo Naukowe) 1929. Second edition, edited by Jerzy Słupecki, 1958. [English translation (Elements of Mathematical Logic) by Olgierd Wojtasiewicz, New York (The Macmillan Company) 1963.] [Reviewed by Arthur Norman Prior in The Journal of Philosophy 65 (1968), 152–153; by Alfons Borgers in JSL 30 (1965), 237; by Czestaw Lejewski in Philosophy of Science 34 (1967), 196–198.]

    Google Scholar 

  8. Thoralf Skolem: “Über einige Grundlagenfragen der Mathematick,” Skrifter utgitt av Det Nor she Videnskaps-Adademi i Oslo, no. 4 (1929), 1–49. Reprinted in Skolem (1970), pp: 227–274.

    Google Scholar 

  9. Jan Łukasiewicz: ‘Philosophische Bemerkungen zu mehrwertigen Systemen des Aussagenskalkuls,’ Comptes Rendus des Seances de la Société des Sciences et des Lettres de Varsovie ,Classe III 23 (1930), 51–71. [Polish translation (‘Uwagi filozoficzne o wielowartościowych systemach rachunku zdań’) by Egon Vielrose in Łukasiewicz (1961), pp. 144–163. English translation (‘Philosophical Remarks on Many-valued Systems of Propositional Logic’) by H. Weber in McCall (1967), pp. 40–65. English translation reprinted in Łukasiewicz (1970), pp. 153–178.] [Reviewed by Rose Rand in JSL 33 (1968), 131–132.]

    Google Scholar 

  10. See Łukasiewicz and Tarski (1930).

    Google Scholar 

  11. Jan Łukasiewicz and Alfred Tarski: ‘Untersuchungen über den Aussagenkalkül,’ Comptes Rendus des Seances de la Societe des Sciences et des Lettres de Varsovie, Classe III 23 (1930), 1–21, 30–50. [English translation (‘Investigations into the Sentential Calculus’) by J. H. Woodger in Alfred Tarski, Logic, Semantics, Meta- mathematics, edited by J. H. Woodger, Oxford (Clarendon Press) 1956, pp. 38–59. Polish translation (‘Badania nad rachunkiem zdan’) by Egon Vielrose in Łukasiewicz (1961), pp. 129–143. English translation reprinted in Lukasiewicz (1970), pp. 131–152.] [Reviewed by Rose Rand in JSL 33 (1968), 130–131.]

    Google Scholar 

  12. See Łukasiewicz and Tarski (1930).

    Google Scholar 

  13. Jan Łukasiewicz: ‘Z historji logiki zdań,’ Przeglyd Filozoficzny 37 (1934), pp. 417–437. Reprinted in Lukasiewicz (1961), pp. 178–194. [English translation (‘On the History of the Logic of Propositions’) by Storrs McCall in MacCall (1967), pp. 66–87. English translation reprinted in Łukasiewicz (1970), pp. 197–218.]

    Google Scholar 

  14. Grigor Constantin Moisil: ‘Recherches sur l’algebre de la logique,’ Annales Scientifiques de I ‘Universite de Jassy 22 (1936), 1–118.

    Google Scholar 

  15. Donald L. Webb: Many-valued Logics. Ph.D. dissertation: California Institute of Technology, 1936.

    Google Scholar 

  16. Jan Lukasiewicz: ‘Wobronie logistyki,’ Studia Gnieseusia 15 (1937). Reprinted in Łukasiewicz (1961), pp. 210–219. [English translation (‘In Defense of Logistic’) by Olgierd Wojtasiewicz in Łukasiewicz (1970), pp. 236–249.] [Reviewed by M. Kokoszynska in JSL, 3 (1938), 43–44.]

    Google Scholar 

  17. See McCoy and Montgomery (1937). McCoy and Montgomery (1937).

    Google Scholar 

  18. N. and D. Montgomery: ‘A Representation of Generalized Boolean Rings,’ Duke Mathematical Journal 3 (1937), 455–459.

    Google Scholar 

  19. See McCoy and Montgomery (1937).

    Google Scholar 

  20. See Nakasima and Hanzawa (1938).

    Google Scholar 

  21. Jan Łukasiewicz: ‘Die Logik und das Grundlagenproblem,’ Les Entretiens de Zurich sur les Fondements et la Methode des Sciences Mathématiques, 6–9 décembre 1938, edited by F. Gonseth, Zurich (S. A. Leemann Freres & Cie) 1941, pp. 82–100; ‘Discussion,’ pp. 100–108. [English translation (‘Logic and the Problem of the Foundations of Mathematics’) from the Polish by Olgierd Wojtasiewicz in Łukasiewicz (1970), pp. 278–294.] [Reviewed by Saunders MacLane in JSL 7 (1942), p. 36; by Haskell B. Curry in MR 2 (1941), pp. 338–339.]

    Google Scholar 

  22. Grigor Constantin Moisil: ‘Sur la theorie classique de la modalite des jugements,’ Bulletin Mathématique de la Société Roumanie des Sciences 40 (1938), 235–240. Reprinted in Moisil (1972), pp. 47–55. [Reviewed by C. A. Baylis in JSL 4 (1939), 167–168.]

    Google Scholar 

  23. See Nakasima and Hanzawa (1938).

    Google Scholar 

  24. A. Nakasima and M. Hanzawa: ‘The Theory of Equivalent Transformations of Simple Partial Paths in the Relay Circuit,’ Nippon Electrical Communication Engineering 9 (1938), 32–39.

    Google Scholar 

  25. Donald L. Webb. ‘A Set of Postulates for an Algebra of N-valued Logic,’ The Journal of Symbolic Logic 3 (1938), 60.

    Google Scholar 

  26. Grigor Constantin Moisil: ‘Recherches sur le syllogisme,’ Annales Scienti- fiques de I’Universite de Jassy 25 (1939), 341–384. [Reviewed by Ernest Nagel in JSL 4 (1939), 167.]

    Google Scholar 

  27. Grigor Constantin Moisil: ‘La logique formelle et son probleme actuel,’ Istoria Filosofici Moderne (Bucharest) 4 (1939), 28 pp. Reprinted in Moisil (1972), pp. 11–31. [Reviewed by Robert Feys in JSL 13 (1948), p. 160.]

    Google Scholar 

  28. H. Piesch: ‘Begriff der allgemeinen Schaltungstechnik,’ Archiv fur Elektrotechnik 33 (1939), 672–686.

    Google Scholar 

  29. Grigor Constantin Moisil: ‘Recherches sur les logique non-chrysippiènnes,’ Annales Scientifique de I’Université de Jassy, 26 (1940), 431–466. Reprinted in Moisil (1972), pp. 195–232. [Reviewed by Albert A. Bennett in JSL 13 (1948), p. 50; by G. Birkhoffin MR 8 (1947), 307.]

    Google Scholar 

  30. Grigor Constantin Moisil: ‘Sur la structure algèbrique de la logique de M. Bochvar,’ Disquisitiones Mathematicae et Physicae 1 (1940–41), 307–314. Reprinted in Moisil (1972), pp. 676–684. [Reviewed by Atwell R. Turquette in JSL 13 (1948), 116; by Arend Heyting in MR 8 (1947), 557.]

    Google Scholar 

  31. Grigor Constantin Moisil: ‘Notes sur les logiques non-chrysippiennes,’ Annales Scientifiques de I’Université de Jassy 27 (1941), 86–98. Reprinted in Moisil (1972), pp. 233–243. [Reviewed by Albert A. Bennett in JSL 13 (1948), 50; by G. Birkhoff in MR 8 (1947), 307.]

    Google Scholar 

  32. Grigor Constantin Moisil: “Contributions a l‘etude des logiques non-chrysippiènnes’. I. Un nouveau systeme d’axiomes pour les algebres Łukasiewicziennes tetravalentes,” Comptes Rendus des Seances de I’Académie des Sciences de Roumanie 5 (1941), 289–293. Reprinted in Moisil (1972), pp. 282–287. [Reviewed by Robert Feys in JSL 13 (1948), 160.]

    Google Scholar 

  33. Grigor Constantin Moisil: ‘Remarques sur la logique modale du concept,’ Annales de I’Académie Roumanie, Memoires de la Section Scientifique ,serie 3, 16 (1941), 975–1012. Reprinted in Moisil (1972), pp. 56–98. [Reviewed by Atwell R. Turquette in JSL 13(1948), 161–162.]

    Google Scholar 

  34. Grigor Constantin Moisil: ‘Sur les anneaux de caracteristique 2 ou 3 et leurs applications,’ Bulletin de I’École Poly technique de Bucarest 12 (1941), 66–90. Reprinted in Moisil (1972), pp. 259–282. [Reviewed by Robert Feys in JSL 13 (1948), 160–161.]

    Google Scholar 

  35. Grigor Constantin Moisil: ‘Sur les theories déductives à logique non-chrysippiènne,’ Comptes Rendus des Séances de I’Académie des Sciences de Roumanie 5 (1941), 21–24. Reprinted in Moisil (1972), pp. 189–191.

    Google Scholar 

  36. V. I. Shestakov: ‘Algébra dvuhpolúsnyh shem, postroénnyh isklúčitel’no iz dvuhpolúsnikov (Algebra A-shém),’ Avtomatika i Télémehanika 2 (1941), 15–24. Also printed in Žurnal Téhničéskoj Fiziki 11 (1941), 532–549.

    Google Scholar 

  37. Grigor Constantin Moisil: ‘Logique modale,’ Disquisitiones Mathematicae et Physicae 2 (1942), 3–98. Reprinted in Moisil (1972), pp. 341–431. [Reviewed by Atwell R. Turquette in JSL 13 (1948), 162–163; by Arend Heyting in MR 8 (1947), 577.]

    Google Scholar 

  38. Grigor Constantin Moisil: ‘Contributions a l’etude des logiques non-chrysippiènnes. II. Anneaux engendrés par les algèbres Łukasiewicziennes tetravalentes centrées,’ Comptes Rendus des Séances de I’Académie des Sciences de Roumanie 6 (1942), 9–13. Reprinted in Moisil (1972), pp. 287–292.

    Google Scholar 

  39. Grigor Constantin Moisil: ‘Contributions a l’etude des logiques non-chyrisippiennes. III. Anneaux engendrés par les algébres Łukasiewicziennes tetravalentes axées,’ Comptes Rendus des Séances de I’Académie des Sciences de Roumanie 6 (1942), 14–17. Reprinted in Moisil (1972), pp. 293–297.

    Google Scholar 

  40. See McCulloch and Pitts (1943).

    Google Scholar 

  41. W. S. McCulloch and W. Pitts: ‘A Logical Calculus of the Ideas Immanent in Nervous Activity,’ Bulletin of Mathematical Biophysics 5 (1943), 115–133.

    Google Scholar 

  42. Grigor Constantin Moisil: ‘Contributions a l’étude des logiques non-chrysippiènnes. IV. Sur la logique de M. Becker,’ Comptes Rendus des Séances de I’Académie des Sciences de Roumanie 7 (1943), 9. Reprinted in Moisil (1972), 673–675. [Reviewed by Arend Heyting in MR 9 (1948), 1.]

    Google Scholar 

  43. See McCulloch and Pitts (1943).

    Google Scholar 

  44. Atwell Rufus Turquette: A Study and Extension of M–valued Logics. Ph.D. dissertation: Cornell University, 1943.

    Google Scholar 

  45. Jerzy Łos. O matrycach logicznych .Wrocław (Prace Wrocławskiego Towarzy-stwa, Naukowego, series B, no. 19) 1949. [English translation (‘On Logical Matrices’) by Dolph E. Ulrich in Ulrich (1967), pp. 71–129.] [Reviewed by Jan Kalicki in JSL 16 (1951), 59–61.]

    Google Scholar 

  46. Engineering Research Associates: High-Speed Computing Devices. New York ( McGraw-Hill Book Company, Inc. ) 1950.

    Google Scholar 

  47. Schiller Joe Scroggs: ‘Extensions of the Lewis System S5,’ The Journal of Symbolic Logic 16 (1951), 112–120. [Reviewed by Naoto Yonemitsu in JSL 16 (1951), 272–273; by Arend Heyting in MR 13 (1952), 97.]

    Google Scholar 

  48. H. J. R. Grosch; ‘Signed Ternary Arithmetic,’ Digital Computer Laboratory Memorandum M-1496 at MIT, Cambridge, Massachusetts, May 1952.

    Google Scholar 

  49. Jan Łukasiewicz: ‘On the Intuitionistic Theory of Deduction,’ Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings ,series A 55 (1952), 202–212. Also printed in Indagationes Mathematicae 14 (1952), 202–212. Reprinted in Łukasiewicz (1970), pp. 325–340. [Polish translation in Łukasiewicz (1961).] [Reviewed by Gene F. Rose in JSL 19 (1954), 216; by Arend Heyting in MR 14 (1953), 4; by H. Scholz in ZMG 48 (1953), 4.]

    Google Scholar 

  50. K. J. Cohen: ‘A Remark on Lukasiewicz’s ‘On the Intuitionistic Theory of Deduction’,’ Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A 56 (1953), 111–112. Also printed in Indagationes Mathematicae 15 (1953), 111–112. [Reviewed by Gene F. Rose in JSL 19 (154), 217.]

    Google Scholar 

  51. Jan Łukasiewicz: ‘A System of Modal Logic,’ The Journal of Computing Systems 1 (1953), 111–149. Reprinted in Łukasiewicz (1970), pp. 352–390. [Polish translation in Łukasiewicz (1961).] [Reviewed by Ronald Harrop in JSL 25 (1960), 293–296; by Alan Rose in MR, 15 (1954), 2.]

    Google Scholar 

  52. Jan Łukasiewicz: ‘Comment on K. J. Cohen’s Remark,’ Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A 56 (1953), 113. Also printed in Indagationes Mathematicae 15 (1953), 113. [Reviewed by Gene F. Rose in JSL 19(1954), 217.]

    Google Scholar 

  53. Alan Ross Anderson: ‘On the Interpretation of a Modal System of Łukasiewicz,’ The Journal of Computing Systems 1 (1954), 209–210. [Reviewed by Ronald Harrop in JSL 25 (1960), 295; by Alan Rose in MR 16(1957), 554.]

    Google Scholar 

  54. A. C. Choudhyry: ‘On Boolean Narings,’ Bulletin of the Calcutta Mathematical Society 46 (1954), 41–45. [Reviewed by I. Kaplansky in MR, 16 (1955), 107.]

    Google Scholar 

  55. Programming Research Group, Applied Science Division, IBM: ‘Preliminary Report, Specifications for the IBM Mathematical FOR-mula TRANslating System, FORTRAN,’ November 10, 1954.

    Google Scholar 

  56. T. Ryoichi: ‘On Nine-valued Propositional Calculus,’ The Journal of Computing Systems 1 (1954), 225–228.

    Google Scholar 

  57. H. E. Chresterson: ‘A Class of Generalized Walsh Functions,’ Pacific Journal of Mathematics 5 (1955), 17–31.

    Google Scholar 

  58. G. Metze: ‘An Application of Multi-valued Logic Systems to Circuits,’ Proceedings of the Symposium on Circuit Analysis, University of Illinois (1955), pp. 11–1–11–14.

    Google Scholar 

  59. Karl Schroter: ‘Methoden zur Axiomatisierung beliebiger Aussagen- und Pradikatenkalkule,’ Zeitschrift für mathematische Logik und Grundlagen der Mathe- matik 1 (1955), 241–251. [Reviewed by Abraham Robinson in MR 17 (1956), 1038; by J. Barkley Rosser in JSL 35 (1970), 140.]

    Google Scholar 

  60. Arend Heyting: Intuitionism: An Introduction. Amsterdam (North-Holland Publishing Company) 1956. Third, revised edition, 1971. [Reviewed by Sigekato Kurodain JSL 21 (1956), 367–371; by P. C. Gilmore in MR 17(1956), 698–699.]

    Google Scholar 

  61. Stephan Cole Kleene: ‘Representation of Events in Nerve Nets and Finite Automata,’ Automata Studies, Princeton (Princeton University Press) 1956, pp. 3–41.

    Google Scholar 

  62. Angelo Margaris: A Problem of Rosser and Turquette in Many-valued Logic. Ph.D. dissertation: Cornell University, 1956. Ann Arbor (University Microfilms) 1957.

    Google Scholar 

  63. Alan Rose: ‘Formalisations du calcul propositionnel implicatif a K0 valeurs de Lukasiewicz,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences ,série A 243 (1956), 1183–1185, 1263–1264 (à m valeurs). [Reviewed by Elliot Mendelson in MR 18 (1959), 271–272, 633; by E. Specker in ZMG 73 (1960), 249; by Bruno Scarpellini in JSL 35 (1970), 142; by Eugen Mihailescu (the section on m-valued logic) in JSL 36 (1971), 546.]

    Google Scholar 

  64. Chen Chung Chang: ‘Algebraization of Infinitely Many-valued Logic,’ Summaries of Talks Presented at the Summer Institute for Symbolic Logic, second edition, Communications Research Division, Institute for Defense Analyses, Princeton, 1960, pp. 144–146. [Reviewed by Alfred Horn in JSL 36 (1971), 159–160.]

    Google Scholar 

  65. Sören Halldén: On the Logic of ‘Better’. Library of Theoria, no. 2. Lund (C. W. K. Gleerup) and Copenhagen (Ejnar Munksgaard) 1957. 112 pp. [Reviewed by E. E. Dawson in JSL 31 (1966), 278–281.]

    Google Scholar 

  66. See Kreisel and Putnam (1957).

    Google Scholar 

  67. George Kreisel and Hilary Putnam: ‘Eine Unableitbarkeits-beweismethode für den intuitionistischen Aussagenkalkül,’ Archiv fur mathematische Logik und Grundlagenforschungen 3 (1957), 74–78.

    Google Scholar 

  68. Grigor Constantin Moisil: Teoria Algebrica de Meccanismi Automatici. Conferenze del seminario di matematica dell’Universita di Bari, no. 33–34. Bologna (Nicola Zanichella Editore) 1957. [Reviewed by Alonzo Church in JSL 36 (1971), p. 547.]

    Google Scholar 

  69. See Kreisel and Putnam (1957).

    Google Scholar 

  70. Thoralf Skolem: ‘Mengenlehre gegründet auf einer Logik mit unendlich vielen Wahrheitswerten,’ Sitzungsberichte der Berliner mathematischen Gesellschaft (1957–58), 41–56. [Reviewed by J. R. Schoenfield in MR 27 (1964), 681; by A. Oberschelp in ZMG 116 (1965), 9.]

    Google Scholar 

  71. Thoralf Skolem: ‘Bemerkungen zum Komprehensionsaxiom,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 3 (1957), 1–17. Reprinted in Skolem (1970), pp. 615–632. [Reviewed by Haskell B. Curry in MR 20 (1959), 508; by Azriel Levy in JSL 32 (1967), 128; by Wilhelm Ackermann in ZMG 116 (1965), 9.]

    Google Scholar 

  72. J. W. Backus: ‘The Syntax and Semantics of the Proposed International Algebraic Language of the Zurich ACM-GAMM Conference,’ IBM, New York, May 1958.

    Google Scholar 

  73. Chen Chung Chang: ‘Algebraic Analysis of Many-valued Logics,’ Transactions of the American Mathematical Society 88 (1958), 467–490. [Reviewed by Bernard A. Galler in MR 20 (1959), 132; by Alan Rose in ZMG 84 (1960), 7–8; by Alfred Horn in JSL 36 (1971), 159–160.]

    Google Scholar 

  74. Henryk Greniewski: ‘Refleksje na marginesie wikladow z driejowlogik Tadeusza Kotarbinskiego,’ Studie Filozoficzne 3 (1958), 165.

    Google Scholar 

  75. John King-Farlow: ‘Sea-fights without Tears,’ Analysis 19 (1958), 36–42. [Reviewed by Ronald J. Butler in JSL 36 (1971), 175–177.]

    Google Scholar 

  76. Angelo Margaris: ‘A Problem of Rosser and Turquette,’ The Journal of Symbolic Logic 23 (1958), 271–279. [Reviewed by Alan Rose in MR 21 (1960), 901; by Akira Nakamura in JSL 34 (1969), 304–305.]

    Google Scholar 

  77. E. Muhldorf: ‘Ternary Switch Algebras,’ Archiv der elektrischen Übertragung 12 (1958).

    Google Scholar 

  78. See Prior (1959).

    Google Scholar 

  79. Helmut Thiele: ‘Theorie der endlichwertigen Łukasiewiczschen Pradikaten-kalkiile der ersten Stufe,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 4 (1958), 108–142. [Reviewed by Wilhelm Ackermann in ZMG 88 (1961), 247; by Atwell R. Turquette in JSL 32 (1967), 260–261.]

    Google Scholar 

  80. Chen Chung Chang: ‘A New Proof of the Completeness of the Łukasiewicz Axioms,’ Transactions of the American Mathematical Society 93 (1959), 74–80. [Reviewed by Alan Rose in MR 23 (1962), 7; by Alfred Horn in JSL 36 (1971), 159–160.]

    Google Scholar 

  81. See Carr and Perlis and Robertson and Scott (1959).

    Google Scholar 

  82. J. W. Carr III, Alan J. Perlis, J. E. Robertson and N. R. Scott: ‘A Visit to Computation Centers in the Soviet Union,’ Communications of the Association for Computing Machinery 2 no. 6 (1959), 8–20.

    Google Scholar 

  83. Michael A. E. Dummett: ‘A Propositional Calculus with Denumerable Matrix,’ The Journal of Symbolic Logic 24 (1959), 97–106. [Reviewed by George Kreisel in MR 23 (1962), 139; by John Bacon in JSL 33 (1968), 305.]

    Google Scholar 

  84. E. I. Muhldorf: ‘Multivalued Switching Algebras and Their Applications in Digital Systems,’ Proceedings of the National Electronic Conference 15 (1959), 467–480.

    Google Scholar 

  85. See Carr and Perlis and Robertson and Scott (1959).

    Google Scholar 

  86. Arthur Norman Prior: ‘Notes on a Group of New Modal Systems,’ Logique et Analyse, n.s., 2 (1959), 122–127. [Reviewed by Maxwell J. Cresswell in JSL 35 (1970), 464.]

    Google Scholar 

  87. See Carr and Perlis and Robertson and Scott (1959).

    Google Scholar 

  88. See Carr and Perlis and Robertson and Scott (1959).

    Google Scholar 

  89. Toshio Umezawa: ‘On Logics Intermediate Between Intuitionistic and Classical Predicate Logic,’ The Journal of Symbolic Logic 24 (1959), 141–153. [Reviewed by A. S. Troelstra in JSL 33 (1968), 607; by Tsutomu Hosoi in ZMG 143 (1968), 10–11.]

    Google Scholar 

  90. J. Again: “Setun’” (Russian), Naučno-Tehnikceskaà Obshchestva SSSR2 no. 3 (1960), p. 25.

    Google Scholar 

  91. See Morris and Alexander (1960).

    Google Scholar 

  92. N. P. Brusentzov: ‘The computer Setun’ of Moscow State University’ (Russian), Material of the Scientific-Technical Conference: New Developments in Computational Mathematics and Computing Techniques, Kiev (1960), pp. 226–234.

    Google Scholar 

  93. Burton Dreben: Relation of ra-valued Quantificational Logic to 2-valued Quantificational Logic,’ Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell University, Princeton (1960), pp. 303–304. [Reviewed by Atwell R. Turquette in JSL 30 (1965), 375–376; by Akira Nakamura in ZMG 166 (1969), 250.]

    Google Scholar 

  94. George Epstein: ‘The Lattice Theory of Post Algebras,’ Transactions of the American Mathematical Society 95 (1960), 300–317. [Reviewed by Tadeusz Traczyk in JSL 33 (1968), 626; by Bernard A. Galler in MR 22 (1961), 626–627; by Akira Nakamura in ZMG 207 (1971), 294–295.]

    Google Scholar 

  95. T. D. Majstrova: ‘Priménénie mnogoznačnoj logiki v téorii réléjnyh shém,’ Priménénie Logiki v Nauke i Téhnike, Moscow (Izdatél’stvo Akadémii Nauk SSSR) 1960, pp. 394–414. [English translation (‘Application of Many-valued Logics in the Theory of Relay Networks’) by Leo Ebner in American Mathematical Society Translations, series 2, 48 (1965), 73–89.] [Reviewed by Alan Rose in JSL 37 (1972), 187.]

    Google Scholar 

  96. V. V. Martyniuk: ‘Issledovanie nekotorykh klassov funktsij v mnogoz-nacnykh logika, II’ (Investigation of certain classes of functions in many-valued logic), Problémy Kibérnétiki 3 (1960), 49–60. [Reviewed by S. I. Adjan in MR 23 (1962), 699.]

    Google Scholar 

  97. Grigor Constantin Moisil: ‘Sur les idéaux des algébres Lukasiewicziennes trivalentes,’ Analele Universitatu Bucuresti, Seria Acta Logica 3 (1960), 83–95. Reprinted in Moisil (1972), pp. 244–258. [Reviewed by Gene F. Rose in JSL 27 (1962), 367–368; by Alan Rose in MR 26 (1963), 691; by Albert A. Mullin in ZMG 103 (1964), 248–249.]

    Google Scholar 

  98. Grigor Constantin Moisil: ‘Asupra logicii lue Bochvar’ (On the logic of Bochvar), Academia Republicii Populare Romine, Analele Romino-Sovietice, Seria Matematica-Fizica (Bucharest) 14 (1960), 19–25. [French translation (‘Sur la logique de M. Bochvar’) in Moisil (1972), pp. 685–693.] [Reviewed by B. Germansky in MR 23 (1962), 138.]

    Google Scholar 

  99. Grigor Constantin Moisil: Logica matematica si teknica moderna: Logicile cu mai multe valori si circuitele cu contacte si relee (Mathematical logic and modern technology: Many-valued logic and relay-contact circuits), Probleme filosofice ale steintelor naturii, Bucharest (Académie de la République Populaire Roumanie) 1960. [French translation (‘Les logiques à plusieurs valeurs et les circuits à contacts et relais’) in Moisil (1972), pp. 104–148.]

    Google Scholar 

  100. See Morris and Alexander (1960).

    Google Scholar 

  101. D. J. Morris and W. Alexander: ‘An Introduction to the Ternary Code Number System,’ Electronic Engineering 32 (1960), 554–557.

    Google Scholar 

  102. See Schauer and Stewart and Pohm and Reid (1960).

    Google Scholar 

  103. See Schauer and Stewart and Pohm and Reid (1960).

    Google Scholar 

  104. Alan Rose: ‘An Extension of a Theorem of Margaris,’ The Journal of Symbolic Logic 25 (1960), 209–211. [Reviewed by Bernard A. Galler in MR 25 (1963), 390; by Akira Nakamura in JSL 34 (1969), 305.]

    Google Scholar 

  105. Alan Rose: ‘Sur les schemas d’axiomes pour les calculs propositionnels a m valeurs ayant des valeurs sur designees,’ Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, serie A 250 (1960), 790–792. [Reviewed by Elliott Mendelson in MR 22 (1961), 109; by Eugen Mihailescu in JSL 36 (1970), 546.]

    Google Scholar 

  106. Arto Salomaa: ‘A Theorem Concerning the Composition of Functions of Several Variables Ranging Over a Finite Set,’ The Journal of Symbolic Logic 25 (1960), 203–208.

    Google Scholar 

  107. Arto Salomaa: ‘On the Composition of Functions of Several Variables Ranging Over a Finite Set,’ Annales Universitatis Turkuensis, Series A. I., 41 (1960).

    Google Scholar 

  108. See Schauer and Stewart and Pohm and Reid (1960).

    Google Scholar 

  109. R. Schauer, R. Stewart, A. Pohm and A. Reid: Some Applications of Magnetic Film Parametrons as Logical Devices, IRE Transactions on Electronic Computers EC- 19 (1960), 315–320.

    Google Scholar 

  110. V. I. Šestakov: ‘O dvojnoj arifmétičéskoj intérprétacii tréhznačnogo isčisléniá vyskazyvanij, ispol’zuémoj pri modélirovanii etogo isčislénia posrédstvom réléjno-kommutatornyh shém,’ Priménénie Logiki v Nauke i Tehnike, Moscow (Izdatel’- stvo Akadémii Nauk SSSR) 1960, pp. 341–376. [English translation (‘A Dual Arithmetic Interpretation of the 3-valued Propositional Calculus Utilized in the Simulation of this Calculus by Relay-contact Networks’) by Leo Ebner in American Mathematical Society Translations, series 2 48 (1965), 45–72.] [Reviewed by Bernard A. Galler in MR 33 (1967), 664; by Alan Rose in JSL 37 (1972), 187.]

    Google Scholar 

  111. Thoralf Skolem: ‘A Set Theory Based on a Certain 3-valued Logic,’ Mathematica Scandinavica 8 (1960), 127–136. Reprinted in Skolem (1970), pp. 653–662. [Reviewed by Wilhelm Ackermann in ZMG 96 (1962), 243; by Alan Rose in MR 23 (1962), 699.]

    Google Scholar 

  112. See Schauer and Stewart and Pohm and Reid (1960).

    Google Scholar 

  113. M. C. Badillo: ‘Many-valued logics of systems’ (Spanish), Gaceta Matematica (Madrid) 13 (1961), 185–195. [Registered in ZMG 156 (1969), 7.]

    Google Scholar 

  114. See Chang and Horn (1961).

    Google Scholar 

  115. Chen Chung Chang and Alfred Horn: ‘Prime Ideal Characterization of Generalized Post Algebras,’ Proceedings of the Symposium of Pure Mathematics 2 (1961), 43–48. [Reviewed by P. L. Gilmore in ZMG 108 (1964), 5–6; by Tadeusz Traczyk in JSL 34 (1969), 512.]

    Google Scholar 

  116. Mark Fisher: ‘A Three-valued Calculus for Deontic Logic,’ Theoria 27 (1961), 107–118. [Reviewed by E. E. Dawson in JSL 31 (1966), 278–281.]

    Google Scholar 

  117. See Chang and Horn (1961).

    Google Scholar 

  118. Jan Łukasiewicz: Z Zagadnieh Logiki i Filozofii (Logical and philosophical papers), edited by Jerzy Słupecki. Warsaw (Państwowe Wydawnictwo Naukowe) 1961. [Reviewed by Rose Rand in JSL 33 (1968), 129–133.]

    Google Scholar 

  119. See Majstrova and Roghinski (1961).

    Google Scholar 

  120. T. D. Majstrova and V. I. Roghinski: ‘Réléjnye shémy i mnogozačinaà logika’ (Relay networks and many-valued logics), Problemy Peredači Informacii 121 (1961), 18.

    Google Scholar 

  121. Miroslav Mleziva: ‘K axiomatisaci trojhodnotvé vyrokové logiky’ (On the axiomatization of three-valued propositional logic), Časopis pro Pěstovani Matematiky (Prague) 86 (1961), 392–403. [Reviewed by the author in MR 24 (1962), 335; by J. Hořejs in ZMG 100 (1963), 9; by Ann S. Ferebee in JSL 35 (1970), 465.]

    Google Scholar 

  122. Grigor Constantin Moisil: ‘Les logiques à plusieurs valeurs et l’automatique,’ Infinitistic Methods, Proceedings of the Symposium on Foundations of Mathematics, Warsaw, 2–9 September 1959, Warsaw (Panstwowe Wydawnicto Naukowe) 1961 and Oxford (Pergamon Press) 1961, pp. 337–345. [Reviewed by Alonzo Church in JSL 36 (1971), 546–547.]

    Google Scholar 

  123. Grigor Constantin Moisil: ‘The Predicate Calculus in Three-valued Logic,’ Analele Universitati Bucuresti, Seria Acta Logica 4 (1961), 103–112. [French translation published as chapter II of Moisil (1972g), pp. 447–454.] [Reviewed by Albert A. Mullin in ZMG 103 (1964), 247.]

    Google Scholar 

  124. Andrzej Mostowski: ‘Axiomatizability of Some Many-Valued Predicate Calculi,’Fundamenta Mathematicae 50 (1961), 165–190. [Reviewed by George Kreisel in MR 24 (1962), 572–573; by Arnold Oberschelp in ZMG 99 (1963), 7–8; by Louise Hay in JSL 35 (1970), 143.]

    Google Scholar 

  125. Andrzej Mostowski: ‘An Example of a Non-axiomatizable Many-valued Logic,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 7 (1961), 72–76. [Reviewed by Alan Rose in MR 30 (1965), 203–204; by J. J. F. Nieland in ZMG 124(1966), 248; by Louise Hay in JSL 35 (1970), 143.]

    Google Scholar 

  126. See Majstrova and Roghinski (1961).

    Google Scholar 

  127. Timothy J. Smiley: ‘On Łukasiewicz’s Ł-modal System,’ Notre Dame Journal of Formal Logic 2 (1961), 149–153. [Reviewed by Alonzo Church in JSL 27 (1962), 113; by Alan Rose in MR 26 (1963), 690; by J. J. F. Nieland in ZMG 113 (1965), 5]

    Google Scholar 

  128. Aleksandr Aleksandrovich Zinov’ev: ‘Ob odnom sposobe obzora funkcij istinnosti n-znacnogo iscislenia vyskazyvanij’ (A method of describing the truth-functions of the n-valued propositional calculus), Studia Logica 11 (1961), 217–222. [Reviewed by E. J. Cogan in MR 24 (1962), 6; by Ivo Rosenberg in JSL 36 (1971), 691.]

    Google Scholar 

  129. See Bailey and Epstein (1962).

    Google Scholar 

  130. J. S. Bailey and George Epstein: ‘Single Function Shifting Counters,’ Journal of the Association for Computing Machinery 9 (1962), 375–378.

    Google Scholar 

  131. See Brusentzov and Zhogolev and Verigin and Maslov and Tishulian (1962).

    Google Scholar 

  132. N. P. Brusentzov, Y. A. Zhogolev, V. V. Verigin, S. P. Maslov and A. M. Tishulina: ‘The Setun’ small automatic Digital Computer’ (Russian), Moskovski Universitet Vestnik 4 (1962), 3–12.

    Google Scholar 

  133. Robert A. Bull: ‘The Implicational Fragment of Dummett’s LC,’ The Journal of Symbolic Logic 21 (1962), 189–194. [Reviewed by John Bacon in JSL 33 (1968), 305; by H. Ribeiro in MR 31 (1966), 592; by George Kreisel in ZMG 113 (1965), 3.]

    Google Scholar 

  134. Charles E. Caton: ‘A Stipulation of Logical Truth in a Modal Propositional Calculus,’ Synthese 14 (1962), 196–199. [Reviewed by Alan Rose in MR 40 (1970), 235; by Maxwell J. Cresswell in ZMG 168 (1969), 5.]

    Google Scholar 

  135. See Bailey and Epstein (1962).

    Google Scholar 

  136. Angelo Fadini: ‘II calcolo delle classi in una logica a tre valori di verità,’ Giornale di Matematiche di Battaglini (Naples) 10 (1962), 72–92. [Reviewed by H. Ribeiro in MR 30 (1965), 203; by G. T. Kneebone in ZMG 122 (1966), 9.]

    Google Scholar 

  137. See Hallworth and Heath (1962).

    Google Scholar 

  138. R. P. Hallworth and F. G. Heath: ‘Semiconductor Circuits for Ternary Logic,’ Proceedings of the IEE C-109 (1962), 219–225. Heath (1962). See Hallworth and Heath (1962).

    Google Scholar 

  139. See Brusentzov and Zhogolev and Verigin and Maslov and Tishulina (1962).

    Google Scholar 

  140. Grigor Constantin Moisil: ‘Sur la logique à trois valeurs de Łukasiewicz,’ Analele Universitătii Bucuresti, Seria Acta Logica 5 (1962), 103–117. Reprinted in Moisil (1972), pp. 432–442. [Reviewed by Gene F. Rose in JSL 27 (1962), 368; by Atwell R. Turquette in MR 26 (1963), 1144–1145; by Alan Rose in ZMG 121 (1966), 11.]

    Google Scholar 

  141. Akira Nakamura: ‘Tati ronri so no kôrikei ni tuite’ (On the many-valued logics and an axiomatic system for them), Kagaku kisoron kenkyû (Journal of the Japan Association for Philosophy of Science) 5 (1962), 165–171. [Reviewed by Takeo Sugihara in JSL 31 (1966), 274–275.]

    Google Scholar 

  142. Akira Nakamura: Yôsô ronri to tati ronri no kankei ni tuite’ (On the relation between modal logic and many-valued logic), Kagaku kisoron kenkyû (Journal of the Japan Association for Philosophy of Science) 6 no. 1 (1962), 34–40 and 6 no. 4 (1964), 15–20. [Reviewed by Takeo Sugihara in JSL 35 (1970), 582.]

    Google Scholar 

  143. ‘Remarques sur la machine universelle de Turing,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A, 255 (1962), 2044–2045. [Reviewed by the author in ZMG 253 (1973), 21.]

    Google Scholar 

  144. Arto Salomaa: ‘Some Completeness Criteria for Sets of Functions Over a Finite Domain. I,’ Annales Universitatis Turkuensis, series A. I. 53 (1962). [Reviewed by Alan Rose in ZMG 103 (1963), 245.]

    Google Scholar 

  145. Ivo Thomas: ‘On the Infinity of Positive Logic,’ Notre Dame Journal ofFormal Logic 3 (1962), 108. [Reviewed by John Bacon in JSL 33 (1968), 306.]

    Google Scholar 

  146. Ivo Thomas: ‘Finite Limitations on Dummett’s LC,’ Notre Dame Journalof Formal Logic 3 (1962), 170–174. [Reviewed by John Bacon in JSL 33 (1968), 305.]

    Google Scholar 

  147. See Brusentzov and Zhogolev and Verigin and Maslov and Tishulina (1962).

    Google Scholar 

  148. Tadeusz Traczyk: ‘On Axioms and Some Properties of Post Algebras,’ Bulletin de I’Academie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 10 (1962), 509–512. [Reviewed by George Grätzer in JSL 34(1969), 121.]

    Google Scholar 

  149. See Brusentzov and Zhogolev and Verigin and Maslov and Tishulina (1962).

    Google Scholar 

  150. Y. A. Zhogolev: ‘The order code and interpretative system for the Setun’ computer’ (Russian), USSR Computer and Mathematical Physics 1 (1962), 563–578.

    Google Scholar 

  151. See Brusentzov and Zhogolev and Verigin and Maslov and Tishulina Aqvist (1962).

    Google Scholar 

  152. Lennart Aqvist: ‘Reflections on the Logic of Nonsense,’ Theoria 28 (1962), 138–157. [Reviewed by Edward E. Dawson in JSL 33 (1968), 134–136.] Anderson (1963).

    Google Scholar 

  153. See Anderson and Dietmeyer (1963).

    Google Scholar 

  154. See Belluce and Chang (1963).

    Google Scholar 

  155. L. P. Belluce and Chen Chung Chang: ‘A Weak Completeness Theorem for Infinite-valued First-order Logic,’ The Journal of Symbolic Logic 28 (1963), 43–50. [Reviewed by Alan Rose in MR 34 (1967), 8; by Alan Rose in ZMG 121 (1966), 12; by Bruno Scarpellini in JSL 36 (1971), 332.]

    Google Scholar 

  156. Chen Chung Chang: ‘Logic with Positive and Negative Truth Values,’ Proceedings of a Colloquium on Modal and Many-Valued Logics, Helsinki, 23-26 August, 1962, Acta Philosophica Fennica, fasc. 16 (1963), 19–39. [Reviewed by Alan Rose in MR 28 (1964), 578; by Alan Rose in ZMG 129 (1967), 256–257; by Bruno Scarpellini in JSL 36 (1971), 331–332.]

    Google Scholar 

  157. Chen Chung Chang: ‘The Axiom of Comprehension in Infinite Valued Logic,’ Mathematica Scandinavica 13 (1963), 9–30. [Reviewed by H. J. Keisler in MR 29 (1965), 419–420; by Azriel Lèvy in JSL32 (1967), 128–129.]

    Google Scholar 

  158. See Belluce and Chang (1963).

    Google Scholar 

  159. See Anderson and Dietmeyer (1963).

    Google Scholar 

  160. V. M. Gnidenko: ‘Determinarea ordinelor claselor aproape complete in logica trivalenta,’ Analele Romano-Sovietice, Seria Automat. Cibern. (Bucharest) 2, 9–14.

    Google Scholar 

  161. Ian Hacking: ‘What is Strict Implication?,’ The Journal of Symbolic Logic 28 (1963), 51–71.

    Google Scholar 

  162. See Rabinowicz and Ivas’kiv (1963).

    Google Scholar 

  163. V. A. Ankov: ‘O nékotoryh superkonstruktivnyh isčisléniáh vyskazyvanij,’ Doklady Akademii Nauk SSSR 151 (1963), 796–798. [English translation (‘Some Superconstructive Propositional Calculi’) by Sue Walker in Soviet Mathematics 4 (1963), 1103–1105.] [Reviewed by Gene F. Rose in JSL 35 (1970), 138–139.]

    Google Scholar 

  164. V. A. Ankov: ‘O réalizuémyh formulah logiki vyskazyvanij,’ Doklady Akadémii Nauk SSSR 151 (1963), 1035–1037. [English translation (‘Realizable Formulas of Propositional Logic’) by Elliott Mendelson in Soviet Mathematics 4 (1963), 1146–1148.] [Reviewed by Gene F. Rose in JSL 35 (1970), 138–139.]

    Google Scholar 

  165. V. A. Ankov: ‘O svázi méždu vyvodimost’ú v intuičionistskom isčislénii vyskazyvanij i konéčnymi implikativnymi strukturami,’ Doklady Akadémii Nauk SSSR 151 (1963), 1293–1294. [English translation (‘The Relationships between Deducibility in the Intuitionistic Propositional Calculus and Finite Implicational Structures’) by Elliott Mendelson in Soviet Mathematics 4 (1963), 1203–1204.] [Reviewed by Gene F. Rose in JSL 35 (1970), 138–139; by George Kreisel in ZMG 143 (1968), 252.]

    Google Scholar 

  166. Zbigniew Jordan: ‘Logical Determinism,’ Notre Dame Journal of FormalLogic 4 (1963), 1–38. [Reviewed by G. T. Kneebone in MR 32 (1966), 666–667.]

    Google Scholar 

  167. Y. A. Keir: ‘The Functional Capability of the Saturable Hall Logic Element,’ Lockheed Missiles and Space Company, Sunnyvale California, Note E44, August 1963.

    Google Scholar 

  168. Vladimir G. Kirin: ‘On the Polynomial Representation of Operators in the n-valued Propositional Calculus,’ Gasnik Matematičko-Fizički i Astronomski, Društvo Matematičara i Fizičara Hrvatske, Serija II 18 (1963), 3–12. [Reviewed by E. J. Cogan in MR 29 (1965), 420; by R. L. Graham in JSL 37 (1972), 756.]

    Google Scholar 

  169. Grigor Constantin Moisil: ‘Le Algebre di Lukasiewicz,’ Analele Universitatii Bucuresti, Seria Acta Logica 6 (1963), 97–135. [Reviewed by C. Sicoe in JSL 37 (1972), 187; by Elliott Mendelson in ZMG 241 (1973), 12–13.]

    Google Scholar 

  170. Antonio Monteiro: ‘Sur la définition des algèbres de Lukasiewicz trivalentes,’ Bulletin Mathématique de la Société des Sciences Mathématiques et Physiques de la Republique Populaire de Roumanie, n.s. 7 (55) (1963), 3–12. [Reviewed by Eugen Mihăilescu in JSL 32 (1967), 398–399; by Chen Chung Chang in MR 33 (1967), 6; by Jens Erik Fenstad in ZMG 143 (1968), 6.]

    Google Scholar 

  171. Luiz F. T. Monteiro: ‘Axiomes independents pour les algèbres de Łukasiewicz trivalentes,’ Bulletin Mathematique de la Societe des Sciences Mathematiques et Physiques de la Republique Populaire Roumanie, n.s. 7 (1963), 199–202. Reprinted as Notas de Logica Matematica n° 22, Instituto de Matematica, Universidad Nacional de Sur, Bahia Blanca (1964). [Reviewed by Eugen Mihailescu in JSL 32 (1967), 399; by Jens Erik Fenstad in ZMG 143 (1968), 6.]

    Google Scholar 

  172. Akira Nakamura: On a Simple Axiomatic System of the Infinitely Many-valued Logic Based on Zeitschrift für mathematische Logik und Grundlagen der Mathematik 9 (1963), 251–263. [Reviewed by Arto Salomaa in JSL 30 (1965), 374–375; by Chen Chung Chang in MR 28 (1964), 681; by J. J. F. Nieland in ZMG 121 (1966), 11–12.]

    Google Scholar 

  173. Arthur Norman Prior: ‘The Theory of Implication,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (1963), 1–6. [Reviewed by Alan Ross Anderson in JSL 31 (1966), 665–666; by Alan Rose in MR 26 (1963), 691; by J. J. F. Nieland in ZMG 124 (1966), 246.] Rabinowicz (1963). See Rabinowicz and Ivas’kiv (1963).

    Google Scholar 

  174. See Z. L. Rabinowicz and Yu. L. Ivas’kiv (1963).

    Google Scholar 

  175. Z. L. Rabinowicz and Yu. L. Ivas’kiv (1963) ‘A Class of Canonical Forms for the Representation of 3-valued Functions,’ Engineering Cybernetics 3,p. 17.

    Google Scholar 

  176. Juliusz Reichbach: About Connection of the First-Order Functional Calculus with Many-valued Propositional Calculi,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 9 (1963), 117–124. [Reviewed by Alan Rose in MR 28,224; by George Kreisel in ZMG 163 (1969), 243.]

    Google Scholar 

  177. Nicholas Rescher: ‘A Probabilistic Approach to Modal Logic,’ Proceedings of a Colloquim on Modal and Many-valued Logics, Helsinki, 23–26 August, 1962, Acta Philosophica Fennica, fasc. 16 (1963), 215–226. [Reviewed by John P. Burgess in JSL 35 (1970), 583; by Atwell R. Turquette in MR 28 (1964), 403–404.]

    Google Scholar 

  178. Alan Rose: ‘A Formalisation of the Propositional Calculus Corresponding to Wang’s Calculus of Partial Predicates,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (1963), 177–198. [Reviewed by the author in ZMG 253 (1973), 16.]

    Google Scholar 

  179. Arto Salomaa: ‘Some Analogues of Sheffer Functions in Infinite-valued Logic,’ Proceedings of a Colloquium on Modal and Many-valued Logics, Helsinki, 23–26 August, 1962, Acta Philosophica Fennica, fasc. 16 (1963), 215–226. [Reviewed by N. M. Martin in JSL 31 (1966), 118–119; by Alan Rose in ZMG 121 (1966), 11; by Alan Rose in MR 34 (1967), 203.]

    Google Scholar 

  180. Arto Salomaa: On Essential Variables of Functions, Especially in the Algebra of Logic. Annales Academiae Scientiarum Fennicae, series A. I., Mathematica no. 339, Helsinki 1963, 11 pp. [Reviewed by Norman M. Martin in JSL 32 (1967), 539.]

    Google Scholar 

  181. Arto Salomaa: On Basic Groups for the Set of Functions Over a Finite Domain. Annales Academiae Scientiarum Fennicae, Series A.I., Mathematica no. 338, Helsinki 1963. [Reviewed by Ivo Rosenberg in JSL 33 (1968), 307; by Alan Rose in ZMG 121 (1966), II.]

    Google Scholar 

  182. Arto Salomaa: ‘Some Completeness Criteria for Sets of Functions Over a Finite Domain, II,’ Annales Universitatis Turkuensis, series A.I. 63 (1963). [Reviewed by Alan Rose in ZMG 113 (1965), 3–4.]

    Google Scholar 

  183. Tadeusz Traczyk: ‘Some Theorems on Independence in Post Algebras,’ Bulletin de I’Académie Polonaise des Sciences, Classe III 11 (1963), 3–8. [Reviewed by Ph. Dwinger in JSL 34 (1969), 303.]

    Google Scholar 

  184. Tadeusz Traczyk: ‘Axioms and Some Properties of Post Algebras,’ Colloquium Mathematicum 10 (1963), 198–209. [Reviewed by George Gratzer in JSL 34(1969), 121.]

    Google Scholar 

  185. Atwell R. Turquette: ‘Modality, Minimality, and Many-valuedness,’ Proceedings of a Colloquium on Modal and Many-valued Logics, Helsinki, 23–26 August, 1962, Acta Philosophica Fennica, fasc. 16 (1963), 261–276. [Reviewed by Alan Rose in MR 28 (1964), 578; by Alan Rose in ZMG 121 (1966), 12; by Akira Nakamura in JSL 37 (1972), 753–754.]

    Google Scholar 

  186. V. V. Višin: Toždéstvénnyé préobrazovaniá v četyréhznačnoj logiké,’ Doklady Akademii Nauk SSSR 150 (1963), 719–721. [English translation (‘Identical Transformations in Four-place Logic’) by J. N. Whitney in Soviet Mathematics 4 (1963), 724–726. [Reviewed by Ralph Seifert, Jr. in JSL 37 (1972), 762–763; by D. H. Potts in MR 34 (1967), 203; by Alan Rose in ZMG 147 (1968), 250.]

    Google Scholar 

  187. Aleksandr Aleksandrovich Zinov’ev: Philosophical Problems of Many- valued Logic, edited and translated by Guido Küng and D. D. Lomey. Dordrecht (D. Reidel Publishing Company) 1963. [Reviewed by J. Tucke in MR 28 (1964), 2–3; by Arto Salomaa in ZMG 119 (1966), 249–250.]

    Google Scholar 

  188. LennartÅqvist: ‘Deontic Logic Based on a Logic of ‘Better’,’ Proceedingsof a Colloquium on Modal and Many-valued Logics, Helsinki, 23–26 August, 1962, Acta Philosophica Fennica, fasc. 16 (1963), 285–290. [Reviewed by Edward E. Dawson in JSL 31 (1966), 278–281; by E. J. Lemmon in MR 31 (1966), 6–7.]

    Google Scholar 

  189. LennartÅqvist: ‘Postulate Sets and Decision Procedures for Some Systems of Deontic Logic,’ Theoria 29 (1963), 154–175. [Reviewed by Edward E. Dawson in JSL 31 (1966), 278–281.]

    Google Scholar 

  190. See Santos and Arango (1964).

    Google Scholar 

  191. Lawrence P. Belluce: ‘Further Results on Infinite-valued Predicate Logic,’ The Journal of Symbolic Logic 29 (1964), 69–78. [Reviewed by Alan Rose in MR 31 (1966), 209; by Chen Chung Chang in ZMG 127 (1967), 8; by Bruno Scarpellini in JSL 36 (1971), 332.]

    Google Scholar 

  192. Lawrence Peter Belluce: The Theory of Infinite Valued Predicate Logic. Ph.D. dissertation: University of California at Berkeley, 1964. Ann Arbor (University Microfilms) 1964.

    Google Scholar 

  193. Robert A. Bull: ‘An Axiomatization of Prior’s Modal Calculus Q,’ Notre Dame Journal of Formal Logic 5 (1964), 211–214. [Reviewed by K. Ono in MR 34 (1967), 202; by Maxwell J. Cresswell in JSL 35 (1970), 464.]

    Google Scholar 

  194. Robert A. Bull: ‘Some Results for Implicational Calculi,’ The Journal of Symbolic Logic 29 (1964), 33–39. [Reviewed by John Bacon in JSL 33 (1968), 306; by J. J. F. Nieland in ZMG 154 (1968), 5.]

    Google Scholar 

  195. Dario Casenoves: ‘L-algebres, multivalent logice,’ Revista de la Real Academia de Ciencias Exacta, Fisicasy Naturales de Madrid 58 (1964), 215–237.

    Google Scholar 

  196. Hector-Neri Castañeda: ‘A Note on S5,’ The Journal of Symbolic Logic 29 (1964). 191–192. [Reviewed by Atwell R. Turquette in JSL 31 (1966), 275.]

    Google Scholar 

  197. Jens Erik Fenstad: ‘On the Consistency of the Axiom of Comprehension in the Lukasiewicz Infinite-valued Logic,’ Mathematica Scandinavica 14 (1964), 65–74. [Reviewed by Chen Chung Chang in MR 30 (1965), 3; by Azriel Levy in JSL 32 (1967), 128–129.]

    Google Scholar 

  198. G. P. Gavrilov: ‘On quasi-Peano functions’ (Russian), Doklady Akadémii Nauk SSSR 156 (1964), 1011–1013. [English translation in Soviet Mathematics 5 (1964), 750–752.] [Reviewed by Alan Rose in ZMG 212 (1971), 315.]

    Google Scholar 

  199. Leonard Goddard: ‘Sense and Nonsense,’ Mind, n.s. 73 (1974), 309–331.

    Google Scholar 

  200. Yu. V. Golunkov: ‘On the equivalence of formulae realizing transformations of functors of a k-valued logic’ (Russian), Kazanskiĭ Ordena Trudovogo Krasnogo Znameni Gosudarstvennyĭ Universitet im V. I. Ul’janova-Lenina 124 (1964), pp. 71–92. [Reviewed by Haskell B. Curry in MR 34 (1967), 429.]

    Google Scholar 

  201. See Hasegawa and Nagaoka and Tezuka and Kasahara (1964).

    Google Scholar 

  202. Toshiharu Hasegawa, Y. Nagaoka, Yoshikazu Tezuka and Yoshiro Kasahara: ‘Tunnel Diode Circuits for Ternary Logic,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communication Engineers of Japan 10 (1964), 88–95. Kasahara (1964). See Hasegawa and Nagaoka and Tezuka and Kasahara (1964). Kooi (1964). See Kooi and Wenver (1964).

    Google Scholar 

  203. C. F. Kooi and J. L. Wenver:Nonlinear Hall-effects Ternary

    Google Scholar 

  204. Logic Element,’ Solid State Electronics 1 (1964), 34. Krishnamurty (1964). E. V. Krishnamurty: ‘An Algebra for (m+p) Switching Circuits,’ The University of Chicago, The Institute for Computer Research Quarterly Report 5 (May 1964), IIIC.

    Google Scholar 

  205. Grigor Constantin Moisil: ‘Sur les logiques de Lukasiewicz a un nombre fini de valeurs,’ Revue Roumanienne des Mathematiques Pures 9 (1964), 905–920. Re printed in Moisil (1972), pp. 583–595. [Reviewed by Atwell R. Turquette in MR 32 (1966), 6.]

    Google Scholar 

  206. See Yoeli and Rinon (1964).

    Google Scholar 

  207. Alan Rose: ‘Formalisations de calculs propositionnels polyvalents à foncteurs variables,’ Comptes Rendus Hebdomadaires des Seances de I’Academie des Sciences, serie A 258 (1964), 1951–1953. [Reviewed by Atwell R. Turquette in MR 28 (1964), 574; by Ivo Rosenberg in ZMG 149 (1968), 3–4.]

    Google Scholar 

  208. Wadow Sadowski: ‘Proof of axiomatizability of certain n-valued propositional calculi’ (Polish), Studia Logica 15 (1964), 25–36. [Reviewed by Andrzej Mostowski in MR 32 (1966), 388–389.]

    Google Scholar 

  209. F. Salter: ‘A Ternary-memory Element Using a Tunnel Diode,’ IEEE Transactions on Electronic Computers EC-13 (1964), 155–156. Santos (1964). See Santos and Arango (1964).

    Google Scholar 

  210. J. Santos and H. Arango: ‘On the Analysis and Synthesis of 3-valued Digital Systems,’ AFIPS Conference Proceedings 25 (1964), 463–475.

    Google Scholar 

  211. Rolf Schock: ‘On Finitely Many-valued Logics,’ Logique et Analyse, n.s. 7 (1964), 43–58. [Reviewed by Alan Rose in MR 31 (1966), 209; by Ivo Rosenberg in ZMG 127 (1967), 8; by Robert K. Meyer in JSL 35 (1970), 140–142.]

    Google Scholar 

  212. Rolf Schock: ‘On Denumerably Many-valued Logics,’ Logique et Analyse, n.s. 7 (1964), 190–195. [Reviewed by Alan Rose in MR 31 (1966), 209; by Robert K. Meyer in JSL 35 (1970), 140–142.] Schofield (1964). Peter Schofield: ‘On a Correspondence Between Many-valued and Two- valued Logics,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik, 10 (1964), 265–274. [Reviewed by Norman M. Martin in JSL 32 (1967), 539.]

    Google Scholar 

  213. Bolestaw Sobocinski: ‘On the Propositional System A of Vučkovič and Its Extension. I,’ Notre Dame Journal of Formal Logic, 5 (1964), 141–153. [Reviewed by Alan Rose in MR 36 (1968), 971; in ZMG 133 (1967), 254.]

    Google Scholar 

  214. Boleslaw Sobocinski: ‘On the Propositional System A of Vučkovič and Its Extension. II,’ Notre Dame Journal of Formal Logic 5 (1964), 223–237. [Reviewed by B. van Rootselaar in ZMG 171 (1969), 252.]

    Google Scholar 

  215. L. M. Sosinskn: ‘On the representation of functions by irreversible superpositions in three-valued logic’ (Russian), Problemy Kibérnétiki 12 (1964), 57–68. [Reviewed by V. Vuckovic in MR 34 (1967), 756.]

    Google Scholar 

  216. Takeo Sugihara: Yôsô ronrigaku kenkyû (A Study on Modal Logic). Tokyo (Sankibo) 1964. [Reviewed by Akira Nakamura in JSL 32 (1967), 544.]

    Google Scholar 

  217. Takeo Sugihara: ‘Sequential Truth-functions,’ Bulletin of Fukui University, School of Arts and Science, Humanities no. 13 (1964).

    Google Scholar 

  218. Tadeusz Traczyk: ‘An Equational Definition of a Class of Post Algebras,’ Bulletin de I’Academie Polonaise des Sciences, Classe III 12 (1964), 147–149. [Reviewed by Philip Dwinger in JSL 34 (1969), 363; by D. Ponasse in ZMG 171 (1969), 257.]

    Google Scholar 

  219. Tadeusz Traczyk: ‘An Equational Definition of a Class of Post Algebras,’ Bulletin de I’Academie Polonaise des Sciences, Classe III 12 (1964), 147–149. [Reviewed by Philip Dwinger in JSL 34 (1969), 363; by D. Ponasse in ZMG 171 (1969), 257.]

    Google Scholar 

  220. See Kooi and Wenver (1964).

    Google Scholar 

  221. See Yoeli and Rinon (1964).

    Google Scholar 

  222. Michael Yoeli and S. Rinon: ‘Application of Ternary Algebra to the Study of Static Hazards,’ Journal of the Association for Computing Mathematics 11 (1964), 84–97.

    Google Scholar 

  223. N. N. Aizenberg: ‘Representation of a sum mod m in a class of normal forms of functions of w-valued logic’ (Russian), Kibérnétika 1965 no. 4, pp. 101–102. [Registered in ZMG 34 (1967), 8; in ZMG 223 (1972), 11.]

    Google Scholar 

  224. See Santos and Arango and Pascual (1965).

    Google Scholar 

  225. Edward BaJuka: ‘On Verification of the Expressions of Many-valued Sentential Calculi. I,’ Studia Logica 17 (1965), 53–73. [Reviewed by D. H. Potts in MR 34 (1967), 755.]

    Google Scholar 

  226. N. P. Brusentzov: ‘A Ternary Arithmetic Machine’ (Russian), Moskovski Universitet Vestnik 2 (1965), 39–48.

    Google Scholar 

  227. Roberto Cignoli: ‘Boolean Elements in Lukasiewicz Algebras. I,’ Proceedings of the Japan Academy 41 (1965), 670–675. [Reviewed by Eugen Mihailescu in JSL 33 (1968), 307–308; by Tadeusz Traczyk in ZMG 168 (1969), 6.]

    Google Scholar 

  228. See Cignoli and Monteiro (1965).

    Google Scholar 

  229. Roberto Cignoli and Antonio Monteiro: ‘Boolean Elements in Lukasiewicz Algebras II,’ Proceedings of the Japan Academy 41 (1965), 676–680. [Reviewed by Eugen Mihăilescu in JSL 33 (1968), 308; by Tadeusz Traczyk in ZMG 168(1969), 5.]

    Google Scholar 

  230. E. Eichelberger: ‘Hazard Detection in Combinational and Sequential Circuits,’ IBM Journal of Research and Development 9 (1965), 90–99.

    Google Scholar 

  231. G. P. Gavrilov: ‘On functional completeness in countably-valued logic’ (Russian), Problemy Kibérnétiki, 15 (1965), 5–64. [Reviewed by E. Zaharova in MR 37 (1969), 942.]

    Google Scholar 

  232. L. Iturrioz: ‘Axiomas para il calculo proposicional trivalente de Lukasiewicz,’ Revue Union Matematica Argentina y Asociation Fisica Argentina 22 (1965), 150.

    Google Scholar 

  233. Dieter Klaua: ‘Über einen Ansatz zur mehrwertigen Mengenlehre,’ Monatsberichte der deutschen Akademie der Wissenschaften zu Berlin 1 (1965), 859–867. [Reviewed by Azriel Levy in MR 33 (1967), 218–219; by D. Schwartz in ZMG 154 (1968), 260.]

    Google Scholar 

  234. See Klaua (1965).

    Google Scholar 

  235. George L. Kline: ‘N. A. Vasil’ev and the Development of Many-valued Logics,’ Contributions to Logic and Methodology in Honor of J. M. Bochenski, edited by Anna-Teresa Tymieniecka in Collaboration with Charles D. Parsons, Amsterdam (North-Holland Publishing Company) 1965, pp. 315–326. [Reviewed by Alan Rose in ZMG 145(1968), 7.]

    Google Scholar 

  236. See Cignoli and Monteiro (1965).

    Google Scholar 

  237. Luiz F. T. Monteiro: ‘Sur les algebres de Lukasiewicz injectives,’ Proceedings of the Japan Academy 41 (1965), 578–581. [Reviewed by Eugen Mihailescu in JSL 33 (1968), 308; by Jens Erik Fenstad in ZMG 143 (1968), 6.]

    Google Scholar 

  238. V. L. Murskiĭ: ‘Suščestvovanié v trehznacnoj logiké zamknutogo klassa s konéčnym bazisom, né imévščego konéčnoj polnoj sistémy toždéstv,’ Doklady Akadémii Nauk SSSR 163 (1965), 815–818. [English translation (‘The Existence in Three-valued Logic of a Closed Class with Finite Basis, not having a Finite Complete System of Identities’) by Elliott Mendelson in Soviet Mathematics 6 (1965), 1020–1024. [Reviewed by Ralph Seifert, Jr. in JSL 37 (1972), 762–763; by Roger C. Lyndon in MR 32 (1966), 667; by Alan Rose in ZMG 154 (1968), 5.]

    Google Scholar 

  239. Akira Nakamura: ‘On the Infinitely Many-valued Double-threshold Logic,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 11 (1965), 93–101. [Reviewed by Arto Salomaa in JSL 31 (1966), 665; by Atwell R. Turquette in MR 33 (1967), 6; by Arto Salomaa in ZMG 168 (1969), 4.] Nicolau (1965). Edmond Nicolau: ‘Sinteza unei clase de automate care modelează operatori in logica N-valentă cu functii de timp date,’ Bulletin de Inst. Polit. Gh. Gheorghiu Dej 26 (1965), 101.

    Google Scholar 

  240. B. L. Ovsievic: ‘Some properties of symmetric functions of the three-valued logic’ (Russian), Problemy Peredaci Informacii 1 (1965), 57–64. [Registered in ZMG 261 (1974), 20.]

    Google Scholar 

  241. See Santos and Arango and Pascual (1965).

    Google Scholar 

  242. M. F. Raca: ‘Class of logic functions corresponding to the first matrix of Jaśkowski’ (Russian), Studies in general algebra, Akadémii Nauk Moldav. SSR, Kishniev, pp. 99–110. [Registered in MR 34 (1967), 203.] Rose (1965). Alan Rose: ‘A Formalization of Post’s m-valued Propositional Calculus with Variable Functors,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (1965), 221–226. [Reviewed by Atwell R. Turquette in MR, 33 (1967), 6; by the author in ZMG 212 (1971), 315.]

    Google Scholar 

  243. Ivo G. Rosenberg: ‘La structure des fonctions de plusieurs variables sur un ensemble fini,’ Comptes Rendus Hebdomadaires des Séances de I’Academie des Sciences 260 (1965), 3817–3819. [Reviewed by Alan Rose in MR 31 (1966), 209.] Rosenfeld (1965). See Yoeli and Rosenfeld (1965).

    Google Scholar 

  244. See Santos and Arango and Pascual (1965).

    Google Scholar 

  245. Rolf Schock: ‘Some Theorems on the Relative Strengths of Many-valued Logics,’ Logique et Analyse, n.s. 8 (1965), 101–104. [Reviewed by B. Lercher in MR 34 (1967), 1023; by Robert K. Meyer in JSL 35 (1970), 140–142.]

    Google Scholar 

  246. Krister Segerberg: ‘A Contribution to Nonsense-logics,’ Theoria 31 (1965), 199–217. [Reviewed by Edward E. Dawson in JSL 33 (1968), 134–136.]

    Google Scholar 

  247. Frederico M. Siosen: ‘A characterization of the tautologies in the three-valued propositional calculus’ (Spanish), Gaceta matematica (Madrid) 17 (1965), 68–74. [Registered in ZMG 156 (1969), 7.]

    Google Scholar 

  248. Tadeusz Traczyk: ‘Weak Isomorphism of Boolean and Post Algebras,’ Colloquium Mathematicum 13 (1965), 159–164.

    Google Scholar 

  249. A. S. Troelstra: ‘On Intermediate Propositional Logics,’ Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A 68 (1965), 141–152; also printed in Indagationes Mathematicae 27 (1965), 141–152. [Reviewed by Toshio Umezawa in JSL 33 (1968), 607; by Toshio Umezawa in ZMG 143 (1968), 11.] Ušan (1965). Janez Ušan: ‘Definition of a constructability in algebraic systems with finite sets (partial and many-valued) of -operations and some of their properties’ (Serbo-Croatian), Matematicki Vesnik, n.s. 2 (17) (1965), 39–48. [Registered in ZMG 178 (1970), 311.]

    Google Scholar 

  250. V. I. Varsavskif: ‘Functional separability in three-valued logic’ (Russian), Izvestià Akadémii Nauk SSSR, Techničeskaà Kibérnétika, 1965, no. 2, pp. 43–46. [Registered in ZMG 207 (1971), 291.] Yoeli (1965). See Yoeli and Rosenfeld (1965).

    Google Scholar 

  251. Michael Yoeli: ‘Ternary Transmission Contact Network,’ IEEE Transactions on Circuit Theory CT-12 (1965), 414.

    Google Scholar 

  252. Michael Yoeli: ‘A Group Theoretical Approach to Two Rail Cascades,’ IEEE Transactions on Electronic Computers EC-14 (1965), 815.

    Google Scholar 

  253. Michael Yoeli and G. Rosenfeld: ‘Logical Design of Ternary Switching Circuits,’ IEEE Transactions on Electronic Computers EC-14 (1965), 19–29.

    Google Scholar 

  254. L. A. Zadeh: ‘Fuzzy Sets,’ Information and Control 8 (1965), 338–353. [Reviewed by the author in MR 36 (1968), 514–515.]

    Google Scholar 

  255. Ja. H. Adži-Veli: ‘An application of the Balke-Poreckiĭ method to the minimization of the function of a many-valued logic’ (Russian), Doklady Akademii Nauk UzSSR 1 (1966), pp. 10–12. [Reviewed by A. Tauts in MR 42 (1971), 787.]

    Google Scholar 

  256. See Arango and Pascual and Valentinuzz and Santos (1966). Arango and Pascual and Valentinuzz and Santos (1966). H. Arango, M. Pascual, M. E. Valentinuzz and J. Santos: Threshold Implementation of Ternary Systems, IEEE Transactions on Electronic Computers EC-15 (1966), 661–66.

    Google Scholar 

  257. F. G. Asenjo: ‘A Calculus of Antinomies,’ Notre Dame Journal of Formal Logic 7 (1966), 103–105. [Reviewed by R. L. Goodstein in MR 34 (1967), 1021.]

    Google Scholar 

  258. J. S. Bailey: ‘Generalized Single-ended Computers,’ Journal of the Association for Computing Machines 13 (1966), 412–418. Bohm (1966). See Bohm and Jacopini (1966).

    Google Scholar 

  259. C. Böhm and G. Jacopini: ‘Flow Diagrams, Turing Machines, and Language with Only Two Formation Rules,’ Communications of the Association for Computing Machines 9 (1966), 366–371. Caracciolo di Forino (1966). Alfonso Caracciolo de Forino: ‘m-valued Logics and ra-ary Selection Functions,’ Automata Theory, edited by E. R. Caianiello, New York (Academic Press) 1966, pp. 107–114. [Reviewed by George H. Rousseau in ZMG 199 (1971), 3–4.]

    Google Scholar 

  260. T, Drange: Type Crossings. The Hague (Mouton) 1966.

    Google Scholar 

  261. Philip Dwinger: ‘Notes on Post Algebras,’ Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A 69 (1966), 462–478; also printed in Indagationes Mathematicae 28 (1966), 462–478. [Reviewed by Tadeusz Traczyk in JSL 33 (1968), 626; by Tadeusz Traczyk in ZMG 148 (1968), 242–243.]

    Google Scholar 

  262. See Fisch and Turquette (1966).

    Google Scholar 

  263. Max Fisch and Atwell R. Turquette: ‘Peirce’s Triadic Logic,’ The Transactions of the Charles S. Peirce Society 2 (1966), 71–85.

    Google Scholar 

  264. R. V. Freĭvald: ‘A completeness criterion for partial functions of logic and many-valued logic algebras’ (Russian), Doklady Akademii Nauk SSSR 167 (1966), 1249–1250. [English translation in Soviet Physics, Doklady 11 (1966), 288–289.] [Reviewed by Alan Rose in MR 35 (1968), 268.]

    Google Scholar 

  265. See JalbonskiTand Gavrilov and Kudrjavcev (1966).

    Google Scholar 

  266. Leonard Goddard: ‘Predicates, Relations and Categories,’ Australasian Journal of Philosophy 44 (1966), 139–171.

    Google Scholar 

  267. Masazumi Hanazawa: ‘A Characterization of Axiom Schema Playing the Role of Tertium Non Datur in Intuitionistic Logic,’ Proceedings of the Japan Academy 42 (1966), 1007–1010. [Reviewed by Richmond H. Thomason in ZMG 191 (1970), 286.]

    Google Scholar 

  268. Tsutomu Hosoi: ‘Algebraic Proof of the Separation Theorem on Dummett’s LC,’ Proceedings of the Japan Academy 42 (1966), 693–695. [Reviewed by Alfred Horn in JSL 33 (1968), 128–129; by R. L. Goodstein in MR 34 (1967), 1358; by Robert A. Bull in ZMG 168(1969), 3–4.]

    Google Scholar 

  269. Tsutomu Hosoi: ‘On the Separation Theorem of Intermediate Propositional Calculi,’ Proceedings of the Japan Academy 42 (1966), 535–538. [Reviewed by Alfred Horn in JSL 34(1969), 505; by R. L. Goodstein in MR 34 (1967), 1357–1358; by Robert A. Bull in ZMG 168 (1969), 3–4.]

    Google Scholar 

  270. Tsutomu Hosoi: ‘The Separable Axiomatization of the Intermediate Propositional System Sn,’ Proceedings of the Japan Academy 42 (1966), 1001–1006. [Reviewed by Alfred Horn in JSL 34 (1969), 505; by David Nelson in MR 36 (1968), 9; by Toshio Umezawa in ZMG 156 (1969), 8.]

    Google Scholar 

  271. Tsutomu Hosoi: ‘The Axiomatization of the Intermediate Propositional Systems S of Gödel,’ Journal of the Faculty of Science, University of Tokyo, Section I 13(1966), 183–187. [Reviewed by David Nelson in MR 36 (1968), 9; by Toshio Umezawa in ZMG 156 (1969), 8.]

    Google Scholar 

  272. Seppo Ilkka: A New Arithmetization for Finitely Many-Valued Propositional Calculi. Societas Scientiarum Fennica, Commentationes physico-mathematicae 32 no. 8 (1966), Helsinki. [Reviewed by Akira Nakamura in JSL, 34 (1969), 304; by R. F. Wheeler in MR 35 (1968), 268; by Tsutomu Hosoi in ZMG 143 (1968), 8.]

    Google Scholar 

  273. See Iséki and Tanaka (1966).

    Google Scholar 

  274. Kiyoshi Iséki: ‘Some Three Valued Logics and Its Algebraic Representations,’ Proceedings of the Japan Academy 42 (1966), 761–762. [Reviewed by Alan Rose in MR 35 (1968), 268; by Alan Rose in ZMG 145 (1968), 7.]

    Google Scholar 

  275. Kiyoshi Iséki and Shôtarô Tanaka: ‘A Pentavalued Logic and Its Algebraic Theory,’ Proceedings of the Japan Academy 42 (1966), 763–764. [Reviewed by Alan Rose in ZMG 145 (1968), 7.]

    Google Scholar 

  276. See Jablonskii and Gavrilov and Kudrjavcev (1966).

    Google Scholar 

  277. S. V. Jablonskiĭ, G. P. Gavrilov and V. B. Kudrjavcev: Funkcii algebry logiki i klassy Posta. Moscow (Izdatel’stvo ‘Nauka’) 1966. [Reviewed by S. Rudeanv in ZMG 171 (1969), 277.]

    Google Scholar 

  278. See Bohm and Jacopini (1966).

    Google Scholar 

  279. Vladimir G. Kirin: ‘Gentzen’s Method for the Many-valued Propositional Calculi,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1966), 317–332. [Reviewed by Akira Nakamura in JSL 32 (1967), 538–539; by Atwell R. Turquette in MR 34 (1967), 202–203; by Alan Rose in ZMG 147 (1968), 250.]

    Google Scholar 

  280. Dieter Klaua: ‘Cber einen zweiten Ansatz zur mehrwertigen Mengenlehre,’ Monatsberichte der deutschen Akademie der Wis sense haft en zu Berlin 8 (1966), 161–177. [Reviewed by D. Schwartz in ZMG 154 (1968), 260–261.]

    Google Scholar 

  281. See Mine and Koga (1966).

    Google Scholar 

  282. Stephan Korner: Experience and Theory. An Essay in the Philosophy of Science. London (Routledge and Kegan Paul) 1966.

    Google Scholar 

  283. Peter Holger Krauss: Probability Logic. Ph.D. dissertation: University of California at Berkeley, 1966. Ann Arbor (University Microfilms) 1967.

    Google Scholar 

  284. See Jablonskiĭ and Gavrilov and Kudrjavcev (1966).

    Google Scholar 

  285. A. I. Mal’cev. ‘Iterativnyé algébry i mnogoobraziá Posta’ (Iterative algebra and Post manifolds), Algébra i Logika, Séminar 5 (1966), 5–24. [Reviewed by Ivo G. Rosenberg in JSL 36 (1971), 338.]

    Google Scholar 

  286. Storrs McCall: ‘Connexive Implication,’ The Journal of Symbolic Logic 31 (1966), 415–433. [Reviewed by Hugues Leblanc in MR 36 (1968), 505; by John T. Canty in ZMG 161 (1969), 4–5.]

    Google Scholar 

  287. McCall (1966a). See McCall and Meyer (1966).

    Google Scholar 

  288. Storrs McCall and Robert K. Meyer: Pure Three-valued Łukasiewiczian Implication, The Journal of Symbolic Logic 31 (1966), 399–405. [Reviewed by Atwell R. Turquette in JSL 33 (1968), 133–134; by D. H. Potts in MR 34 (1967), 756; by Alan Rose in ZMG 154 (1968), 255.]

    Google Scholar 

  289. C. A. Meredith: ‘Postulates for Implicational Calculi,’ The Journal of Symbolic Logic 31 (1966), 7–8. [Reviewed by John Bacon in JSL 33 (1968), 306.]

    Google Scholar 

  290. Robert Kenneth Meyer: Topics in Modal and Many-valued Logic. Ph.D. dissertation: University of Pittsburgh, 1966. Ann Arbor (University Microfilms) 1966.

    Google Scholar 

  291. Robert K. Meyer: Pure Denumerable Łukasiewiczian Implication, The Journal of Symbolic Logic 31 (1966), 575–580. [Reviewed by Alan Rose in JSL 33 (1968), 308; by Hugues Leblanc in MR 35 (1968), 979; by Tsutomu Hosoi in ZMG 148 (1968), 6.]

    Google Scholar 

  292. See McCall and Meyer (1966).

    Google Scholar 

  293. See Mine and Koga (1966).

    Google Scholar 

  294. Hisashi Mine and Yoshiaki Koga: ‘A Property of Three-valued Functions of One Variable,’ Electronics and Communications in Japan, Institute of Electrical and Electronics Engineers 49 (1966), 128–130. [Reviewed by the authors in MR, vol. 35 (1968), p. 980.]

    Google Scholar 

  295. Grigor Constantin Moisil: Zastosowanie Algebr Łukasiewicza do Teorii Ukladow Przekaznikowo-Stykowych (Application of Łukasiewiczian Algebra to the Study of Relay-contact Networks), volume 1. Warsaw (Wydannictwo Polskiej Akadémii Nauk) 1966. [Reviewed by Corneliu O. Sicoe in JSL 37 (1972), 187–188.]

    Google Scholar 

  296. Shûrô Nagata: ‘A Series of Successive Modifications of Peirce’s Rule,’ Proceedings of the Japan Academy 42 (1966), 859–861. [Reviewed by J. J. F. Nieland in ZMG 192 (1972), 28.]

    Google Scholar 

  297. Biswambhar Pahi: ‘On the Non-existence of the Finite Characteristic Matrices for Some Implicational Calculi,’ The Journal of Symbolic Logic 31 (1966), 682–683.

    Google Scholar 

  298. Biswambhar Pahi: Studies in Implicational Calculi. Ph.D. dissertation: Yale University, 1966. Ann Arbor (University Microfilms) 1966.

    Google Scholar 

  299. See Arango and Pascual and Valentuzz and Santos (1966).

    Google Scholar 

  300. Witold A. Pogorzélski: ‘Nota o modelach dwuwartościowej logiki implikcacyjno-negacyjnej w wielowartościowych logikach -Łukasiewicza,’ Acta Universitatis Wratislaviensis 52 (1966), 93–98.

    Google Scholar 

  301. Tadeusz Prucnal: ‘A Proof of Completeness of the Three-valued C-N Sentential Calculus of Łukasiewicz,’ Studia Logica 18 (1966), 65–72. [Reviewed by L. N. Gal in MR 33 (1967), 1235.]

    Google Scholar 

  302. M. F. Raca: ‘A criterion of functional completeness in logic corresponding to the first Jaskowski matrix’ (Russian), Doklady Akdémii Nauk SSSR, 168 (1966), 524–527. [English translation in Soviet Mathematics 7 (1966), 683–687.] [Reviewed by G. Asser in MR 34 (1967), 203; by Bas C. van Fraassen in ZMG 178 (1970), 306.]

    Google Scholar 

  303. Alan Rose: ‘A Formalisation of an Infinite-valued Propositional Calculus in which the Truth Values are Lattice Ordered,’ The Journal of Symbolic Logic 31 (1966), 683–684.

    Google Scholar 

  304. Alan Rose: ‘Formalisation d’un calcul propositionnel à un nombre infini de valeurs lesquelles forment un treillis,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 262 (1966), 1139–1141. [Reviewed by Arnold Oberschelp in MR 34 (1967), 200; by Tsutomu Hosoi in ZMG 199 (1971), 4.]

    Google Scholar 

  305. Alan Rose: ‘Formalisation de certains calculs propositionnels polyvalents à foncteurs variables aù cas ou certaines valeurs sont sur désignées,’ Comptes Rendus Hebdomadaires des Séances de I’Académie de Sciences, série A 262 (1966), 1233–1235. [Reviewed by Arnold Oberschelp in MR 34 (1967), 203; by Tsutomu Hosoi in ZMG 199 (1971), 4.]

    Google Scholar 

  306. Alan Rose: An Algebraic Model of the m-valued Propositional Calculus with Variable Functors,’ Revista de la Union Matematica Argentina 23 (1966–68), 195–197. [Reviewed by Newton C. A. da Costa in MR 41 (1971), 595; by Louis F. Goble in ZMG 185 (1970), 10.]

    Google Scholar 

  307. Richard Routley: ‘On a Significance Theory,’ Australasian Journal of Philosophy 44 (1966), 172–209.

    Google Scholar 

  308. See Arango and Pascual and Valentuzz and Santos (1966).

    Google Scholar 

  309. Peter Schofield: ‘Complete Subsets of Mappings Over a Finite Domain,’ Proceedings of the Cambridge Philosophical Society 62 (1966), 597–611. [Reviewed by Norman M. Martin in JSL 32 (1967), 539–540; by Akira Nakamura in ZMG 178 (1970), 306–307.]

    Google Scholar 

  310. Corneliu O. Sicoe: ‘Elemente strict chrysippiene in algebre lukasiewicziene polivalente’ (Strict Chrysippian elements in polyvalent Łukasiewicz algebras), Analele Universitătii Bucuresti, Seria Stiintele Naturii, Maternalită-Mecanică 15 (1966), 123–126. [Reviewed by the author in MR 36 (1968), 735; by the author in ZMG 156 (1969), 7.]

    Google Scholar 

  311. M. Stojaković: ‘Matrizen Inversion in der algebraischen Theorie der Wahrheitsfunktionen der mehrwertigen Logik,’ Bulletin de I’Académie Serbe des Arts, Classe des Sciences Mathematiques et Naturelles Sciences, Mathématiques 35 (1966), 39–43. [Reviewed by A. Nerode in MR 35 (1968), 1205.]

    Google Scholar 

  312. See Iseki and Tanaka (1966).

    Google Scholar 

  313. S. Thelliez: ‘Simulateur de circuits logique ternaires,’ Automatisme 11 (1966), 296–300.

    Google Scholar 

  314. S. Thelliez: ‘Theorie de la décomposition appliquée la logique ternaire,’ Note interne du Laboratoire d’Automatique Conservatoire National des Arts et Métier, Paris (1966).

    Google Scholar 

  315. See Yoeli and Turner (1966).

    Google Scholar 

  316. Atwell R. Turquette: ‘A Method for Constructing Implication Logics,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 12 (1966), 267–278. [Reviewed by Storrs McCall in JSL 33 (1968), 308–109; by K. Schultze in ZMG 147 (1968), 249–250.]

    Google Scholar 

  317. See Fisch and Turquette (1966).

    Google Scholar 

  318. See Arango and Pascual and Valentinuzz and Santos (1966).

    Google Scholar 

  319. Bas C. van Fraassen: ‘Singular Terms, Truth-value Gaps, and Free Logic,’ The Journal of Philosophy 63 (1966), 481–495.

    Google Scholar 

  320. Roger F. Wheeler: ‘Complete Connectives for the 3-valued Propositional Calculus,’ Proceedings of the London Mathematical Society 16 (1966), 167–191. [Reviewed by Arto Salomaa in JSL 33 (1968), 127–128; by V. Devidé in MR 32 (1966), 1260; by Alan Rose in ZMG 143 (1968), 10.]

    Google Scholar 

  321. Roger F. Wheeler: ‘Complete Connectives for the 3-valued Propositional Calculus,’ The Journal of Symbolic Logic 31 (1966), 298.

    Google Scholar 

  322. See Yoeli and Turner (1966).

    Google Scholar 

  323. L. A. Zadeh: ‘Shadows of fuzzy sets’ (Russian), Problémy Peredači Informacii 2 no. 1 (1966), 37–44. [Reviewed by Siegfried Gottwald in ZMG 263 (1974), 20.]

    Google Scholar 

  324. E. U. Zaharova: ‘Ob odnom dostatocnom uslovii polnoty v Pk’ (On a sufficient condition for completeness in Pk), Problémy Kibérnétiki 16 (1966), 239–244. [Reviewed by Ivo G. Rosenberg in JSL 33 (1968), 606.]

    Google Scholar 

  325. V. Abdugaliev: ‘Normal forms of k-valued logic’ (Russian), Kibérnétika, 1967 no. 1, pp. 16–20. [English translation in Cybernetics 3 (1967), 13–16.] [Reviewed by the author in MR 44 (1972), 291; by Ivo G. Rosenberg in ZMG 204 (1971), 2.]

    Google Scholar 

  326. See La Macchia and Abian (1967).

    Google Scholar 

  327. See Abian and La Macchia (1967).

    Google Scholar 

  328. Alexander Abian and Samuel D. La Macchia: ‘Examples of Generalized Sheffer Functions,’ Acta Mathematica Academiae Scientiarum Hungaricae 18 (1967), 189–190. [Reviewed by A. Yaqub in MR 38 (1969), 190.]

    Google Scholar 

  329. Robert J. Ackermann: An Introduction to Many-valued Logics. New York (Dover Publications Inc.) 1967.

    Google Scholar 

  330. R. A. Baĭramov: ‘K voprosu o funktsionalnoi polnosti v mnogoznachinykh logikakh’ (On the question of functional completeness in many-valued logic), Diskretnyĭ Analiz 11 (1967), 3–20. [Reviewed by Arto Salomaa in MR 37 (1969), 943; by Ivo G. Rosenberg in ZMG 182 (1970), 317.]

    Google Scholar 

  331. R. A. Baĭramov: ‘O funktsiiakh Sefferi v mnogoznachinoi logikakh,’ (Sheffer functions in many-valued logic), Problems in the Theory of Electronic Digital Computers (Russian), Akademii Nauk Ukrains’koi SSR (Kiev) 3 (1967), 62–71. [Reviewed by Arto Salomaa in MR 37 (1969), 943.]

    Google Scholar 

  332. R. A. Baĭramov: ‘Ob odnoi serii predpolnykh klassov v k-znachinoi logike,’ Kibérnétika 1967 no. 1, p. 79. [English translation (‘A Series of Precomplete Classes in k-valued Logic’) in Cybernetics 3 (1967), 6–7.] [Reviewed by Alan Rose in MR 43 (1972), 6; by Ivo G. Rosenberg in ZMG 189 (1970), 281–282.]

    Google Scholar 

  333. See Shipecki and Bryll and Prucnal (1967).

    Google Scholar 

  334. G. A. Burle: ‘Classes of k-valued logic which contain all functions of a single variable’ (Russian), Diskretnyĭ Analiz 10 (1967), 3–7. [Reviewed by Arto Salomaa in MR 36(1968), 274.]

    Google Scholar 

  335. Michel Carvallo: ‘Sur la résolution des équations de Post,’ Comptes Rendus Hebdomadaires des Seances de I’Académie des Sciences, série A 265 (1967), 601–602. [Reviewed by Jens Erik Fenstad in MR 37(1969), 7; by A. F. Pixley in ZMG 169(1969), 304.]

    Google Scholar 

  336. Kiril N. Čimev: ‘A certain kind of dependence of certain functions of Pk on their arguments’ (Bulgarian), Godišnik na Visšite tehničeskie Učebni Zavedeniaa, Matematika 4 (1967), 5–12. [Reviewed by G. E. Mine in MR 45 (1973), 583.]

    Google Scholar 

  337. A. Luis Darzins: “‘The Unambiguous Characterization Problem’ for Many-valued and Aristotelian and—and or—Propositional and Functional Calculi,” The Journal of Symbolic Logic 32 (1967), 558–559.

    Google Scholar 

  338. S. W. Golumb: Shift Register Sequences. San Francisco (Holden-Day) 1967.

    Google Scholar 

  339. A. G. Gorelik: ‘Geometric interpretation of a three-valued algebra’ (Russian), Vesci Akadèmii Navuk BSSR, Seryja Fizika-matèmatycnyh Navuk 1 (1967), 9–17. [Reviewed by Albert A. Mullin in MR 34 (1967), 1358.]

    Google Scholar 

  340. R. L. Graham: ‘On n-valued Functionally Complete Truth Functions,’ The Journal of Symbolic Logic 32 (1967), 190–195. [Reviewed by Norman M. Martin in JSL 36 (1971), 691; by L. Hay in MR 36 (1968), 1207; by the author in ZMG 148 (1968), 243.]

    Google Scholar 

  341. Tsutomu Hosoi: ‘On Intermediate Logics, I,’ Journal of the Faculty of Science, University of Tokyo, section I 14 (1967), 293–312. [Reviewed by A. S. Troelstra in JSL 36 (1971), 329–330; by Robert A. Bull in MR 36 (1968), 970; by the author in ZMG 188 (1970), 316.]

    Google Scholar 

  342. Tsutomu Hosoi: ‘On the Axiomatic Method and the Algebraic Method for Dealing with Propositional Logics,’ Journal of the Faculty of Science, University of Tokyo, section I 14 (1967), 131–169. [Reviewed by Arto Salomaa in MR 36 (1968), 505; by Robert A. Bull in ZMG 162 (1969), 311.]

    Google Scholar 

  343. Tsutomu Hosoi: ‘A Criterion for the Separable Axiomatization of Gödel’s Sn,’ Proceedings of the Japan Academy 43 (1967), 365–368. [Reviewed by David Nelson in MR 37 (1969), 7; by Toshio Umezawa in ZMG 168 (1969), 249.]

    Google Scholar 

  344. Chr. Klixbüll Jørgensen: ‘The Extensional Classification of Categorical Propositions and Trivalent Logic,’ Logique et Analyse, n.s. 10 (1967), 141–156. [Reviewed by Alan Rose in ZMG 155 (1968), 338.]

    Google Scholar 

  345. Dieter Klaua: ‘Ein Ansatz zur mehrwertigen Mengenlehre,’ Mathematische Nachrichten 33 (1967), 273–296. [Reviewed by D. Schwartz in ZMG 154 (1968), 259–260.]

    Google Scholar 

  346. Dieter Klaua: ‘Einbettung der klassischen Mengenlehre in die mehrwertige,’ Monatsberichte der Deutschen Akademie der Wissenschaften zu Berlin 9 (1967), 258–272. [Reviewed by D. Schwartz in ZMG 221 (1972), 26.]

    Google Scholar 

  347. Dharmendra Kumar: ‘Logic and Inexact Predicates,’ The British Journal for the Philosophy of Science 18 (1967), 211–222.

    Google Scholar 

  348. See La Macchia and Abian (1967).

    Google Scholar 

  349. See Abian and La Macchia (1967).

    Google Scholar 

  350. Samuel La Macchia and Alexander Abian: ‘Some Generalized Sheffer Functions,’ Archiv fur mathematische Logik und Grundlagenforschung 10 (1967), 6–7. [Reviewed by Arto Salomaa in MR 35 (1968), 979; by Tadeusz Traczyk in ZMG 162(1969), 311.]

    Google Scholar 

  351. Czesław Lejewski: ‘Łukasiewicz, Jan,’ The Encyclopedia of Philosophy, edited by Paul Edwards, New York (Macmillan Publishing Co., Inc.) 1967, volume 5, pp.104–107.

    Google Scholar 

  352. A. I. Malcev: ‘Ob odnom usilenii teorem Słupeckogo i Jablonskogo’ (On a sharpening of theorems of Słupecki and Jablonskii), Algébra i Logika, Séminar 6 (1967), 61–75. [Reviewed by Tadeusz Traczyk in ZMG 166 (1969), 256.]

    Google Scholar 

  353. Storrs McCall (editor): Polish Logic: 1920–1939. Oxford (Clarendon Press) 1967. [Reviewed by Witold A. Pogorzelski in JSL 35 (1970), 442–446; by H. J. Pohl in ZMG 168 (1969), 248; by John Woods in Dialogue 6 (1967), 408–410; by William Kneale in Inquiry 11 (1968), 346–348; by Ivo Thomas in The Philosophical Review 78 (1969), 539–543.]

    Google Scholar 

  354. Storrs McCall: ‘MacColl,’ The Encyclopedia of Philosophy, edited by Paul Edwards, New York (Macmillan Publishing Co., Inc,) 1967, volume 4, pp. 545–546. McCall (1967b). Storrs McCall: ‘Connexive Implication and the Syllogism,’ Mind, n.s. 76 (1967), 346–356.

    Google Scholar 

  355. Storrs McCall: ‘Connexive Class Logic,’ The Journal of Symbolic Logic 32 (1967), 83–90.

    Google Scholar 

  356. C. G. McKay: ‘On Finite Logics,’ Indagationes Mathematicae 70 (1967), 363–365. [Reviewed by Toshio Umezawa in JSL 36 (1971), 330; by Robert A. Bull in MR 35 (1968), 1204; by B. van Rootselaar in ZMG 153 (1968), 7.]

    Google Scholar 

  357. C. G. McKay: ‘A Note on the Jaskowski Sequence,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1967), 95–96. [Reviewed by D. Nelson in MR 37(1969), 7; by Tsutomu Hosoi in ZMG 147 (1968), 7.] Moisil (1967). Grigor Constantin Moisil: Zastosowanie Algebr Lukasiewicza do Teorii Ukladoxv Przekaznikowo-Stykowych (Application of Łukasiewiczian algebra to the study of relay-contact networks), volume 2. Warsaw (Wydawnictwo Polskiej Akademii Nauk) 1967. [Reviewed by Corneliu O. Sicoe in JSL 37 (1972), 187–188.]

    Google Scholar 

  358. Grigor Constantin Moisil: ‘Sur le calcul des propositions de type superieur dans la logique de Lukasiewicz à plusieurs,’ Analele Universitati Bucuresti, Seria Acta Logica 10 (1967), 93–104. Reprinted in Moisil (1972), pp. 596–608. [Reviewed by Arto Salomaa in MR 38 (1969), 998.]

    Google Scholar 

  359. Antonio Monteiro: ‘Construction des algebres de Lukasiewicz trivalentes dans les algebres de Boole monadiques. I,’ Mathematica Japonicae 12 (1967), 1–23. [Reviewed by David Nelson in MR 37 (1969), 7; by D. Ponasse in ZMG 165 (1969), 309.]

    Google Scholar 

  360. Gh. S. Nadiu: ‘On a method of construction of trivalent Lukasiewicz algebras’ (Roumanian), Studii Üşi Cercetări Matematice 19 (1967), 1063–1070. [Reviewed by the author in MR 40 (1970), 753.]

    Google Scholar 

  361. M. J. O’Carroll: ‘A Three-valued Non-levelled Logic Consistent for All Self-reference,’ Logique et Analyse, n.s. 10 (1967), 173–178. [Reviewed by James Cargile in JSL 37 (1972), 422–423; by Newton C. A. da Costa in ZMG 174 (1969), 8.]

    Google Scholar 

  362. E. Orłowska: ‘Mechanical Proof Procedure for the n-valued Propositional Calculus,’ Bulletin de I’Academie Polonaise des Sciences, Serie des Sciences Mathematiques, Astronomiques et Physiques 15 (1967), 537–541. [Reviewed by G. Veenker in ZMG 162 (1969), 320.]

    Google Scholar 

  363. Arthur Norman Prior: ‘Logic, Many-valued,’ The Encyclopedia of Philosophy, edited by Paul Edwards, New York (Macmillan Publishing Co., Inc.) 1967, volume 5, pp. 1–5.

    Google Scholar 

  364. See Słupecki and Bryll and Prucnal (1967).

    Google Scholar 

  365. Tadeusz Prucnal: ‘A Proof of the Axiomatizability of Łukasiewicz’s Three-valued Implicational Propositional Calculus’ (Polish), Studia Logica 20 (1967), 133–144. [Reviewed by the author in MR 35 (1968), 6.]

    Google Scholar 

  366. Juliusz Reichbach: Boolean Many Valued Calculi with Quantifiers and a Homogeny Proof of Gödel-Skolem-Löwenheim-Herbrand’s Theorem. Tel-Aviv, 1967 23 pp. [Registered in ZMG 189 (1970), 7.]

    Google Scholar 

  367. Alan Rose: ‘A Formalisation of the N0-valued Łukasiewicz Propositional Calculus with Variable Functors,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1967), 289–292. [Reviewed by Bruno Scarpellini in JSL 35 (1970), 142; by Lawrence P. Belluce in MR 36 (1968), 505.]

    Google Scholar 

  368. Alan Rose: ‘A Formalisation of the N0-valued Łukasiewicz Implicational Propositional Calculus with Variable Functors,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1967), 293–294. [Reviewed by Bruno Scarpellini in JSL 35 (1970), 143; by Lawrence P. Belluce in MR 36 (1968), 505; by Akira Nakamura in ZMG 161 (1969), 4.]

    Google Scholar 

  369. Alan Rose: ‘A Formalisation of the m-valued Lukasiewicz’s Propositional Calculus with Super-designated Truth-values,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 13 (1967), 295–298. [Reviewed by Eugen Mihăilescu in JSL 36 (1971), 546; by Lawrence P. Belluce in MR 36 (1968), 505; by Akira Nakamura in ZMG 161 (1969), 4.]

    Google Scholar 

  370. Alan Rose: ‘Nouveau calcul de non-contradiction,’ Comptes Rendus Hebdomadaires des Seances de I’Academie des Sciences, série A 265 (1967), 125–128. [Reviewed by M. R. Kron in MR 36 (1968), 10; by Tsutomu Hosoi in ZMG 166 (1969), 251.]

    Google Scholar 

  371. Alan Rose: ‘Nouveau calcul de non-contradiction (methode alternative),’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 265 (1967), 157–159. [Reviewed by M. R. Kron in MR 37 (1969), 722; by Tsutomu Hosoi ZMG 203 (1971), 7.]

    Google Scholar 

  372. GH. Rousseau: Sequents in Many-valued Logic I, FundamentaMathematicae 61 (1967), 22–33.

    Google Scholar 

  373. George H. Rousseau. Rousseau: ‘Correction to ‘Sequents in Many-valued Logic I’,’Fundamenta Mathematicae 61 (1967), 313. [Registered in MR 36 (1968), 735.] Rvacov (1967).

    Google Scholar 

  374. See Rvačov and Škljarov (1967).

    Google Scholar 

  375. V. L. Rvačov and L. I. Škljarov: ‘Some functionally closed classes of functions in k-valued logic’ (Russian), Kibérnétika (1967), no. 3, pp. 42–44. [English translation in Cybernetics 3 (1967), 32–34.] [Reviewed by Alan Rose in MR 43 (1972), 340.]

    Google Scholar 

  376. Krister Segerberg: ‘Some Modal Logics Based on a Three-valued Logic,’ Theoria 33 (1967), 53–71. [Reviewed by Robert A. Bull in JSL 33 (1968), 309–310; by John Corcoran and J. Herringin MR44 (1972), 1178.]

    Google Scholar 

  377. Škljarov (1967). See Rvačov and Škljarov (1967).

    Google Scholar 

  378. Corneliu O. Sicoe: ‘Sur les idéaux des algébres lukasiewicziennes poly-valentes,’ Revue Roumaine de Mathématiques Pures et Appliquées, Académie de la République Roumaine 12 (1967), 391–401. [Reviewed by Alan Rose in MR 35 (1968), 1206; by H. E. Pickett in ZMG 166 (1969), 256.]

    Google Scholar 

  379. Corneliu O. Sicoe: ‘On Many-valued Lukasiewicz Algebras,’ Proceedings of the Japan Academy 43 (1967), 725–728. [Reviewed by the author in MR 36 (1967), 725–728; by L. Bukovsky in ZMG 165 (1969), 309.]

    Google Scholar 

  380. Corneliu O. Sicoe: ‘A Characterization of Lukasiewiczian Algebra. I,’ Proceedings of the Japan Academy 43 (1967), 729–732. [Reviewed by L. Bukovsky in ZMG 165(1969), 309.]

    Google Scholar 

  381. Corneliu O. Sicoe: ‘A Characterization of Lukasiewiczian Algebra. II,’ Proceedings of the Japan Academy 43 (1967), 733–736. [Reviewed by L. Bukovský in ZMG 165 (1969), 309.]

    Google Scholar 

  382. Corneliu O. Sicoe: ‘Note asupra algebrelor lukasiewicziene polivalente’ (Note on polyvalent Łukasiewicz algebras), Studii Cercetari Matematice 19 (1967), 1023–1027. [Reviewed by the author in MR 41 (1967), 954.]

    Google Scholar 

  383. F. Richard Singer: ‘Some Sheffer Functions for m-valued Logics,’ Scripta Mathematica 28 (1967), 21–27. [Reviewed by R. L. Graham in JSL 34 (1969), 520; by Alan Rose in MR 35 (1968), 1204; by Alan Rose in ZMG 154 (1968), 256.]

    Google Scholar 

  384. See Słupecki and Bryll and Prucnal (1967).

    Google Scholar 

  385. Jerzy Słupecki, Grezgorz Bryll and Tadeusz Prucnal: ‘Some Remarks on Three-valued of J. Łukasiewicz,’ Studia Logica 21 (1967), 45–66. [Reviewed by D. H. Potts in MR 38 (1969), 377–378.]

    Google Scholar 

  386. A. Tauts: ‘The definition of truth values as formulae’ (Russian), Tartu Riikliku Ülikooli Toimetised 206 (1967), 3–9. [Reviewed by M. S. Popadic in MR 41 (1967), 597.]

    Google Scholar 

  387. Ivo Thomas: ‘Three-valued Propositional Fragments with Classical Implication,’ Notre Dame Journal of Formal Logic 8 (1967), 145–147. [Reviewed by Alan Rose in ZMG 189 (1970), 281.]

    Google Scholar 

  388. Yu. M. Tolstova: Modelling l-valued Logic in k-valued logic (k ≥ 1)’ (Russian), Problémy Kibérnétiki 18 (1967), 67–82. [English translation in Systems Theory Research 18 (1968), 62–76.] [Reviewed by J. D. Rutledge in MR 41 (1971), 7–8.]

    Google Scholar 

  389. Tadeusz Traczyk: ‘On Post Algebras with Uncountable Chain of Constants. Algebras of Homomorphisms,’ Bulletin de I’Académie Polonaise des Sciences, Classe III 15 (1967), 673–680. [Reviewed by Don Pigozzi in JSL 37 (1972), 188–189; by A. F. Pixley in ZMG 172 (1969), 11.]

    Google Scholar 

  390. Atwell R. Turquette: ‘Peirce’s Phi and Psi Operators for Triadic Logic,’ The Transactions of the Charles S. Peirce Society 3 (1967), 66–73. [Reviewed by the author in MR 39 (1970), 473.]

    Google Scholar 

  391. Dolph Edward Ulrich: Matrices for Sentential Calculi. Ph.D dissertation: Wayne State University, 1967. Ann Arbor (University Microfilms) 1971.

    Google Scholar 

  392. Vladeta Vučković: ‘Recursive Models for Three-valued Propositional Calculi with Classical Implication,’ Notre Dame Journal of Formal Logic 8 (1967), 148–158. [Reviewed by H. E. Rose in ZMG 262 (1974), 12.]

    Google Scholar 

  393. Vladeta Vučković: ‘A Recursive Model of the Extended System A of B. Sobocinski,’ Notre Dame Journal of Formal Logic 8 (1967), 154–158. [Reviewed by H. E. Rose in ZMG 262 (1974), 12.]

    Google Scholar 

  394. Michael Yoeli: ‘The Synthesis of Multi-valued Cellular Cascades,’ Technion-Israel Institute of Technology, Electrical Engineering Publications 87 (1967).

    Google Scholar 

  395. É. Ú. Zaharova: ‘Kriterij sistem funkcij iz Pk’ (Criteria of completeness of functions from Pk), Problémy Kibérnétiki 18 (1967), 5–10. [Reviewed by Ivo G. Rosenberg in JSL 33 (1967), 606–607; by VI. Sotirov in ZMG 268 (1974), 13.]

    Google Scholar 

  396. N. N. Aĭzenberg: ‘Polinomialnye predstavlenià funktsii k-značnoi logiki polinomam nad koltsam klassov vyčetov po mod k,’ Kibérnétika (1968), no. 2, p. 102. [English translation (‘The Representation of Functions of k-valued Logic by Polynomials mod k’) in Cybernetics 4 (1968), 83.] [Registered in MR 45 (1973), 1216.]

    Google Scholar 

  397. See Allen and Givone (1968).

    Google Scholar 

  398. Charles M. Allen and Donald D. Givone: ‘A Minimization Technique for Multiple-valued Logic Systems,’ IEEE Transactions on Computers C-17 (1968), 182–184. [Reviewed by H. Rohleder in ZMG 157 (1969), 338.]

    Google Scholar 

  399. R. A. Baĭramov: ‘Stabilizatory predikatovi funktsii Sheffera u konecinoz-nacinoi logike’ (Predicate stabilizers and Sheffer-functions in a finite-valued logic), Doklady Akadémii Nauk Azerbaĭdžan SSR 24 (1968), 3–6. [Reviewed by Arto Salomaa in MR 42 (1971), 10.]

    Google Scholar 

  400. R. A. Bairamov: Stabilizatory predikatovi funktsii Shefferau konecinoz 12 (1968), 115–116. [Reviewed by Arto Salomaa in MR 46 (1973), 4; by Ivo G. Rosenberg in ZMG 182(1970), 317.]

    Google Scholar 

  401. Richard L. Call: ‘A Minimal Canonically Complete m-valued Proper Logic for each m,’ The Journal of Symbolic Logic 33 (1968), 108–110. [Reviewed by R. L. Graham in JSL 35 (1970), 326; by J. D. Rutledge in MR 41 (1971), 7; by George H. Rousseau in ZMG 191 (1970), 287.]

    Google Scholar 

  402. Michel Carvallo: Logique à trois valeurs. Logique à seuil. Paris (Gauthier-Villars Éditeur) 1968. [Reviewed by Albert A. Mullin in MR 39 (1970), 8; by Tsutomu Hosoi in ZMG 175 (1969), 263–264.]

    Google Scholar 

  403. Michel Carvallo: ‘Sur la resolution des équations de Post à v valeurs,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 267 (1968), 628–630. [Reviewed by Jens Erik Fenstad in MR 38 (1969), 763; by A. F. Pixley in ZMG 169 (1969), 304.]

    Google Scholar 

  404. C. Cazacu: ‘Sur les logiques m-valentes,’ Analele Universitati Bucuresti, w Seria Acta Logica 11 (1968), 154–155. [Reviewed by Alan Rose in ZMG 229 (1972), 19.]

    Google Scholar 

  405. Kiril N. Čimev: ‘The various kinds of dependence of the functions of many-valued logic on their arguments’ (Bulgarian), Godisnik na Vissite tehniceski Ucebni Zavedeniaa, Matematika 5 (1968–69), 101–109. [Reviewed by G. E. Mine in MR 45 (1973), 583.]

    Google Scholar 

  406. See Čimev and Kutirkov (1968–69).

    Google Scholar 

  407. Kiril N. Čimev and Georgi A. Kutirkov: ‘The first order variables of the functions of many-valued logic’ (Bulgarian), Godišnik na Visšite tehničeski Ucebni Zavedeni, Matematika 5 (1968–69), 111–118. [Reviewed by G. E. Mine in MR 45 (1973), 583.]

    Google Scholar 

  408. J. W. Dijkstra: ‘GO TO Statement Considered Harmful,’ Communications of the Association for Computing Machines 11 (1968), 147–148.

    Google Scholar 

  409. J. Michael Dunn: ‘Representation Theory of Normal R-Mingle Matrices,’ The Journal of Symbolic Logic 33 (1968), 637.

    Google Scholar 

  410. Philip Dwinger: ‘Generalized Post Algebras,’ Bulletin de I’Academie Polonaise des Sciences, Serie des Sciences Mathematiques, Astronomiques et Physiques 16 (1968), 559–563. [Reviewed by Don Pigozzi in JSL 32 (1972), 188–189.]

    Google Scholar 

  411. R. V. Freĭvald: ‘The completeness to within coding of systems of functions of a k-valued logic and the complexity of its recognition’ (Russian), Doklady Akademii Nauk SSSR 180 (1968), 803–805. [English translation in Soviet Mathematics 9 (1968), 699–702.] [Reviewed by R. M. Baer in MR 38 (1969), 190.]

    Google Scholar 

  412. See Allen and Givone (1968).

    Google Scholar 

  413. See Givone and Snelsire (1968).

    Google Scholar 

  414. Donald D. Givone and R. W. Snelsire: Final Report on the Design of Multiple-valued Logic Systems. Digital Systems Laboratory of the Department of Electrical Engineering, State University of New York, Buffalo (1968). Goddard (1968).

    Google Scholar 

  415. Leonard Goddard: ‘Towards a Logic of Significance,’ Notre Dame Journal of Formal Logic 9 (1968), 233–264. Halperu (1968). See Yoeli and Halperu (1968).

    Google Scholar 

  416. See Yoeli and Halperu (1968).

    Google Scholar 

  417. S. L. Hurst: ‘An Extension of Binary Minimisation Techniques to Ternary Equations,’ Computer Journal 11 (1968), 277–286. [Reviewed by H. Rohleder in ZMG 169 (1969), 17.]

    Google Scholar 

  418. S. L. Hurst: ‘Semiconductor Circuits for 3-state Logic Applications,’ Electronic Engineering May 1968, pp. 256–259.

    Google Scholar 

  419. Kiyoshi Iséki: Kigô ronrigaku (meidai ronri). (Symbolic logic (propositional logic).) Tokyo (Maki Shoten) 1968. [Reviewed by Akira Nakamura in JSL 35 (1970), 580–581; by S. Kasahara in ZMG 194 (1970), 306.]

    Google Scholar 

  420. Luisa Iturrioz: ‘Sur une classe particuliere d’algebres de Moisil,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 267 (1968), 585–588. [Reviewed by Andrzej Biafynicki-Birula in MR 38 (1969), 570; by David C. Makinson in ZMG 183(1970), 8.]

    Google Scholar 

  421. V. A. Ánkov: ‘Postroénié poslédovatél’nosti sil’no nézavisimyh supér-intuicionistskih propozicional’nyh isčislénij,’ Doklady Akademii Nauk SSSR 181 (1968), 33–34. [English translation (‘Constructing a Sequence of Strongly Independent Super-intuitionistic Propositional Calculi’) by A. Yablonsky in Soviet Mathematics 9 (1968), 806–807.] [Reviewed by Alfred Horn in JSL 37 (1972), 186; by Arend Heyting in MR 38 (1969), 190; by H. Luckhardt in ZMG 198 (1971), 318.]

    Google Scholar 

  422. V. A. Ánkov: ‘Ob isčislénii slabogo zakona isklúčennogo trét’égo,’ Izvéstiá Akadémii Nauk SSSR, Seriá Matématičéskadá 32 (1968), 1044–1051. [English translation (‘The Calculus of the Weak “Law of Excluded Middle”’) in Mathematics of the USSR-Izvestija 2 (1968), 997–1004. [Reviewed by Alfred Horn in JSL 37 (1972), 186; by G. Asser in MR 38 (1969), 998.]

    Google Scholar 

  423. V. A. Ánkov: ‘O rasširénii intuicionistskogo propozicional’nogo isčisleniá do klassičeskogo i minimal’nogo-do intuicionistskogo,’ Izvéstiá Akadémii Nauk SSSR, Seriá Matematičéskaá 32 (1968), 208–211. [English translation (‘On the Extension of the Intuitionist Propositional Calculus to the Classical Calculus, and the Minimal Calculus to the Intuitionist Calculus’) in Mathematics of the USSR-Izvestija 2 (1968), 205–208.] [Reviewed by John G. Anderson in JSL 38 (1973), 331–332; by Toshio Umezawa in ZMG 191 (1970), 286.]

    Google Scholar 

  424. Vladimir G. Kirin: ‘Post Algebras as Semantic Bases of Some Many-valued Logics,’ Fundamenta Mathematicae 63 (1968), 279–294. [Reviewed by Alan Rose in MR 39 (1970), 248; by F. Lapscher in ZMG 175 (1969), 266.] Korner (1968). Stephan Körner: ‘Reply to Mr. Kumar,’ The British Journal for the Philosophy of Science 18 (1968), 323–324.

    Google Scholar 

  425. See Čimev and Kutirkov (1968–69).

    Google Scholar 

  426. Karel Lambert: ‘On the No Type Theory of Significance,’ Australasian Journal of Philosophy 46 (1968), 79–86.

    Google Scholar 

  427. C. G. McKay: ‘The Decidability of Certain Intermediate Propositional Logics,’ The Journal of Symbolic Logic 33 (1968), 258–264. [Reviewed by Toshio Umezawa in JSL 36 (1971), 330–331; by A. S. Troelstra in MR 39 (1970), 248; by Tsutomu Hosoi in ZMG 175 (1969), 271.] McKay (1968a). C. G. McKay: ‘The Non-separability of a Certain Finite Extension of Heyting’s Propositional Logic,’ Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, Series A, Mathematical Sciences 71 (1968), 312–315; also printed in Indagationes Mathematicae 30 (1968), 312–315. [Reviewed by A. S. Troelstra in MR 37 (1969), 482–483; by Tsutomu Hosoi in ZMG 175 (1969), 262–263.]

    Google Scholar 

  428. See Miura and Nagata (1968).

    Google Scholar 

  429. Satoshi Miura and Shûrô Nagata: ‘Certain Method for Generating a Series of Logics,’ Nagoya Mathematical Journal 31 (1968), 125–129. [Reviewed by Alan Rose in MR 37 (1969), 483–484; by Tsutomu Hosoi in ZMG, vol. 165 (1969), p. 304.]

    Google Scholar 

  430. Grigor Constantin Moisil: ‘Lukasiewiczian Algebras.’ Preprints of the Institute for Mathematics of the Academy of Romanian Socialist Republic and of the Computing Center of the University of Bucharest, October, 1968. Montgomery (1968). See Routley and Montgomery (1968).

    Google Scholar 

  431. See Miura and Nagata (1968).

    Google Scholar 

  432. R. Ohba: ‘Some Properties of Mutually Connected Threshold Elements,’ Electronics and Communications in Japan, Institute of Electrical and Electronics Engineers, 51-C (1968), 172–178.

    Google Scholar 

  433. Takemasa Ohya: ‘Many-valued Logic Extended to Simple Type Theory,’ Science Reports of the Tokyo Kyoiku Daigaku, Section A 9 (1968), 260–270. [Reviewed by Alan Rose in ZMG 172 (1969), 8.]

    Google Scholar 

  434. Katuzi Ono: ‘A Remark on Peirce’s Rule in Many-valued Logics,’ Nagoya Mathematical Journal 31 (1968), 69–70. [Reviewed by J. E. Rubin in MR 36 (1968), 1207; by Newton C. A. da Costa in ZMG 162 (1969), 12.]

    Google Scholar 

  435. Alexandru Petcu: ‘The Definition of the Trivalent Lukasiewicz Algebras by Three Equations,’ Revue Roumaine de Mathematiques Pures et Appliquees 13 (1968), 247–250. [Reviewed by the author in MR 38 (1969), 998; by the author in ZMG 155 (1968), 15.]

    Google Scholar 

  436. Nicolae Popovici: ‘On the Consensus Theory for the Trivalent Argument Functions,’ Bulletin Mathématique de la Société des Sciences Mathématiques de la Republique Socialiste de Roumanie, n.s. 12 (1968), 103–109. [Reviewed by M. A. Harrison in MR 40 (1970), 235; by H. Rohleder in ZMG 176 (1969), 282.]

    Google Scholar 

  437. Nicholas Rescher: Topics in Philosophical Logic. Dordrecht (D. Reidel Publishing Company) 1968. [Reviewed by Ivo Thomas in ZMG 175 (1969), 264; by Malcolm K. Rennie in Australasian Journal of Philosophy 48 (1970), 153–164.]

    Google Scholar 

  438. Alan Rose: ‘Formalisations of Some N0-valued Lukasiewicz Propositional Calculi,’ The Journal of Symbolic Logic 33 (1968), 493–494.

    Google Scholar 

  439. Alan Rose: ‘Binary Generators for the m-valued and N0-valued Łukasiewicz Propositional Calculi,’ Compositio Mathematica 20 (1968), 153–169. [Reviewed by D. H. Potts in MR 38 (1969), 5; by the author in ZMG 157 (1969), 15–16.]

    Google Scholar 

  440. Alan Rose: ‘Formalisations of Some N0-valued Łukasiewicz Propositional Calculi,’ Proceedings of the Summer School in Logic (Leeds 1967), Berlin (Springer Verlag) 1968, pp. 269–271. [Reviewed by Louise Hay in MR 39 (1970), 249; by the author in ZMG 182 (1970), 316.]

    Google Scholar 

  441. George H. Rousseau: ‘Note on a Problem of Porte,’ Proceedings of the Cambridge Philosophical Association 64 (1968), 1. [Reviewed by G. E. Mine in ZMG 165 (1969), 12.]

    Google Scholar 

  442. See Routley and Montgomery (1968).

    Google Scholar 

  443. Richard Routley and Hugh Montgomery: ‘On Systems Containing Aristotle’s Thesis,’ The Journal of Symbolic Logic 33 (1968), 82–96.

    Google Scholar 

  444. See Rvačov and Škljarov (1968).

    Google Scholar 

  445. V. L. Rvačov and L. I. Škljarov: ‘Rk-functions’ (Ukrainian), Dopovidi Akadémii Nauk Ukrains’koi RSR, Serià A 1968, pp. 415–417. [Reviewed by Haskell B. Curry in MR 39 (1970), 249; by the authors in ZMG 159 (1969), 9.]

    Google Scholar 

  446. See Rvačov and Škljarov (1968).

    Google Scholar 

  447. CO. Sicoe: Sur la définition des algèbres lukasiewicziennes poly-valentes, Revue Roumanienne de Mathématique Pures et Appliquees 13 (1968), 1027. [Reviewed by the author in ZMG 184 (1970), 11.]

    Google Scholar 

  448. See Givone and Snelsire (1968).

    Google Scholar 

  449. Moto-o Takahashi: ‘Many-valued Logics of Extended Gentzen Style I,’ Science Reports of the Tokyo Kyoiku Daigaku, Section A 9 (1968), 95–116. [Reviewed by the author in MR 37 (1969), 8; by Alan Rose in ZMG 172 (1969), 8.]

    Google Scholar 

  450. Tadeusz Traczyk: ‘Prime Ideals in Generalized Post Algebras,’ Bulletin de I’Académie Polonaise des Sciences, Classe III 16 (1968), 369–373. [Reviewed by Ph. Dwinger in JSL 37 (1972), 189.]

    Google Scholar 

  451. Atwell R. Turquette: ‘Dualizable Quasi-strokes for m-state Automata,’ Information Sciences 1 (1968), 131–142. [Reviewed by the author in MR 42 (1971), 10.]

    Google Scholar 

  452. Bas C. van Fraassen: ‘Presupposition, Implication, and Self-reference,’ The Journal of Philosophy 65 (1968), 136–152.

    Google Scholar 

  453. J. C. Varlet: Algebres de Lukasiewicz trivalentes, Bulletin de la Societe Royale des Sciences de Liege 37 (1968), 399–408. [Reviewed by F. Lapscher in ZMG 175(1969), 266.]

    Google Scholar 

  454. Peter W. Woodruff: ‘Arguments in 3-valued Logic,’ The Journal of Symbolic Logic 33 (1968), 637.

    Google Scholar 

  455. Michael Yoeli: ‘Ternary Cellular Cascades,’ IEEE Transactions on Computers C-17 (1968), 66.

    Google Scholar 

  456. See Yoeli and Halperu (1968).

    Google Scholar 

  457. M Yoeli and I Halperu: Ternary Arithmetic Unit, Proceedings of the IEE 115 (1968), 1385.

    Google Scholar 

  458. V. A. Abdugaliev: ‘On the Question of the Representation of Functions of a A:-valued Logic by a Normal Form. I’ (Russian), Diskretnyĭ Analiz 15 (1969), 3–24. [Reviewed by G. E. Mine in MR 44 (1972), 488.]

    Google Scholar 

  459. V. B. Alekseev: ‘The Simple Bases of a k-valued Logic’ (Russian), Matematičeskie Zametki 5 (1969), 471–482. [English translation in Mathematical Notes 5 (1969), 282–287.] [Reviewed by Elliott Mendelson in MR 40 (1970), 460; by Arto Salomaa in ZMG 183 (1970), 4.]

    Google Scholar 

  460. See Bădele and Boicescu (1969).

    Google Scholar 

  461. I. Bădele and Vlad Boicescu: ‘Sur les extensions de algebres de Lukasiewicz,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 269 (1969), 313–315. [Reviewed by Robert K. Meyer in MR 43 (1972), 1103; by the authors in ZMG 180 (1970), 299.]

    Google Scholar 

  462. R. A. Baĭramov: ‘The Predicative Characterizability of Subalgebras of Many-valued Logic’ (Russian), Izvestià Akadémii Nauk Azerbaĭdžanskoi SSR, Serià Fiziko-Tehničeskih i Matematičeskaà Nauk 1 (1969), 100–104. [Reviewed by Arto Salomaa in MR 41 (1971), 953; by Ivo G. Rosenberg in ZMG 193 (1970), 297.]

    Google Scholar 

  463. R. A. Bairamov: ‘Fundamentality Criteria for Permutation Groups and Transformation Semigroups’ (Russian), Doklady Akademii Nauk SSSR 189 (1969), 455–457. [English translation in Soviet Mathematics 10 (1969), 1414–1416.] [Reviewed by Arto Salomaa in MR 41 (1971), 953.]

    Google Scholar 

  464. See Bodnarčuk and Kalužnin and Kotov and Romov (1969).

    Google Scholar 

  465. V. G. Bodnarčuk, L. A. Kalužnin, V. N. Kotov and B. A. Romov: ‘Galois Theory for Post Algebras. I, II’ (Russian), Kibernetika (1969), no. 3, pp. 1–10; 1969, no. 5, pp. 1–9. [Reviewed by the authors in MR 46 (1973), p. 9; by H.-J. Hoehnke in ZMG 212 (1971), 318–319.]

    Google Scholar 

  466. See Badele and Boicescu (1969).

    Google Scholar 

  467. Walter Börner: ‘Eine Klasse vonDarstellungen der Funktionen der k-wertigen Logik,’ Wissenschaftliche Zeitschrift der Friedrich-Schiller-Universität, Jena/ Thuringen, 18 (1969), 313–316. [Reviewed by Alan Rose in MR 43 (1972), 7; by Tsutomu Hosoi in ZMG 222 (1971), 14.]

    Google Scholar 

  468. Eramis Bueno: ‘Polyvalent Modal Logics’ (Spanish), Universidad de la Habana 33 (1969), 123–133. [Reviewed by the author in MR 41 (1971), 954.]

    Google Scholar 

  469. Roberto Cignoli: Estudio algebraico de logicas polivalentes algebras de Moisil de orden N. Ph.D dissertation: Universidad Nacional de Sur, Bahia Blanca, 1969.

    Google Scholar 

  470. H. Dunderdale: ‘Current-mode Circuits for Ternary-logic Realisation,’ Electronic Letters 5 (1969), 575–577.

    Google Scholar 

  471. See Meyer and Dunn (1969).

    Google Scholar 

  472. Philip Dwinger: ‘Ideals in Generalized Post Algebras,’ Bulletin de I’Académie Polonaise des Sciences, Série des Sciences Mathématiques; Astronomiques et Physiques 17 (1969), 483–486. [Reviewed by the author in ZMG 183 (1970), 8.]

    Google Scholar 

  473. Ernest Edmonds: ‘Independence of Rose’s Axioms for m-valued Implication,’ The Journal of Symbolic Logic 34 (1969), 283–284. [Reviewed by Alan Rose in ZMG 182 (1970), 315.]

    Google Scholar 

  474. V. K. Finn: ‘The Precompleteness of a Class of Functions That Corresponds to the Three-valued Logic of J. Łukasiewicz’ (Russian), Naučno-Tehničeskaá Informaciá, serià 2 (1969), no. 10, pp. 35–38. [Reviewed by A. Tauts in MR 44 (1972), 714.] Fu (1969). See Wee and Fu (1969).

    Google Scholar 

  475. George Georgescu: ‘Algèbres de Lukasiewicz complètes,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 269 (1969), 1181–1184. [Reviewed by H. Gonshor in MR 40 (1970), 1286.]

    Google Scholar 

  476. See Georgescu and Vraciu (1969).

    Google Scholar 

  477. See Georgescu and Vraciu (1969a).

    Google Scholar 

  478. See Georgescu and Vraciu (1969b).

    Google Scholar 

  479. See Georgescu and Vraciu (1969c).

    Google Scholar 

  480. See Georgescu and Vraciu (1969d).

    Google Scholar 

  481. George Georgescu and Constantin Vraciu: ‘n-valent Centered Lukasiewicz Algebras,’ Revue Roumanie de Mathematiques Pures et Appliquées 14 (1969), 793–802. [Reviewed by the authors in ZMG 182 (1970), 8.]

    Google Scholar 

  482. George Georgescu and Constantin Vraciu: ‘Le spectre maximal d’une algebre de Lukasiewicz,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 268 (1969), 928–929. [Reviewed by Robert K. Meyer in MR 42(1971), 10.]

    Google Scholar 

  483. George Georgescu and Constantin Vraciu: ‘Sur les algebres de Lukasiewicz centrees,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 268 (1969), 998–1000.

    Google Scholar 

  484. George Georgescu and Constantin Vraciu: ‘Sur le spectre maximal d’une algèbre de Lukasiewicz,’ Publications du Department de Mathématiques, Faculté des Sciences de Lyon 1 (1969), 42–54.

    Google Scholar 

  485. George Georgescu and Constantin Vraciu: ‘Sur les épimorphismes centrées des algèbres de Lukasiewicz,’ Comptes Rendus Hebdomadaires des Seances de I’Académie des Sciences, série A 4–6. [Reviewed by Robert K. Meyer in MR 42 (1971), 1359; by the authors in ZMG 174 (1969), 12.]

    Google Scholar 

  486. Leonard Goddard: ‘The Existence of Universals,’ Contemporary Philosophy in Australia, edited by Robert Brown and C. D. Rollins, London (Allen and Unwin) 1969, pp. 31–51.

    Google Scholar 

  487. J. A. Goguen: ‘The Logic of Inexact Concepts,’ Synthese 19 (1969), 325–373. [Reviewed by Newton C. A. da Costa in ZMG 184 (1970), 9–10.]

    Google Scholar 

  488. See Lévy and Hansel (1969).

    Google Scholar 

  489. See Mine and Hasegawa and Koga and Ideda and Shintani (1969).

    Google Scholar 

  490. See Hendry and Massey (1969).

    Google Scholar 

  491. Herbert E. Hendry and Gerald J. Massey: ‘On the Concepts of Sheffer Functions,’ The Logical Way of Doing Things, edited by Karel Lambert, New Haven (Yale University Press) 1969, pp. 279–293. [Reviewed by Robert A. Bull in ZMG 188(1970), 317.]

    Google Scholar 

  492. Alfred Horn: ‘Logic with Truth Values in a Linearly Ordered Heyting Algebra,’ The Journal of Symbolic Logic 34 (1969), 395–408. [Reviewed by George Georgescu in MR 40 (1970), 1285; by the author in ZMG 181 (1970), 299–300.]

    Google Scholar 

  493. Alfred Horn: ‘Free L-algebras,’ The Journal of Symbolic Logic 34 (1969), 475–480. [Reviewed by the author in ZMG 181 (1970), 300.]

    Google Scholar 

  494. Tsutomu Hosoi: ‘On Intermediate Logics. II,’ Journal of the Faculty of Science, University of Tokyo, section I 16 (1969), 1–12. [Reviewed by A. S. Troelstra in JSL 36 (1971), 329–330; by Robert A. Bull in MR 40 (1970), 995; by the author in ZMG 188 (1970), 316.]

    Google Scholar 

  495. See Mine and Hasegawa and Koga and Ideda and Shinatani (1969).

    Google Scholar 

  496. Luisa Iturrioz: ‘Erratum: Sur une classe particulière d’algebres de Moisil,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 268 (1969), 923. [Registered in MR 39 (1970), 473.]

    Google Scholar 

  497. See Ivas’kiv and Pospelov and Tošič (1969).

    Google Scholar 

  498. Ju. L. Ivas’kiv, D. A. Pospelov and Tošič: ‘Description of Many-valued Logics’ (Russian), Kibérnétika (1969), no. 2, pp. 35–47. [Reviewed by Arto Salomaa in ZMG 216 (1971), 4.]

    Google Scholar 

  499. See Zaharova and Kudrjavcev and Jablonskiĭ (1969).

    Google Scholar 

  500. P. Janin: ‘Bases de l’algèbrisation de la logique trivalente,’ Analele Univer sitătii Bucureşti, Matematică-Mecanică 18, no. 2 (1969), pp. 57–88. [Reviewed by D. Ponasse in ZMG 202(1971), 276.]

    Google Scholar 

  501. V. A. Ánkov: ‘Konúnktivno nérazložimyé formuly v propozicional’nyh isčisleniáh,’ Izvestià Akadémii Nauk SSSR, Sérià Matématičéskaà 33 (1969), 18–38. [English translation (‘Conjunctively Indecomposable Formulas in Propositional Calculi’) in Mathematics of the USSR-Izvestija 3 (1969), 17–35.] [Reviewed by C. G. McKay in JSL 37 (1972), 186.]

    Google Scholar 

  502. Milutin M. Jorgovic: ‘A Remark Concerning a Base for Many-valued Propositional Algebra’ (Serbo-Croatian), Društvo Matematičara, Fizičara i Astronoma SRS i Matematiki Institut-Beograd, Matematicki Vesnik, n.s. 6 (1969), 451–452. [Reviewed by M. S. Popadic in MR 41 (1971), 269.]

    Google Scholar 

  503. See Bodnarčuk and Kalužnin and Kotov and Romov (1969).

    Google Scholar 

  504. See Kitahashi and Nomura and Tezuka and Kasahara (1969).

    Google Scholar 

  505. See Kitahashi and Nomura and Tezuka and Kasahara (1969).

    Google Scholar 

  506. Tadahiro Kitahashi, Hirosato Nomura, Yoshikazu Tezuka and Yoshiro Kasahara: ‘The Characterizing Parameters of Ternary Logical Functions and Their Applications to Threshold Logical Functions,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communication Engineers of Japan 52 (1969), 195–201. [Reviewed by M. Stojakovic in MR 42 (1971), 1051.]

    Google Scholar 

  507. See Mine and Hasegawa and Koga and Ideda and Shintani (1969).

    Google Scholar 

  508. See Bodnarčuk and Kalužnin and Kotov and Romov (1969).

    Google Scholar 

  509. D. E. Knuth: The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Reading (Addison-Wesley) 1969.

    Google Scholar 

  510. See Zaharova and Kudrjavcev and Jablonskiĭ (1969).

    Google Scholar 

  511. Dharmendra Kumar: ‘Neutrality, Contingency and Undecidability,’ The British Journal for the Philosophy of Science 19 (1969), 353–356.

    Google Scholar 

  512. Karel Lambert: ‘Logic and Microphysics,’ The Logical Way of Doing Things, edited by Karel Lambert, New Haven (Yale University Press) 1969, pp. 93–117.

    Google Scholar 

  513. Gerard Lévy: ‘Formes disjonctives minimales dans une logique à plusieurs valeurs,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, serie A 269 (1969), 613–615. [Reviewed by M. R. Krom in MR 40 (1970), 753; by the author in ZMG 207 (1971), 5.]

    Google Scholar 

  514. See Lévy and Hansel (1969).

    Google Scholar 

  515. Gerard Lévy and Georges Hansel: ‘Construction d’un schema fonctionnel en logique à plusieurs valeurs,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 268 (1969), 681–684. [Reviewed by F. Vandamme in MR 44 (1972), 291; by Alan Rose in ZMG 193 (1970), 291.]

    Google Scholar 

  516. See Marek and Traczyk (1969).

    Google Scholar 

  517. W. Marek and Tadeusz Traczyk: ‘Generalized Łukasiewicz Algebras,’ Bulletin de I’Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 17 (1969), 789–792. [Reviewed by M. M. Richter in MR 42 (1971), 293; by the authors in ZMG 202 (1971), 7.]

    Google Scholar 

  518. Peter Marinos: ‘Fuzzy Logic and Its Application to Switching Systems,’ IEEE Transactions on Computers C-18 (1969), 343–348. [Reviewed by the author in ZMG 172 (1969), 301–302.]

    Google Scholar 

  519. See Hendry and Massey (1969).

    Google Scholar 

  520. Gerald J. Massey: ‘Sheffer Functions for Many-valued S5 Modal Logics,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 15 (1969), 101–104. [Reviewed by Akira Nakamura in ZMG 193 (1970), 292.]

    Google Scholar 

  521. See McCall and Vander Nat (1969).

    Google Scholar 

  522. Storrs McCall and Arnold Vander Nat: ‘The System S9,’ Philosophical Logic, edited by J. W. Davis, D. J. Hockney and W. K. Wilson, Dordrecht (D. Reidel Publishing Company) 1969, pp. 194–214.

    Google Scholar 

  523. See Meyer and Dunn (1969).

    Google Scholar 

  524. Robert K. Meyer and J. Michael Dunn: ‘E, R and y,’ The Journalof Symbolic Logic 34 (1969), 460–474. [Reviewed by B. Lercher in MR 40 (1970), 996.]

    Google Scholar 

  525. See Mine and Hasegawa and Koga and Ideda and Shintani (1969).

    Google Scholar 

  526. Hisashi Mine, Toshiharu Hasegawa, Yohiahi Koga, M. Ideda and T. Shintani: ‘Construction and Analysis of a Tri-stable Circuit and Its Application to Ternary Feedback Register,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communication Engineers of Japan 52-C (1969), 103–111.

    Google Scholar 

  527. E. I. Nečiporuk: ‘The Topological Principles of Autocorrection’ (Russian), Problémy Kibérnétiki 21 (1969), 5–102. [Reviewed by J. Kuntzmann in MR 45 (1973), 584.]

    Google Scholar 

  528. See Kitahashi and Nomura and Tezuka and Kasahara (1969).

    Google Scholar 

  529. William Ockham: Predestination, God’s Foreknowledge and Future Contingents, edited with an introduction, notes and appendices by Marilyn McCord Adams and Norman Kretzmann. New York (Appleton-Century-Crofts) 1969. Porat (1969). D. I. Porat: ‘Three-valued Digital Systems,’ Proceedings of the IEE 116 (1969), 947–954.

    Google Scholar 

  530. D. I. Porat: ‘Three-valued Digital Systems,’ Proceedings of the IEE 116 (1969), 947–954.

    Google Scholar 

  531. See Ivas’kiv and Pospelov and Tošič (1969).

    Google Scholar 

  532. Hilary Putnam: ‘Is Logic Empirical?,’ Proceedings of the Boston Colloquium for the Philosophy of Science, 1966–1968, edited by Robert S. Cohen and Marx W. Wartofsky, Dordrecht (D. Reidel Publishing Company) 1969, pp. 216–241.

    Google Scholar 

  533. M. F. Raca: ‘The Class of Functions of Three-valued Logic That Corresponds to the First Matrix of Jas’kovski’ (Russian), Problémy Kibernétiki, 21 (1969), 185–214. [Reviewed by F. Vandamme in MR 46 (1973), 1207–1208.]

    Google Scholar 

  534. Helena Rasiowa: ‘A Theorem on the Existence of Prime Filters in Post Algebras and the Completeness Theorem for Some Many-valued Predicate Calculi,’ Bulletin de I’Académie Polonaise des Sciences, Serie des Sciences Mathématiques, Astronomiques et Physiques 17 (1969), 347–354. [Reviewed by Arto Salomaa in MR 41 (1971), 595; by the author in ZMG 184 (1970), 11–12.]

    Google Scholar 

  535. Nicholas Rescher: Many-valued Logic. New York (McGraw-Hill BookCompany, Inc.) 1969. [Reviewed by G. E. Mine in ZMG 248 (1973), 7.]

    Google Scholar 

  536. Nicholas Rescher: ‘Autodescriptive Systems of Many-valued Logic,’ The Journal of Symbolic Logic 34 (1969), 158.

    Google Scholar 

  537. See Bodnarčuk and Kalužnin and Kotov and Romov (1969).

    Google Scholar 

  538. Alan Rose: ‘Single Generators for Henkinian Fragments of the 2-valued Propositional Calculus,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 15 (1969), 85–92. [Reviewed by D. H. Potts in MR 40 (1970), 3; by the author in ZMG 182 (1970), 314.]

    Google Scholar 

  539. Alan Rose: ‘Nouvelle formalisation du calcul propositionnel à N0-valeurs de ukasiewicz dans le cas ou il y a des foncteurs variables,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 269 (1969), 265–266. [Reviewed by the author in ZMG 184 (1969), 8.]

    Google Scholar 

  540. Alan Rose: ‘Some Many-valued Propositional Calculi without Single Generators,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 15 (1969), 105–106. [Reviewed by D. H. Potts in MR 41 (1971), 7; by the author in ZMG 184 (1970), 280.]

    Google Scholar 

  541. Alan Rose: ‘Sur les éléments universels trivalents de dé cision,’ ComptesRendus Hebdomadaires des Séances de I’Académie des Sciences, série A 269 (1969), 1–3.

    Google Scholar 

  542. Alan Rose: ‘The Degree of Completeness of the m-valued Łukasiewicz Propositional Calculus, Correction and Addendum,’ Journal of the London Mathematical Society 44 (1969), 587–591. [Reviewed by Gene F. Rose in JSL 39 (1974), 350; by Jens Erik Fenstad in MR 39 (1970), 962; by the author in ZMG 182 (1970), 316.]

    Google Scholar 

  543. Ivo G. Rosenberg: ‘Über die Verschiedenheit maximaler Klassen in Pk,’ Revue Romaine Mathématique Pures et Appliqueés 14 (1960), 431–438. [Reviewed by the author in ZMG 193 (1970), 291.]

    Google Scholar 

  544. James Rosenberg: ‘The Application of Ternary Semigroups to the Study of n- valued Sheffer Functions,’ Notre Dame Journal of Formal Logic 10 (1969), 90–94. [Reviewed by R. L. Graham in JSL 38 (1973), 520; by D. H. Potts in MR 41 (1971), 269; by F. Lapscher in ZMG 191 (1970), 288.]

    Google Scholar 

  545. George H. Rousseau: ‘Logical Systems with Finitely Many Truth-values,’ Bulletin de I’Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 17 (1969), 189–194. [Reviewed by Alan Rose in MR 41 (1971), 595.]

    Google Scholar 

  546. Richard Routley: ‘The Need for Nonsense,’ Australasian Journal of Philosophy 47 (1969), 367–374.

    Google Scholar 

  547. See Routley and Routley (1969).

    Google Scholar 

  548. Richard Routley and Valerie Routley: ‘Categories—Expressions or Things?,’ Theoria 35 (1969), 215–238.

    Google Scholar 

  549. See Routley and Routley (1969).

    Google Scholar 

  550. Imre Ruzsa: ‘Random Models of Logical Systems. I: Models of Valuing Logics,’ Studia Scientiarum Mathematicarum Hungarica 4 (1969), 301–312. [Reviewed by the author in ZMG 187 (1970), 269–270.]

    Google Scholar 

  551. Albert Sade: ‘Fonctions propositionnelles monadiques dans la logique trivalente,’ Annales de la Société Scientifique de Bruxelles, série I, Sciences Mathématiques, Astronomiques et Physiques 83 (1969), 203–214. [Reviewed by the author in MR 40 (1970), 753–754; by the author in ZMG 175 (1969), 264.]

    Google Scholar 

  552. Albert Sade: ‘Algébre de Łukasiewicz dans la logique trivalente,’ Univerzitet u Beogradu, Publikacije Elektrotehničkog Fakulteta, Seriá Matematika i Fizika no. 247–273 (1969), 123–130. [Reviewed by Newton C. A. da Costa in MR 41 (1971), 7.]

    Google Scholar 

  553. Albert Sade: ‘Sur le premier système de Lukasiewicz,’ Archivum Matématiques 5 (1969), 207–214. [Reviewed by M. Stojaković in MR 43 (1972), 1325; by A. Johanson in ZMG 256 (1973), 13.]

    Google Scholar 

  554. Peter Schofield: ‘Independent Conditions for Completeness of Finite Algebras with a Single Generator,’ Journal of the London Mathematical Society 44 (1969), 413–423. [Reviewed by Alan Rose in MR 39 (1970), 249.]

    Google Scholar 

  555. George F. Schumm: ‘On Some Open Questions of B. Sobocinski,’ Notre Dame Journal of Formal Logic 10 (1966), 261–262. [Reviewed by Richmond H. Thomason in MR 40 (1970), 754; by the author in ZMG 167 (1969), 9.]

    Google Scholar 

  556. See Shinahr and Yoeli (1969).

    Google Scholar 

  557. Ilka Shinahr and Michael Yoeli: ‘Group Functions and Multivalued Cellular Cascades,’ Information and Control 15 (1969), 369–376. [Reviewed by the authors in MR 40 (1970), 733.]

    Google Scholar 

  558. See Mine and Hasegawa and Koga and Ideda and Shintani (1969).

    Google Scholar 

  559. Anjan Shukla: ‘A Note on Independence,’ Notre Dame Journal of FormalLogic 10 (1969), 410–411. [Reviewed by the author in MR 40 (1970), 3.]

    Google Scholar 

  560. A. Tauts: Nonregular First Order Predicate Calculus (Russian), AlgébrA i Logika 8 (1969), 76–92. [English translation in Algebra and Logic, 8 (1969), 41-49.] [Reviewed by M. Rogava in MR 43 (1972), 1102.]

    Google Scholar 

  561. See Kitahashi and Nomura and Tezuka and Kasahara (1969).

    Google Scholar 

  562. See Ivas’kiv and Pospelov and Tošič (1969).

    Google Scholar 

  563. See Marek and Traczyk (1969).

    Google Scholar 

  564. Atwell R. Turquette: ‘Generalizable Kleene Logics,’ Proceedings of the American Mathematical Society 20 (1969), 361–367. [Reviewed by Alan Rose in MR 39(1970), 249; by the author in ZMG 182 (1970), 315–316.]

    Google Scholar 

  565. Atwell R. Turquette: ‘Peirce’s Complete System of Triadic Logic,’ Transactions of the Charles S. Peirce Society 5 (1969), 199–210.

    Google Scholar 

  566. Bas C. van Fraassen: ‘Presuppositions, Supervaluations, and Free Logic,’ The Logical Way of Doing Things, edited by Karel Lambert, New Haven (Yale University Press) 1969, pp. 67–91.

    Google Scholar 

  567. See McCall and Vander Nat (1969).

    Google Scholar 

  568. J. C. Varlet: ‘Considérations sur les algèbres de Lukasiewicz trivalentes,’ Bulletin de la Société Royale des Sciences de Liège 38 (1969), 462–469. [Reviewed by the author in ZMG 193 (1970), 296–297.]

    Google Scholar 

  569. V. I. Varšavskiĭ: ‘A Majority Operation in Many-valued Logic’ (Russian), Kibérnétika (1969), no. 2, 64–67. [Reviewed by Ivo G. Rosenberg in ZMG 211 (1971), 12.]

    Google Scholar 

  570. See Georgescu and Vraciu (1969).

    Google Scholar 

  571. See Georgescu and Vraciu (1969a).

    Google Scholar 

  572. See Georgescu and Vraciu (1969b).

    Google Scholar 

  573. See Georgescu and Vraciu (1969c).

    Google Scholar 

  574. See Georgescu and Vraciu (1969d).

    Google Scholar 

  575. K. M. Waliuzzaman: Multistage Implementation of Multi-valued Switching Functions. Ph.D. dissertation: University of Toronto, 1969.

    Google Scholar 

  576. See Wee and Fu (1969).

    Google Scholar 

  577. William G. Wee and K. S. Fu: ‘A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems,’ IEEE Transactions of Systems Science and Cybernetics 5 (1969), 215–223. [Reviewed by the authors in ZMG 188 (1970), 332.]

    Google Scholar 

  578. A. V. Wijngaarden (editor): ‘Report on the Algorithmic Language ALGOL 68,’ Numerische Mathematik 14 (1969), 79–218.

    Google Scholar 

  579. Ryszard Wójcicki: ‘Logical Matrices Strongly Adequate for Structural Sentential Calculi,’ Bulletin de I’Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 17 (1969), 333–335. [Reviewed by Eugen Mihailescu in MR 41 (1971), 595; by A. I. Arruda in ZMG 198 (1971), 19.]

    Google Scholar 

  580. Peter Worthing Woodruff: Foundations of Three-valued Logic. Ph.D. dissertation: University of Pittsburgh, 1969. Ann Arbor (University Microfilms) 1969.

    Google Scholar 

  581. See Shinahr and Yoeli (.1969).

    Google Scholar 

  582. See Zaharova and Kudrjavcev and Jablonskiĭ (1969).

    Google Scholar 

  583. E. Ju. Zaharova, Valeriĭ B. Kudrjavcev and S. V. Jablonskiĭ: ‘Precomplete Classes in k-valued Logic’ (Russian), Doklady Akademii Nauk SSSR 186 (1969), 509–512. [English translation in Soviet Mathematics 10 (1969), 618–622.] [Reviewed by L. W. Szczerba in MR 39 (1970), 1220; by Louis F. Goble in ZMG 191 (1970), 288.]

    Google Scholar 

  584. V. A. Abdugaliev: On the Question of the Representation of Functions of a k-valued Logic by a Normal Form. II. Selection of the Simple Parts of a Pair (A, B) when (L A , LB) = 0 and LA = LB Construction of the Reduced Disjunctive Normal Form’ (Russian), Diskretnyĭ Analiz 16 (1970), 3–15. [Reviewed by G. E. Mine in MR 44(1972), 488.]

    Google Scholar 

  585. See Santos and Arango and Pascual and Roing (1970).

    Google Scholar 

  586. See Bellman and Zadeh (1970).

    Google Scholar 

  587. Richard E. Bellman and L. A. Zadeh: ‘Decision-making in a Fuzzy Environment,’ Management Science 17, no. 4 (1970), pp. B-141-B-164.

    Google Scholar 

  588. See Belnap and McCall (1970).

    Google Scholar 

  589. Fernando Bertolini: ‘Kripke Models and Manivalued Logics,’ Symposia Mathematica, vol. V, London (Academic Press) 1970, pp. 113–131. [Reviewed by A. Tauts in MR 45 (1973), 5; by the author in ZMG 212 (1971), 19–20.]

    Google Scholar 

  590. Fernando Bertolini: ‘Kripke Models and Many-valued Logics. II,’ Rendiconti del Seminario Matematico dell’Universitá di Padova 44 (1970), 355–381. [Reviewed by A. Tauts in MR 46 (1973), 260; by Alan Rose in ZMG 266 (1974), 15.]

    Google Scholar 

  591. See Bieltz and Birliba (1970).

    Google Scholar 

  592. Petre Bieltz and Mihai Dan Bîrliba: ‘Some Remarks Concerning the Principle of Excluded Middle,’ Analele Universitâtii Bucureşti, Seria Acta Logica 13 39–47. [Registered in ZMG 266 (1974), 13.]

    Google Scholar 

  593. See Bieltz and Bîrliba (1970).

    Google Scholar 

  594. Vlad Boicescu: ‘Sur la representation des algebres de Lukasiewicz n- valentes,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 270 (1970), 4-7. [Reviewed by Luiz F. T. Monteiro in JSL 38 (1973), 153; by Alan Rose in MR 41 (1971), 269; by the author in ZMG 193 (1970), 297.]

    Google Scholar 

  595. See Boicescu and Georgescu (1970).

    Google Scholar 

  596. Vlad Boicescu and George Georgescu: ‘Les algèbres de Lukasiewicz centrées et axées,’ Revue Roumanie de Mathématiques Pures et Appliquees 15 (1970), 675–681. [Reviewed by Newton C. A. da Costa in MR 41 (1971), 1505–1506; by the authors in ZMG 202 (1971), 7.]

    Google Scholar 

  597. Eramis Bueno: ‘A Certain Class of Many-valued Modal Systems’ (Russian), Néklassičeskaá Logika, edited by P. V. Tavanec, Moscow (Izdatel’stvo “Nauka”) 1970, pp. 276–285. [Reviewed by I. Ruzsa in MR 47 (1974), 1121.]

    Google Scholar 

  598. G. E. Ceitlin: ‘The Structure of a Modified Post Algebra and Its Properties’ (Russian), Kibernetika (1970), no. 4, pp. 39–54. [Reviewed by Stephan L. Bloom in MR 45 (1973), 585.]

    Google Scholar 

  599. Roberto Cignoli: Moisil Algebras. Notas de Logica Matematica) N° 27, Bahia Blanca (Instituto de Matématica, Universidad Nacional) 1970. 47 pp. [Reviewed by Tadeusz Traczyk in ZMG 212 (1971), 317.]

    Google Scholar 

  600. H. Dunderdale: ‘Current-mode Circuits for the Unary Functions of a Ternary Variable,’ Electronic Letters 6 (1970), 15–16.

    Google Scholar 

  601. J. Michael Dunn: ‘Algebraic Completeness Results for R-mingle and Its Extensions,’ The Journal of Symbolic Logic 35 (1970), 1–13. [Reviewed by Robert I. Goldblatt in MR, 44 (1972), 952.]

    Google Scholar 

  602. J. Michael Dunn: ‘Extensions of RM and LC,’ The Journal of Symbolic Logic 35 (1970), 360.

    Google Scholar 

  603. V. K. Finn: ‘Certain Characteristics Truth-tables of Classical Logic and of the Three-valued Logic of J. Łukasiewicz’ (Russian), Isslédovanie Logičékih Sistém, edited by P. V. Tavanec, Moscow (Izdatél’stvo “Nauka”) 1970, pp. 215–261. [Reviewed by M. Stojakovic in MR 48 (1974), 339-340; by B. M. Schein in ZMG 252 (1973), 10.]

    Google Scholar 

  604. R. V. Freĭvald: ‘Coding of Finite Sets and a Criterion of Completeness up to Coding in Three-valued Logic’ (Russian), Doklady Akadémii Nauk SSSR 190 (1970), 1034–1037. [English translation in Soviet Mathematics 11 (1970), 249–253.] [Reviewed by the author in ZMG 206 (1971), 6.]

    Google Scholar 

  605. Dov M. Gabbay: ‘The Decidability of the Kreisel-Putnam System,’ The Journal of Symbolic Logic 35 (1970), 431–437.

    Google Scholar 

  606. George Georgescu: ‘Caractérisation des épimorphismes de algèbres de Lukasiewicz 0-valentes,’ Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, série A 271 (1970), 1222–1224. [Reviewed by the author in MR 42 (1971), 1360; by the author in ZMG 205 (1971), 305.]

    Google Scholar 

  607. George Georgescu: ‘La dualite des algebres de Post 0-valentes,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 271 (1970), 766–768.

    Google Scholar 

  608. See Boicescu and Georgescu (1970).

    Google Scholar 

  609. See Georgescu and Vraciu (1970).

    Google Scholar 

  610. George Georgescu: ‘The Centered Epimorphisms and the Construction of the Tensor Product in Lukn,’ Revue Roumanie de Mathematique Pures et Appliquees 15 (1970), 693–709. [Reviewed by the author in ZMG 202 (1971), 7.]

    Google Scholar 

  611. George Georgescu and Constantin Vraciu : ‘On the Characterization of Centered Lukasiewicz Algebras,’ Journal of Algebra 16 (1970), 486–495. [Reviewed by J. Drabbe in MR 42 (1971), 1360; by the author in ZMG 207 (1971), 7.]

    Google Scholar 

  612. Leonard Goddard: ‘Nonsignificance,’ Australasian Journal of Philosophy 48 (1970), 10–16.

    Google Scholar 

  613. See Haberlin and Muller (1970).

    Google Scholar 

  614. H. Haberlin and H. Muller: ‘Arithmetische Operationen mitbinar codierten Ternarzahlen,’ Mitteilungen AGEN no. 11 (1970), pp. 55–58.

    Google Scholar 

  615. Heelan (1970). Patrick A. Heelan: ‘Quantum Logic and Classical Logic: Their Respective Roles,’ Synthese, vol. 21 (1970), pp. 2–33. Reprinted in Logical and Epistemological Studies in Contemporary Physics, edited by Robert S. Cohen and Marx W. Wartofsky, Dordrecht (D. Reidel Publishing Company) 1974, pp. 318–349. [Reviewed by R. J. Greechie in ZMG 205 (1971), 8.]

    Google Scholar 

  616. Hans G. Herzberger: ‘Truth and Modality in Semantically Closed Languages,’ The Paradox of the Liar, edited by Robert L. Martin, New Haven (Yale University Press) 1970, pp. 25–46.

    Google Scholar 

  617. See Hosoi and Ono (1970).

    Google Scholar 

  618. Tsutomu Hosoi and Hiroakira Ono : ‘The Intermediate Logics on the Second Slice,’ Journal of the Faculty of Science, University of Tokyo, Section I A, Mathe­matics 17 (1970), 457–461. [Reviewed by Robert A. Bull in MR 44 (1972), 713’714; by the authors in ZMG 216 (1971), 5.]

    Google Scholar 

  619. Hung (1970). Hung Chen Uan: ‘Remarks on Intermediate Logics,’ Taiha Journal of Mathematics 2 (1970), 31–43. [Registered in ZMG 236 (1972), 23.]

    Google Scholar 

  620. A. A. Ivin: ‘Definitions of Alethic and Deontic Modal Functions in Terms of Material Implication and Constants’ (Russian), Néklassičeskaá Logika, edited by P. V. Tavanec, Moscow (Izdatél’stvo “Nauka”) 1970, pp. 113–123. [Reviewed by I. Ruzsa in MR 47 (1974), 1121.]

    Google Scholar 

  621. L. Janczewski: Practical Realization of Multivalued Logic Circuits. M.A.Sc. Thesis: University of Toronto, 1970.

    Google Scholar 

  622. See Kitahashi and Tezuka and Kasahara and Nomura (1970).

    Google Scholar 

  623. See Kitahashi and Tezuka and Kasahara and Nomura (1970).

    Google Scholar 

  624. T Kitahashi, Y Tezuka, Y Kasahara and H Nomura: ‘Monotonicity of Ternary Logical Functions and Its Applications to the Analysis of Ternary Threshold Functions’ (Japanese), Denshi Tsushin Gakkai Ronbunshi 53-C (1970), 73–79. [English translation in Systems-Computers-Controls 1 (1970), 55–63.] [Reviewed by Alan Rose in MR 48 (1974). 15.]

    Google Scholar 

  625. V. I. Klevačev : Certain Systems that are Complete in Pk (Russian), Kibernetika (1970), pp. 139–140. [Reviewed by Ivo G. Rosenberg in MR 45 (1973), 583.]

    Google Scholar 

  626. Stephan Körner: Categorial Frameworks. New York ( Barnes and Noble, Inc. ) 1970.

    Google Scholar 

  627. V. B. Kudrjavcev: ‘The Coverings of Precomplete Classes of k-valued Logic’ (Russian), Diskretnyĭ Analiz 17 (1970), 32–44. [Reviewed by M. Stojakovic in MR, 45 (1973), 313-314; by G. E.. Mine in ZMG 253 (1973), 15.]

    Google Scholar 

  628. See Vranesic and Lee and Smith (1970).

    Google Scholar 

  629. Jan Łukasiewicz: Selected Works, edited by L. Borkowski. Amsterdam (North-Holland Publishing Company) 1970. [Reviewed by Czesław Lejewski in The Journal of Philosophy 70 (1973), 82–85; by Storrs McCall in Synthese, 26 (1973), 165–171; by G. E. Mine in ZMG 212 (1971), 9; by William Kneale in Mind, n.s. 81 (1972), 144–147.]

    Google Scholar 

  630. See Belnap and McCall (1970).

    Google Scholar 

  631. See Mine and Shimada (1970).

    Google Scholar 

  632. Hisashi Mine and Ryosaku Shimada: ‘Permutations and Lattice Operations in Many-valued Logic’ (Japanese), Denshi Tsushin Gakkai Ronbushi 53-C (1970), 166–173. [English translation in Systems-Computers-Controls 1 no. 2 (1970), 24–32.] [Reviewed by Alan Rose in MR 46 (1973), 1522.]

    Google Scholar 

  633. LFT. Monteiro : ‘Les algèbres de Heyting et de Lukasiewicz tri­valentes’, Notre Dame Journal of Formal Logic 11(1970), 453–466. [Reviewed by I. Petrescu in MR 44 (1972), 714; by the author in ZMG 177 (1970), 10.]

    Google Scholar 

  634. LFT. Monteiro : ‘Extension d’homomorphismes dans les algebres de Lukasiewicz trivalentes’, International Logic Review no. 2 (1970), 193–200. [Reviewed by S. Comer in MR 46 (1973), 1213-1214.]

    Google Scholar 

  635. See Haberlin and Muller (1970).

    Google Scholar 

  636. Muzio (1970). J. C. Muzio: ‘A Decision Process for 3-valued Sheffer Functions. I,’ Zeit­schrift für mathematische Logik und Grundlagen der Mathematik 16 (1970), 271–280. [Reviewed by Alan Rose in MR 43 (1972), 850; by the author in ZMG 191 (1970), 287.]

    Google Scholar 

  637. See Kitahashi and Tezuka and Kasahara and Nomura (1970).

    Google Scholar 

  638. See Hosoi and Ono (1970).

    Google Scholar 

  639. Pannier (1970 abstract). Robert A. Pannier: ‘Axiomatic Systems and m-valued Calculi,’ The Journal of Symbolic Logic 35 (1970), 360.

    Google Scholar 

  640. See Santos and Arango and Pascual and Roing (1970).

    Google Scholar 

  641. Richard L. Purtill: ‘Four-valued Tables and Modal Logic,’ Notre Dame Journal of Formal Logic 11 (1970), 505–511. [Reviewed by Nino B. Cocchiarella in MR, 46 (1973), 261; by the author in ZMG 169 (1969), 300.]

    Google Scholar 

  642. Willard Van Orman Quine: Philosophy of Logic. Englewood Cliffs ( Prentice-Hall, Inc. ) 1970.

    Google Scholar 

  643. M. F. Raca: ‘Functional Completeness in Certain Logics that are Intermediate Between the Classical and Intuitionistic Ones’ (Russian), Matematičeskie Issledovaniá 5 (1970), 171’176. [Reviewed by F. Vandamme in MR 46 (1973), 1208; by G. E. Mine in ZMG 232 (1972), 15.]

    Google Scholar 

  644. Helena Rasiowa: ‘Ultraproducts of m-valued Models and a Generalization of the Ldwenheim-Skolem-Godel-Malcev Theorem for Theories Based on m-valued Logics,’ Bulletin de I’Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 18 (1970), 415–420. [Reviewed by Arto Salomaa in MR 43 (1972), 850; by the author in ZMG 221 (1972), 24.]

    Google Scholar 

  645. R. A. Rockingham Gill: ‘The Craig-Lyndon Interpolation Theorem in 3-valued Logic,’ The Journal of Symbolic Logic 35 (1970), 230–238. [Reviewed by M. R. Krom in MR 43 (1972), 7; by Alan Rose in ZMG 212 (1971), 315–316.]

    Google Scholar 

  646. See Santos and Arango and Pascual and Roing (1970).

    Google Scholar 

  647. Ivo G. Rosenberg: ‘Complete Sets for Finite Algebras,’ Mathematische Nachrichten 44 (1970), 253–258. [Reviewed by Arto Salomaa in MR 43 (1972), 850; by the author in ZMG 212 (1971), 318.]

    Google Scholar 

  648. George H. Rousseau: ‘Sequents in Many-valued Logic II,’ Fundamenta Mathematicae 67 (1970), 125’131. [Reviewed by Arend Heyting in MR 41 (1971), 1229; by the author in ZMG 193 (1970), 307.]

    Google Scholar 

  649. GH. Rousseau: Post Algebras and Pseudo-Post Algebras, Fundamenta Mathematicae 67 (1970), 133–145. [Reviewed by Tadeusz Traczyk in ZMG 198(1971),19.]

    Google Scholar 

  650. I Ruzsa: Random Models of Logical Systems. II: Models of Some Modal Logics, Studia Scientiarum Mathematicarum Hungarica 5 (1970), 255–265. [Reviewed by the author in ZMG 237 (1973), 28.]

    Google Scholar 

  651. See Santos and Arango and Pascual and Roing (1970).

    Google Scholar 

  652. J. Santos, H. Arango, M. Pascual and G. Roing: A Cyclic Algebra for the Synthesis of Ternary Digital Systems, IEEE Transactions on Computers C-19 (1970), 651–653.

    Google Scholar 

  653. HF. Schott: Generalizability of the Propositional and Predicate Calculi to Infinite-valued Calculi, Notre Dame Journal of Formal Logic 11 (1970), 107–128. [Reviewed by Alan Rose in MR 44 (1972), 1174; by Alan Rose in ZMG 212 (1971), 315.]

    Google Scholar 

  654. Kajetan Šeper: ‘A Decision Problem Concerning Autoduality in k-valued Logic,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 17 (1971), 251–255. [Reviewed by Alan Rose in MR44 (1972), 1176.]

    Google Scholar 

  655. See Mine and Shimada (1970).

    Google Scholar 

  656. Thoralf Skolem: Selected Works in Logic, edited by Jens Erik Fenstad. Oslo-Bergen–Tromsö (Universitetsforlaget) 1970. [Reviewed by K. Inoue in MR 44 (1972), 484–485; by G. E. Mine in ZMG 228 (1972), 12.]

    Google Scholar 

  657. Brian Skyrms: ‘Return of the Liar: Three-valued Logic and the Concept of Truth,’ American Philosophical Quarterly 1 (1970), 153–161. Skyrms (1970a). Brian Skyrms: Notes on Quantification and Self-reference, The Paradox of the Liar, edited by Robert L. Martin, New Haven (Yale University Press) 1970, pp. 67–74.

    Google Scholar 

  658. See Vranesic and Lee and Smith (1970).

    Google Scholar 

  659. Ju. N. Soloduhin: ‘A Concept of Function-analogue and a Criterion for Functional Incompleteness of Systems of Many-valued Logic’ (Russian), Isslédovanié Logičéskih Sistém, edited by P. V. Tavanec, Moscow (Izdatél’stvo “Nauka”) 1970, pp. 271–281. [Reviewed by G. Bär in MR 47 (1974), 1120–1121; by G. E. Mine in ZMG 265 (1974), 18.]

    Google Scholar 

  660. See Tanaka and Tahara (1970).

    Google Scholar 

  661. Moto-o Takahashi: ‘Continuous A-e Logics,’ The Annuals of the Japan Association for the Philosophy of Science 3 (1970), 205–215. [Reviewed by the author in MR 44 (1972), 1176–1177; by G. Fuhrkenin ZMG 213 (1971), 14.]

    Google Scholar 

  662. M Takahashi: Many-valued Logics of Extended Gentzen Style II, The Journal of Symbolic Logic 35 (1970), 493–528. [Reviewed by the author in MR 44 (1972), 1177; by Alan Rose in ZMG 229 (1972), 19.]

    Google Scholar 

  663. J Tallet: On the Symmetry of Many-valued Logical Systems, Logique et Analyse, n.s. 13 (1970), 302–322. [Reviewed by G. Bar in MR 44 (1972), 291; by Louis F. Goble in ZMG 216 (1971), 287.]

    Google Scholar 

  664. See Tanaka and Tahara (1970).

    Google Scholar 

  665. Sueo Tanaka and Michio Tahara: ‘Functional Completeness and Polyphecks in 3-valued Logic’ (Japanese), Denshi Tsushin Gakkai Ronbunshi 53-C (1970), 111–118. [English translation in Systems-Computers-Controls 1 (1970), 64–73.] [Reviewed by Alan Rose in MR 48 (1974), 16.]

    Google Scholar 

  666. See Kitahashi and Tezuka and Kasahara and Nomura (1970).

    Google Scholar 

  667. RH. Thomason: Indeterminist Time and Truth-value Gaps, Theoria 36 (1970), 264–281. [Reviewed by Robert I. Goldblatt in MR 47 (1974), 5-6; by the author in ZMG 269 (1974), 19.]

    Google Scholar 

  668. Dolph E. Ulrich: ‘Decidability Results for Some Classes of Propositional Calculi,’ The Journal of Symbolic Logic 35 (1970), 353–354.

    Google Scholar 

  669. DI. Vakarelov: The Concept of Dogma and Some Systems of Many-valued Logic (Russian), Godišnik na Sofiĭskia Universitet, Filos.-Istor. Fakultet 64 (1970) no. 1 (Filos.), 249–264. [Reviewed by VI. Sotirov in ZMG 247 (1973), 8-9.]

    Google Scholar 

  670. Bas C. van Fraassen: ‘Truth and Paradoxical Consequences,’ The Paradox of the Liar, edited by Robert L. Martin, New Haven (Yale University Press) 1970, pp. 13–23.

    Google Scholar 

  671. Bas C. van Fraassen: ‘Rejoinder: On a Kantian Conception of Language,’ The Paradox of the Liar, edited by Robert L. Martin, New Haven (Yale University Press) 1970, pp. 59–66.

    Google Scholar 

  672. Giovanni Villa: ‘Calcola proposizionale trivalente dialettico,’ Bollettino della Unione Matematica Italiana, Serie IV 3 (1970), 1026–1041. [Reviewed by the author in ZMG 202 (1971), 6.]

    Google Scholar 

  673. See Georgescu and Vraciu (1970).

    Google Scholar 

  674. See Vranesic and Lee and Smith (1970).

    Google Scholar 

  675. ZG. Vranesic, E. S. Lee and KC. Smith: ‘alued Algebra for Switching Systems’ IEEE Transactions on Computers C-19 (1970), 964–971.

    Google Scholar 

  676. B. Węglorz : ‘entation Theorem for Post-like Algebras’ Collo­quium Mathematicum 22 (1970), 35–39. [Reviewed by J. Waszkiewicz in ZMG 209 (1971), 14.]

    Google Scholar 

  677. WC. Wilcox : ‘On Infinite Matrices and the Paradoxes of Strict Implication,’ Notre Dame Journal of Formal Logic 11 (1970), 254–256. [Reviewed by Newton C. A. da Costa in MR 43 (1972), 589; by the author in ZMG 167 (1969), 8.]

    Google Scholar 

  678. E. Włodarska: ‘On Representation of Post Algebras Preserving Some Infinite Joins and Meets’, Bulletin de IAcadémie Polonaise des Sciences, Série des Sciences Mathematiques, Astronomiques et Physiques 18 (1970), 49–54. [Reviewed by Tadeusz Traczyk in ZMG 208 (1971), 12.]

    Google Scholar 

  679. R Wójcicki : ‘Some Remarks on the Consequence Operation in Sentential Logics,’ Fundamenta Mathematicae 68 (1970), 269–279. [Reviewed by G. E. Mine in ZMG 202 (1971), 274.]

    Google Scholar 

  680. Peter W. Woodruff: ‘Constructive Three-valued Logic,’ The Journal of Symbolic Logic 35 (1970), 183–184.

    Google Scholar 

  681. Peter W. Woodruff: ‘Logic and Truth Value Gaps,’ Philosophical Problems in Logic: Some Recent Developments, edited by Karel Lambert, Dordrecht (D. Reidel Publishing Company) 1970, pp. 121–142. [Reviewed by John Corcoran and J. Herring in MR 44 (1972), 1177; by the author in ZMG 194 (1970), 307.]

    Google Scholar 

  682. See Bellman and Zadeh (1970).

    Google Scholar 

  683. Aleksandr A. Zinov’ev: ‘Minimal Tautologies and Contradictions in Finitely Many-valued Logic’ (Russian), Isslédovanie Logičéskih Sistém, edited by P. V. Tavanec, Moscow (Izdatél’stvo “Nauka”) 1970, pp. 262–270. [Reviewed by G. Bär in MR 47 (1974), 1121; by G. E. Mine in ZMG 243 (1973), 20.]

    Google Scholar 

  684. V. B. Alekseev : ‘Simple Bases and Simple Functions in k-valued Logic’ (Russian), Kibérnétika (1971), no. 5, pp. 137–141. [Reviewed by Ivo G. Rosenberg in MR 46 (1973), 1521–1522; by Arto Salomaa in ZMG 253 (1973), 14–15.]

    Google Scholar 

  685. V. B. Alekseev : ‘On the Number of Simple Bases in k-valued Logic’ (Russian), Diskretnyĭ Analiz 19 (1971), 3–10. [Reviewed by Arto Salomaa in ZMG 252(1973), 10.]

    Google Scholar 

  686. See Zavisca and Allen (1971).

    Google Scholar 

  687. P Aloisio : ‘Alcune osservazioni sulla definibilità di operatori finiti e sulla decidibilità algoritmica della completezza funzionale e deduttiva delle logiche a più valori,’Annali dell’Università di Ferrara (Nuovo Serie), Sezione VII, Scienze Matematiche16 (1971), 157–165. [Reviewed by Haskell B. Curry in MR 46 (1973), 557; by F. G. Asenjo in ZMG 238 (1972), 21.]

    Google Scholar 

  688. John G. Anderson: ‘The Degree of Completeness of Dummett’s LC and Thomas’ LCn,’ Journal of the London Mathematical Society 3 (1971), 558–560.

    Google Scholar 

  689. Richard B. Angell: ‘Connexive Implication, Modal Logic and Subjunctive Conditionals,’ The Journal of Symbolic Logic 36 (1971), 367–368.

    Google Scholar 

  690. See Applebee and Pahi (1971).

    Google Scholar 

  691. RC. Applebee and B Pahi: ‘ults on Generalized Truth Tables,’ Notre Dame Journal of Formal Logic 12 (1971), 435–440. [Reviewed by Robert I. Goldblatt in MR 45 (1973), 1217.]

    Google Scholar 

  692. See Ayat and Vranesic (1971).

    Google Scholar 

  693. K. A. El Ayat and Zvonko G. Vranesic: ‘Application of Multivalued Cyclic Codes,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 7–12.

    Google Scholar 

  694. R. A. Baĭramov : ‘The Classes of Multiplace Functions on Finite Sets’ (Russian), Akademià Nauk Azerbaĭdžanskoi SSR, Doklady 27, no. 7 (1971), 6–9. [Reviewed by M. Stojakovic in MR 46 (1973). 4; by the author in ZMG 229 (1972), 26.]

    Google Scholar 

  695. G Barton : ‘Algebre di Post monadiche,’ Matematiche 26 (1971), 252–260. [Reviewed by S. Rudeanu in ZMG 262 (1974), 25.]

    Google Scholar 

  696. See Blohina and Kudrjavcev (1971).

    Google Scholar 

  697. G. N. Blohina and V. B. Kudrjavcev: ‘On Basic Groups in k-valued Logics’ (Russian), Doklady Akadémii Nauk SSSR 201 (1971), 9–11. [English translation in Soviet Mathematics 12 (1971), 1583-1585.] [Reviewed by Tsutomu Hosoi in ZMG 243 (1973), 20.]

    Google Scholar 

  698. Vlad Boicescu: ‘Sur les algèbres de Lukasiewicz,’ Logique, Automatique, Informatique, edited by Grigor Constantin Moisil, Bucharest (Éditions de I’Académie dela Rpublique Socialiste de Roumanie) 1971, pp. 71–89. [Reviewed by Alonzo Church in JSL 39 (1974), 184; by D. Ponasse in ZMG 273 (1974), 19.]

    Google Scholar 

  699. Vlad Boicescu: ‘Sur les systèmes déductifs dans la logique θ-valente,’ Publications du Départment de Mathématiques, Lyon 8 (1971), 123–133. [Reviewed by VI. Sotirov in ZMG 262 (1974), 11.]

    Google Scholar 

  700. See Braddock and Epstein and Yamanaka (1971).

    Google Scholar 

  701. R. C. Braddock, George Epstein and H. Yamanaka: ‘Multiple-valued Logic Design and Applications in Binary Computers,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 13–25.

    Google Scholar 

  702. Ross Thomas Brady: A 4-valued Theory of Classes and Individuals. Ph.D. dissertation: University of St. Andrews, 1971.

    Google Scholar 

  703. RT Brady : ‘The Consistency of the Axioms of Abstraction and Extensionajity in Three-valued Logic,’ Notre Dame Journal of Formal Logic12 (1971), 447–453. [Reviewed by P. C. Gilmore in MR 45 (1973), 1216-1217; by the author in ZMG 185(1970), 14.]

    Google Scholar 

  704. G. E. Ceĭtlin: ‘The Infinitely Generated Subalgebras of a Modified Post Algebra’ (Russian), Kibérntika (1971), no. 2, pp. 43–55. [Reviewed by A. Preller in MR 46 (1973), 1213; by Elliott Mendelson in ZMG 257(1973), 10.]

    Google Scholar 

  705. See Lee and Chang (1971).

    Google Scholar 

  706. See Cheung and Su (1971).

    Google Scholar 

  707. See Su and Cheung (1971).

    Google Scholar 

  708. Peter T. Cheung and Stephan Y. H. Su: ‘Algebraic Properties of Multi-valued Symmetric Switching Functions,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, Buffalo (1971), pp. 26–35.

    Google Scholar 

  709. Mihail Cherciu: ‘Filtres de Stone dans les trellis distributifs,’ Logique, Automatique, Informatique, edited by Grigor Constantin Moisil, Bucharest (Éditions de I’Académie de la République Socialiste de Roumanie) 1971, pp. 91–97. [Reviewed by Alonzo Church in JSL 39 (1974), 184.]

    Google Scholar 

  710. Anton Dumitriu: Logica Polivalentǎ. Second edition (in collaboration with Teodor Stihi). Bucharest (Editions Enciclopedica Romana) 1971.

    Google Scholar 

  711. See Dunn and Meyer (1971).

    Google Scholar 

  712. George Epstein: ‘On Unary Operators in Post Algebras,’ Notices of the American Mathematical Society 18 (1971), 535.

    Google Scholar 

  713. George Epstein: ‘Aspects of Post Algebras,’ Tarski Symposium ( 1971 ), Berkeley, California.

    Google Scholar 

  714. See Braddock and Epstein and Yamanaka (1971).

    Google Scholar 

  715. George Epstein: ‘Decision Algebras,’ ITT Gilfillan Publication Series 73–22, Van Nuys (1971).

    Google Scholar 

  716. V. K. Finn: ‘On the Axiomatisation of a Three-valued Logic’ (Russian), Naučno-Tehnikčeskaà Informacia, Serià 2, Informacionnye Processy i Sistemy 11 (1971), 16–20. [Reviewed by G. E. Mine in ZMG 242 (1973), 19–20.]

    Google Scholar 

  717. V. K. Finn: Axiomatization of some 3-valued propositional calculi and of their algebras. (Russian). Institute of Scientific and Technical Information ( VINITI ), Moscow, no. 4471–72.

    Google Scholar 

  718. See Fujita and Kitahashi and Tanaka (1971).

    Google Scholar 

  719. Y. Fujita, Tadahiro Kitahashi and K. Tanaka: ‘Homomorphisms of Logical Functions and Their Applications,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971). pp. 36–41.

    Google Scholar 

  720. Dov M. Gabbay: ‘The Decidability of the Kreisel-Putnam System,’ The Journal of Symbolic Logic 36 (1971), 369.

    Google Scholar 

  721. George Georgescu: Les Algèbres de Lukasiewicz θ-valentes,’ Logique, Automatique, Informatique, edited by Grigor Constantin Moisil, Bucharest (Éditions de I’Académie de la République Socialiste de Roumanie) 1971, pp. 99–169. [Reviewed by Alonzo Church in JSL 39 (1974), 184; by the author in ZMG 242 (1973), 35–36.]

    Google Scholar 

  722. G Georgescu: ‘Algèbres de Lukasiewicz mondaiques et polyadiques,’ Comptes Rendus Hebdomadaires des Séances de IAcadémie des Sciences, serie A 272 (1971), 416–419. [Reviewed by M. M. Richter in MR 44 (1972), 10; by the author in ZMG 248 (1973), 21.]

    Google Scholar 

  723. George Georgescu: ‘Theoreme de completitude en logique θ-valente,’ Comptes Rendus Hebdomadaires des Séances de I’Académie des Sciences, série A 272 (1971), 1076–1078.

    Google Scholar 

  724. G Georgescu: ‘The θ-valued Lukasiewicz Algebras. I,’ Revue Roumanie de Mathématiques Pures et Appliquées 16 (1971), 195–209. [Reviewed by A. Preller in MR 46 (1973), 565.]

    Google Scholar 

  725. G Georgescu: ‘Algebras de Lukasiewicz de orden θ. II,’ Revue Roumanie de Mathématiques Pures et Appliquées 16 (1971), 363–369. [Reviewed by A. Preller in MR 47 (1974), 1145–1146.]

    Google Scholar 

  726. G Georgescu: ‘n-valued Complete Lukasiewicz Algebras,’ Revue Roumanie de Mathématiques Pures et Appliquées 16 (1971), 41–50. [Reviewed by A. Tauts in MR 46 (1973), 10.]

    Google Scholar 

  727. See Georgescu and Vraciu (1971).

    Google Scholar 

  728. G Georgescu: ‘The θ-valued Lukasiewicz Algebras. Ill Duality Theory,’ Revue Roumanie de Mathematiques Pures et Appliquées 16 (1971), 1365–1390. [Reviewed by A. Preller in MR 47 (1974), 1446.]

    Google Scholar 

  729. G Georgescu: ‘Les θ-ultrafiltres validants d’algebre de Linden-baum-Tarski d’un calcul des predicats a θ-valeurs,’ Bulletin Mathématique de la Société des Sciences Mathématiques de la République Socialiste de Roumanie, n.s. 15 (1971), 9-19. [Reviewed by A. Preller in MR 48 (1974), 346; by the author in ZMG 242 (1973), 36.]

    Google Scholar 

  730. George Georgescu and Constantin Vraciu: ‘Algebre Lukasiewicz monadice,’ Studii si Cercetǎri Matematice 23 (1971), 1027–1048. [Registered in ZMG 242(1973), 35.]

    Google Scholar 

  731. R. J. Haack: ‘No Need for Nonsense,’ Australasian Journal of Philosophy 49 (1971), 71–77.

    Google Scholar 

  732. See Hamacher and Vranesic (1971).

    Google Scholar 

  733. H. C. Hamacher and Zvonko G. Vranesic: ‘Multivalued Versus Binary High Speed Multipliers,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 42–53.

    Google Scholar 

  734. See Mine and Hasegawa and Shimada (1971).

    Google Scholar 

  735. Yu. L. Ivas’kiv: Principles of Multivalued Implementation Schemes ( Russian ). Kiev (Naukova Dumka) 1971.

    Google Scholar 

  736. See Smith and Vranesic and Janczewski (1971).

    Google Scholar 

  737. See Fujita and Kitahashi and Tanaka (1971).

    Google Scholar 

  738. See Kitahashi and Tanaka (1971).

    Google Scholar 

  739. Tadahiro Kitahashi and Kokichi Tanaka: ‘An Orthogonal Expansion of Multiple-valued Logical Functions,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 54–61.

    Google Scholar 

  740. V. B. Kudrjavcev: ‘Concerning s-systems of a k-valued Logic’ (Russian), Doklady Akadémii Nauk SSSR 199 (1971), 20–22. [English translation in Soviet Mathe­matics 12 (1971), 1013-1016. [Reviewed by G. Bär in MR 44 (1972), 8; by Akira Naka­mura in ZMG 233 (1972), 10.]

    Google Scholar 

  741. See Blohina and Kudrjavcev (1971).

    Google Scholar 

  742. Dharmendra Kumar: ‘Vagueness and Subjunctivity,’ Mind, n.s. 80 (1971), 127–131.

    Google Scholar 

  743. See Lee and Lee (1971).

    Google Scholar 

  744. E. T. Lee and S. C. Lee: ‘Multivalued Symmetric Functions,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 62–83.

    Google Scholar 

  745. See Lee and Chang (1971).

    Google Scholar 

  746. RCT. Lee and C Chang: ‘Some Properties of Fuzzy Logic,’ Information and Control 19 (1971), 417–431. [Reviewed by A. Paz in MR 46 (1973), 1207; by S. Gottwald in ZMG 237 (1973), 22.]

    Google Scholar 

  747. See Lee and Lee (1971).

    Google Scholar 

  748. See Liebler and Roesser (1971).

    Google Scholar 

  749. M. Liebler and R. Roesser: ‘Multiple-real-valued Walsh Functions,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 84–102.

    Google Scholar 

  750. Gerald J. Massey: ‘Functional Completeness in m-valued Truth Tabular Logic,’ The Journal of Symbolic Logic 36 (1971), 364.

    Google Scholar 

  751. C. G. McKay: ‘A Class of Decidable Intermediate Propositional Logics,’ The Journal of Symbolic Logic 36 (1971), 127–128. [Reviewed by A. S. Troelstra in MR 43 (1972), 1324; by the author in ZMG 216 (1971), 292.]

    Google Scholar 

  752. See Wojcik and Metze (1971).

    Google Scholar 

  753. Robert K. Meyer: ‘R-mingle and Relevant Disjunction,’ The Journal of Symbolic Logic 36 (1971), 366.

    Google Scholar 

  754. See Dunn and Meyer (1971).

    Google Scholar 

  755. See Mine and Hasegawa and Shimada (1971).

    Google Scholar 

  756. Hisashi Mine, Toshiharu Hasegawa and Ryosaku Shimada: ‘Four Ternary Arithmetic Operations,’ Systems-Computers-Controls 2 (1971), 46–54.

    Google Scholar 

  757. MIT Computing Center: LISP 1.5. Cambridge, Massachusetts (MIT Press) 1971.

    Google Scholar 

  758. Grigor Constantin Moisil: ‘Les états transitoires dans les circuits sequentiels,’ Logique, Automatique, Informatique, edited by Grigor Constantin Moisil, Bucharest (Editions de I’Académie de la République Socialiste de Roumanie) 1971, pp. 215–268. [Reviewed by Alonzo Church in JSL 37 (1972), 626.]

    Google Scholar 

  759. C. Moraga: ‘A Tri-stable Switching Circuit for Synchronized Sequential Machines,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 103–111.

    Google Scholar 

  760. Edgmar Morscher: ‘A Matrix Method for Deontic Logic,’ Theory and Decision 2 (1971), 16–34. [Reviewed by Nino B. Cocchiarella in MR 46 (1973), 874; by K. Schultz in ZMG 268 (1974), 15.]

    Google Scholar 

  761. J. C. Muzio: ‘A Decision Process for 3-valued Sheffer Functions. II,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 17 (1971), 97–114. [Reviewed by Alan Rose in MR 43 (1972), 850; by the author in ZMG 191 (1970), 287-288.]

    Google Scholar 

  762. See Nutter and Swartwout (1971).

    Google Scholar 

  763. R. S. Nutter and Richard E. Swartwout: ‘A Ternary Logic Minimization Technique,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 112–123.

    Google Scholar 

  764. See Nutter and Swartwout (1971).

    Google Scholar 

  765. Hiroakira Ono: ‘On the Finite Model Property for Kripke Models,’ Publications of the Research Institute for Mathematical Sciences, Kyoto University, series A 7 (1971–72), 85–93. [Reviewed by U. Feigner in MR 47 (1974), 6.]

    Google Scholar 

  766. See Applebee and Pahi (1971).

    Google Scholar 

  767. R. Zane Parks: ‘The Mystery of Phi and Psi’ Transactions of the Charles S. Peirce Society 7 (1971), 176–177.

    Google Scholar 

  768. Eleonora Perkowska: ‘Herbrand Theorem for Theories Based on m-valued Logics,’ Bulletin de lAcadémie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 19 (1971), 893–899. [Reviewed by Alan Rose in MR 48 (1974), 15; by Tsutomu Hosoi in ZMG 243 (1973), 21.]

    Google Scholar 

  769. V. Pinkava: ‘Logical Models of Sexual Deviations,’ International Journal of Man-Machine Studies 3 (1971), 351–374.

    Google Scholar 

  770. See Preparata and Yeh (1971).

    Google Scholar 

  771. PF. P. Preparata and R. T. Yeh: ‘On a Theory of Continuously Valued Logic,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 124–132.

    Google Scholar 

  772. Malcolm K. Rennie: Semantics for RKt, The Journal of Symbolic Logic 36(1971), 97–107. [Reviewed by Dov M. Gabbay in MR 44 (1972), 714; by the author in ZMG 214 (1971), 46–47.]

    Google Scholar 

  773. See Rescher and Urquhart (1971).

    Google Scholar 

  774. Rescher and Urquhart (1971). Nicholas Rescher and Alasdair Urquhart: Temporal Logic. New York (Springer-Verlag) 1971. [Reviewed by K. Schultz in ZMG 229 (1972), 21.]

    Google Scholar 

  775. See Liebler and Roesser (1971).

    Google Scholar 

  776. B. A. Romov: ‘On Uniprimitive Bases ot Maximal Post Subalgebras’ (Russian), Kibernetika (1971), no. 6, 21–30. [Reviewed by B. M. Schein in ZMG 265(1974), 18.]

    Google Scholar 

  777. Alan Rose: ‘Note sur la formalisation des calculs propositionnels polyvalents,’ Comptes Rendus Hebdomadaires des Séances de lAcadémie des Sciences, série A 272 (1971), 1689–1690. [Reviewed by Newton C. A. da Costa in MR 44 (1972), 8–9; by the author in ZMG 229 (1972), 18–19.]

    Google Scholar 

  778. Alan Rose: ‘Sur certains foncteurs à m arguments des calculs propositionnels à m valeurs,’ Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, série A 273 (1971), 273–274. [Reviewed by Tsutomu Hosoi in ZMG 229 (1972), 19.]

    Google Scholar 

  779. Richard Routley: ‘Domainless Semantics for Free Quantification and Significance Logics,’ Logique et Analyse, n.s. 14 (1971), 603–626. [Reviewed by John Bacon in ZMG 261 (1974), 19–20.]

    Google Scholar 

  780. V. L. Rvačov: ‘A Certain Extension of the Concept of R-function’ (Russian), Kibernétika (1971) no. 4, 86–92. [Reviewed by M. Stojakovic in MR 46 (1973), 873.]

    Google Scholar 

  781. Halina Savicka: ‘On Some Properties of Generalized Post Algebras,’ Bulletin de l’Académie Polonaise des Sciences, Serie des Sciences Mathematiques, Astronomiques et Physiques 19 (1971), 267–269.

    Google Scholar 

  782. Thomas W. Scharle: ‘Completeness of Many-valued Protothetic,’ The Journal of Symbolic Logic 36 (1971), 363–364.

    Google Scholar 

  783. Kenneth R. Seeskin: ‘Many-valued Logic and Future Contingencies’, Logique et Analyse, n.s. 14 (1971), 759–773; 15 (1972), 665. [Reviewed by Robert I. Goldblatt in MR 48 (1974), 16.]

    Google Scholar 

  784. Rangaswamy V. Setlur: ‘Duality in Finite Many-valued Logic,’ Notre Dame Journal of Formal Logic 12 (1971), 188–194. [Reviewed by A. Tauts in MR 44 (1972), 953; by the author in ZMG 177 (1970), 8.]

    Google Scholar 

  785. Kajetan Šeper: ‘A Decision Problem Concerning Autoduality in valued Logic,’Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 17 (1971), 251–255. [Reviewed by the author in ZMG 193 (1970), 291.]

    Google Scholar 

  786. A. MSette: On the Propositional Calculus P1,Notas e Comunçaçoes de Matematica Recife35 (1971), 14 pp. [Reviewed by Newton C. A. da Costa in ZMG 238(1973), 23.]

    Google Scholar 

  787. See Mine and Hasegawa and Shimada (1971).

    Google Scholar 

  788. See Shoesmith and Smiley (1971).

    Google Scholar 

  789. D. J. Shoesmith and T. J. Smiley: Deducibility and Many-valuedness, The Journal of Symbolic Logic 36 (1971), 610–622. [Reviewed by Haskell B. Curry in MR 46 (1973), 4–5; by Alan Rose in ZMG 253 (1973), 15.]

    Google Scholar 

  790. Jerzy Słupecki: ‘Proof of Axiomatizability of Full Many-valued Systems of Calculus of Propositions,’ Studia Logica 29 (1971), 155–168. [Reviewed by Akira Nakamura in ZMG 247 (1973), 9.]

    Google Scholar 

  791. See Shoesmith and Smiley (1971).

    Google Scholar 

  792. See Smith and Vranesic and Janczewski (1971).

    Google Scholar 

  793. Kenneth C. Smith, Zvonko G. Vranesic and L. Janczewski: ‘Circuit Implementations of Multivalued Logic,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 133–139.

    Google Scholar 

  794. V. A. Sokolov: ‘Remarks on the Class of Partial Functions of Countably-valued Logic’ (Russian), Diskretynĭ Analiz 19(1971), 56–62. [Reviewed by G. Wechsung in MR 46 (1972), 873; by VI. Sotirov in ZMG 262 (1974), 11–12.]

    Google Scholar 

  795. See Cheung and Su (1971).

    Google Scholar 

  796. See Su and Cheung (1971).

    Google Scholar 

  797. Stephan Y. H. Su and Peter T. Cheung: ‘Computer-oriented Algorithm for Minimizing Multi-valued Switching Functions,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 140–152.

    Google Scholar 

  798. Stanisław J. Surma: Jaskowskis Matrix Criterion for the Intuitionistic Propositional Calculus, Zeszyty Naukowe Uniwersytetu Jagiellohskego, Prace z Logiki Zeszyt6 (1971), 21–54. [Reviewed by D. Nelson in MR 45 (1973), 583.]

    Google Scholar 

  799. See Ying and Susskind (1971).

    Google Scholar 

  800. See Nutter and Swartwout (1971).

    Google Scholar 

  801. Takahashi (1971 abstract). Moto-o Takahashi: ‘On the Consistency of the Comprehension Axiom in Continuous Logic,’ The Journal of Symbolic Logic 36 (1971), 358.

    Google Scholar 

  802. See Fujita and Kitahashi and Tanaka (1971).

    Google Scholar 

  803. See Kitahashi and Tanaka (1971).

    Google Scholar 

  804. S. F. Thelliez: ‘Problems Related to Ternary Sequential Switching Networks Synthesis,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 153–164.

    Google Scholar 

  805. P. S. Tien: ‘The Analysis and Synthesis of Fuzzy Switching Circuits,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 165–172.

    Google Scholar 

  806. See Tokarz and Wójcicki (1971).

    Google Scholar 

  807. Atwell R. Turquette: ‘Peirce’s ø and Ψ Operators for Triadic Logic,’ The Journal of Symbolic Logic 36 (1971), 365.

    Google Scholar 

  808. See Rescher and Urquhart (1971).

    Google Scholar 

  809. See Georgescu and Vraciu (1971).

    Google Scholar 

  810. See Hamacher and Vranesic (1971).

    Google Scholar 

  811. See Ayat and Vranesic (1971).

    Google Scholar 

  812. See Smith and Vranesic and Janczewski (1971).

    Google Scholar 

  813. N. Wirth: ‘The Programming Language PASCAL,’ Acta Informatica 1 (1971), 35–63.

    Google Scholar 

  814. See Tokarz and Wojcicki (1971).

    Google Scholar 

  815. See Wojcik and Metze (1971).

    Google Scholar 

  816. A. S. Wojcik and Gemot Metze: ‘Some Relationships Between Post and Boolean Algebras,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 173–182.

    Google Scholar 

  817. Peter W. Woodruff: ‘A New Approach to Possible Objects,’ The Journal of Symbolic Logic 36 (1971), 585.

    Google Scholar 

  818. See Preparata and Yeh (1971).

    Google Scholar 

  819. See Ying and Susskind (1971).

    Google Scholar 

  820. C. Ying and R. K. Susskind: ‘Building Blocks and Synthesis Techniques for the Realization of m-ary Combinational Switching Functions,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971), pp. 183–205.

    Google Scholar 

  821. See Zavisca and Allen (1971).

    Google Scholar 

  822. E. Zavisca and Charles M. Allen: ‘An Approach to Multiple-valued Sequential Circuit Synthesis,’ Conference Record of the 1971 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1971).

    Google Scholar 

  823. See Haga and Abe and Fukumura (1972).

    Google Scholar 

  824. See Asabe and Tezuka (1972).

    Google Scholar 

  825. See Asabe and Nakanishi and Tezuka (1972).

    Google Scholar 

  826. See Asabe and Nakanishi and Tezuka (1972a).

    Google Scholar 

  827. T. Asabe and Yoshikazu Tezuka: ‘Multilevel Balanced Code with Redundant Digits,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 7–16.

    Google Scholar 

  828. See Bell and Page and Thomason (1972).

    Google Scholar 

  829. N. Bell, E. W. Page and M. G. Thomason: ‘Extension of the Boolean Difference Concept to Multi-valued Logic Systems,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 17–24.

    Google Scholar 

  830. Robert Blanché: ‘Sur la trivalence,’ Logique et Analyse, n.s. 15 (1972), 569–582. [Registered in ZMG 264 (1974), 19.]

    Google Scholar 

  831. See Blochina and Kudrjavcev and Burosch (1972).

    Google Scholar 

  832. G. N. Blochina, Valeriĭ B. Kudrjavcev and G. Burosch: ‘Über gewisse Eigenschaften des Systems P,’ Mathematische Nachrichten, 54 (1972), 355–378. [Reviewed by the authors in ZMG 255 (1973), 16.]

    Google Scholar 

  833. See Bobrov and Žurkin (1972).

    Google Scholar 

  834. See Kudrjavcev and Burosch (1972).

    Google Scholar 

  835. See Blochina and Kudrjavcev and Burosch (1972).

    Google Scholar 

  836. See Su and Cheung (1972).

    Google Scholar 

  837. See Parks and Chidgey (1972).

    Google Scholar 

  838. See Patt and Cooper (1972).

    Google Scholar 

  839. See D’Amore and Matteuzzi (1972).

    Google Scholar 

  840. See De Lucca and Termini (1972).

    Google Scholar 

  841. See Ducasse and Metze (1972).

    Google Scholar 

  842. Edgar G. Ducasse and Gemot A. Metze: ‘A Generalized Equivalence Relation for Post Algebras,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 25–32.

    Google Scholar 

  843. George Epstein: ‘Application of Post and Generalized Post Algebras to Finite and Infinite Valued Switching Circuits,’ Computer 5 (1972), 64–68.

    Google Scholar 

  844. George Epstein: ‘Multiple-valued Signal Processing with Limiting,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple- valued Logic Design, State University of New York, Buffalo (1972), pp. 33–45.

    Google Scholar 

  845. See Epstein and Yamanaka (1972).

    Google Scholar 

  846. George Epstein and Hideki Yamanaka: ‘Tri-stable State Circuitry for Digital Computers,’ United States Patent 3,633,837, issued on May 16,1972.

    Google Scholar 

  847. See Foulk and Juelich (1972).

    Google Scholar 

  848. C. Foulk and O. Juelich: ‘Smooth Programs and Languages,’ Report OSU-CISRC-72–13, Department of Computer and Information Science, The Ohio State University, Columbus (1972).

    Google Scholar 

  849. Gideon Frieder: ‘Ternary Computers—Why and How,’ Proceedings of the Fifth Workshop on Microprogramming at Urbana, Illinois (1972).

    Google Scholar 

  850. See Fujita and Kitahashi and Tanaka (1972).

    Google Scholar 

  851. See Fujita and Kitahashi and Tanaka (1972a).

    Google Scholar 

  852. See Haga and Abe and Fukumura (1972).

    Google Scholar 

  853. George Georgescu: ‘Representation of Locally Finite and of Infinite Degree Polyadic Lukasiewicz Algebras’ (Roumanian), Studii si Cercetǎri Matematice 24 (1972), 1107–1117. [Reviewed by the author in ZMG 256 (1973), 20.]

    Google Scholar 

  854. See Haga and Abe and Fukumura (1972).

    Google Scholar 

  855. T. Haga, K. Abe and T. Fukumura: ‘A Problem in the Many-valued Threshold Logic and Its Solution,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communication Engineers of Japan 55-D (1974), 514–522.

    Google Scholar 

  856. See Vranesic and Hamacher (1972).

    Google Scholar 

  857. See Zaharova and Jablonskiĭ (1972).

    Google Scholar 

  858. See Foulk and Juelich (1972).

    Google Scholar 

  859. Edward Keenan: ‘On Semantically Based Grammar,’ Linguistic Inquiry 3 (1972), 413 - 461.

    Google Scholar 

  860. See Mizuno and Kimura (1972).

    Google Scholar 

  861. Robert Elefter Kirk: Intermediate Logics and Equational Classes of Brou- werian Algebras. Ph.D. dissertation: Massachusetts Institute of Technology, 1972.

    Google Scholar 

  862. See Fujita and Kitahashi and Tanaka (1972).

    Google Scholar 

  863. See Fujita and Kitahashi and Tanaka (1972a).

    Google Scholar 

  864. See Koukkunen and Ojala (1972).

    Google Scholar 

  865. H. Koukkunen and L. Ojala: ‘Some Applications of Many-valued Threshold Logic in Digital Arithmetic,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 46–64.

    Google Scholar 

  866. See Kudrjavcev and Burosch (1972).

    Google Scholar 

  867. See Blochina and Kudrjavcev and Burosch (1972).

    Google Scholar 

  868. Valeriĭ B. Kudrjavcev and G. Burosch: ‘Das Problem der Vollständigkeit für Boolesche Funktionen über zwei Dualmengen,’ Mathematische Nachrichten 54 (1972), 105–125. [Reviewed by the authors in ZMG 255 (1973), 16.]

    Google Scholar 

  869. Richard C. T. Lee: ‘Fuzzy Logic and the Resolution Principle,’ Journal of the Association for Computing Machines 19 (1972), 109–119. [Reviewed by Siegfried Gottwald in ZMG 245 (1973), 18.]

    Google Scholar 

  870. Vivien Leigh: ‘Self-dual Sets of Unary and Binary Connectives for the 3-valued Propositional Calculus,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 18 (1972), 201–204. [Reviewed by John T. Kearns in ZMG 249 (1973), 10.]

    Google Scholar 

  871. Maria Maduch: ‘A Definability Criterion for the Operations in Finite Łukasiewicz’s Implicational Matrices,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 1 no. 4 (1972), 15–17.

    Google Scholar 

  872. Maria Maduch: ‘A Definability Criterion for the Operations in Finite Łukasiewicz’s Implicational Matrices,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 1 no. 4 (1972), 15–17.

    Google Scholar 

  873. Larisa L. Maksimova: ‘Prjedtablicznyje superintuicjonistskije logiki,’ Algebra i Logika 11 (1972), 558–570. [English translation (‘Pretabular Superintuitionist Logic’) in Algebra and Logic 11 (1972), 308–314.] [Reviewed by M. Rogava in MR 48 (1974), 652–653.]

    Google Scholar 

  874. I. A. Mal’cev: ‘Congruences and Automorphisms in Cells of Post Algebras’ (Russian), Algebra i Logika 11 (1972), 666–672. [English translation in Algebra and Logic 11 (1972), 369–373.] [Reviewed by B. M. Schein in ZMG 281 (1975), 34–35.]

    Google Scholar 

  875. See Malinowski and Spasowski (1972).

    Google Scholar 

  876. Grzegorz Malinowski and Maciej Spasowski: ‘Dual Counterparts of Lukasiewicz Sentential Calculi,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 1 no. 3 (1972), 2–7.

    Google Scholar 

  877. Gerald J. Massey: ‘The Modal Structure of the Prior-Rescher Family of Infinite Product Systems,’ Notre Dame Journal of Formal Logic 13 (1972), 219–223. [Reviewed by the author in ZMG 193 (1972), 292.]

    Google Scholar 

  878. Pavel Materna: ‘Intensional Semantics of Vague Constants. An Appli­cation of Tichy’s Concept of Semantics,’ Theory and Decision 2 (1972), 267–273. [Re­viewed by the author in ZMG 241 (1973), 14.]

    Google Scholar 

  879. See D’Amore and Matteuzzi (1972).

    Google Scholar 

  880. See Ducasse and Metze (1972).

    Google Scholar 

  881. See Meyer and Parks (1972).

    Google Scholar 

  882. Robert K. Meyer and R. Zane Parks: ‘Independent Axioms for the Implicational Fragments of Sobocinski’s Three-valued Logic,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 18 (1972), 291–295. [Reviewed by Tsutomu Hosoi in ZMG 261 (1974), 20.].

    Google Scholar 

  883. See Mizumoto and Toyoda and Tanaka (1972).

    Google Scholar 

  884. M. Mizumoto, J. Toyoda and Kikochi Tanaka: ‘General Formulation of Formal Grammars,’ Information Sciences 4 (1972), 87.

    Google Scholar 

  885. See Mizuno and Kimura (1972).

    Google Scholar 

  886. Grigor Constantin Moisil: ‘Les ensembles flous et la logique à trois valeurs,’ printed in Moisil (1972), pp. 99–103.

    Google Scholar 

  887. Grigor Constantin Moisil: ‘Exemples de propositions a plusieurs valeurs,’ printed in Moisil (1972), pp. 149–156.

    Google Scholar 

  888. Grigor Constantin Moisil: ‘La logique des concepts nuancés,’ printed in Moisil (1972), pp. 157–163.

    Google Scholar 

  889. Grigor Constantin Moisil: ‘Le paradoxe du chauve et les logiques à plusieurs valeurs,’ printed in Moisil (1972), pp. 186–188.

    Google Scholar 

  890. Grigor Constantin Moisil: ‘Les axiomes des algebres de Lukasiewicz n-valentes,’ printed in Moisil (1972), pp. 298–310.

    Google Scholar 

  891. Grigor Constantin Moisil: ‘Sur les algèbres de Lukasiewicz θ-valentes,’ printed in Moisil (1972), pp. 311–324.

    Google Scholar 

  892. Grigor Constantin Moisil: ‘Sur le calcul des predicats dans la logique a trois valeurs,’ printed in Moisil (1972), pp. 442–454.

    Google Scholar 

  893. Luiz F. T. Monteiro: ‘Algèbre du calcul propositionnel trivalent de Heyting,’ Fundamenta Mathematicae 74 (1972), 99–109. [Reviewed by Newton C. A. da Costa in MR 45 (1973), 904; by A. I. Arruda in ZMG 248 (1973), 22.]

    Google Scholar 

  894. Claudio Moraga: ‘Non-linear Ternary Threshold Logic,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 65–74.

    Google Scholar 

  895. R. Mori: ‘On an Extended Threshold Logic as a Unit Cell of Array Logics,’ AFIPS Conference Proceedings, 1972 FJCC, Montvale, New Jersey (AFIPS Press), pp. 353–366.

    Google Scholar 

  896. Nobuyoshi Motohashi: ‘Some Investigations on Many Valued Logics,’ Proceedings of the Japan Academy 48 (1972), 59–61. [Reviewed by the author in ZMG 252 (1973), 10–11.]

    Google Scholar 

  897. J. C. Muzio: ‘On the t-closure of Martin,’ Mathematische Annalen 195 no. 5 (1972), 143–148. [Reviewed by Arto Salomaa in MR 45 (1973), 583–584; by the author in ZMG 216 (1971), 287.]

    Google Scholar 

  898. See Asabe and Nakanishi and Tezuka (1972).

    Google Scholar 

  899. See Asabe and Nakanishi and Tezuka (1972a).

    Google Scholar 

  900. Nguen Cat-Ho:’ ‘Generalized Algebras of Post and Their Applications to Infinitely Many-valued Logics with Infinitely Long Formulas,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 1 no. 1 (1972), 4–12.

    Google Scholar 

  901. Hirosato Nomura: ‘Learning of the Multi-threshold Function and Its Application to the Synthesis of Logical Function,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communication Engineers of Japan 55-D (1972), 194–210.

    Google Scholar 

  902. Hirosato Nomura: ‘Some Properties of Monotonicity on Many-valued Logic and Their Applications to the Analysis of Many-valued Threshold Functions,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communication Engineers of Japan 55-D (1972), 245–252.

    Google Scholar 

  903. R. S. Nutter: ‘The Algebraic Simplification of a Ternary Full Adder,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 75–82.

    Google Scholar 

  904. See Koukkunen and Ojala(1972).

    Google Scholar 

  905. See Ojala and Yrjola (1972).

    Google Scholar 

  906. L. Ojala and P. Yrjola: ‘Design of A/D Converters for Binary Coded Ternary Systems,’ Conference Record of the 1972 Symposium on the Theory and Applications of Mutiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 83–94.

    Google Scholar 

  907. Ono (1972). Hiroakira Ono: ‘Some Results on the Intermediate Logics,’ Publications of the Research Institute for the Mathematical Sciences, Kyoto University, Series A vol. 8 (1972), pp. 117–130. [Reviewed by Tsutomu Hosoi in ZMG 253 (1973), 17.]

    Google Scholar 

  908. M. Orsic: ‘Multiple-valued Universal Logic Modules,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 95–99.

    Google Scholar 

  909. See Bell and Page and Thomason (1972).

    Google Scholar 

  910. Biswambhar Pahi: ‘Maximal Full Matrices,’ Notre Dame Journal of Formal Logic 13 (1972), 142–144. [Reviewed by Alan Rose in MR 46 (1973), 1520; by the author in ZMG 188(1970), 12.]

    Google Scholar 

  911. Biswambhar Pahi: ‘A Method for Proving the Non-existence of Finite Characteristic Models for the Implicational Calculi,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (1972), 169–172. [Reviewed by B. Lercher in MR 46 (1973), 4; by M. D. Gladstone in ZMG 264 (1974), 22.]

    Google Scholar 

  912. R. Zane Parks: ‘A Note on R-Mingle and Sobocinski’s Three-valued Logic,’ Notre Dame Journal of Formal Logic 13 (1972), 227–228. [Reviewed by J. Michael Dunn in MR 45 (1973), 902.] Parks (1972a). See Parks and Chidgey (1972).

    Google Scholar 

  913. R. Zane Parks: ‘Dependence of Some Axioms of Rose,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (1972), 189–192. [Reviewed by Alan Rose in MR 48(1974), 15;by Alan Rose in ZMG 253(1973), 15.]

    Google Scholar 

  914. See Meyer and Parks (1972).

    Google Scholar 

  915. R. Zane Parks and John R. Chidgey: ‘Necessity and Ticket Entailment,’ Notre Dame Journal of Formal Logic 13 (1972), 224–226. [Reviewed by Robert K. Meyer in MR 45 (1972), 1216; by the authors in ZMG 212 (1971), 14.]

    Google Scholar 

  916. See Patt and Cooper (1972).

    Google Scholar 

  917. Y. N. Patt and G. A. Cooper: ‘Towards a Characterization of Logically Complete Switching Functions in k-valued Logic,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 100–103.

    Google Scholar 

  918. Eleonora Perkowska: ‘On Algorithmic m-valued Logic,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw, 1, no. 3 (1972), 28–37.

    Google Scholar 

  919. Eleonora Perkowska: ‘On Algorithmic m-valued Logics,’ Bulletin de. l’Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 20 (1972), 717–719. [Reviewed by W. Vollmerhaus in MR 48 (1974), 16.]

    Google Scholar 

  920. See Preparata and Yeh (1972).

    Google Scholar 

  921. F. P. Preparata and R. T. Yeh: ‘Continuously Valued Logic,’ Journal of Computer and Systems Sciences 6 (1972), 397–418. [Reviewed by Arto Salomaa in MR 47 (1968), 1438; by M. Mizumoto in ZMG 262 (1974), 12.]

    Google Scholar 

  922. Helena Rasiowa: ‘The Craig Interpolation Theorem for m-valued Pre­dicate Calculi,’ Bulletin de l’Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 20 (1972), 341–346. [Reviewed by Tsutomu Hosoi in ZMG 243(1973), 20.]

    Google Scholar 

  923. Helena Rasiowa : ‘On Logical Structure of Programs,’ Bulletin de l’Acadé­mie Polonaise des Sciences, Série des Mathématiques, Astronomiques et Physiques, 20 (1972), 319–324. [Reviewed by J. D. Rutledge in MR 48 (1974), 16.]

    Google Scholar 

  924. David C. Rine: ‘A Proposed Multi-valued Extension to ALGOL 68,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 104–125.

    Google Scholar 

  925. David C. Rine: ‘A Proposed Multi-valued Extension to ALGOL 68,’ Kybernetes 2 (1972), paper 52, pp. 1–5.

    Google Scholar 

  926. R. Roesser: ‘Multivalued Logic Techniques for Optical Computers,’Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 126–135.

    Google Scholar 

  927. Alan Rose: ‘Locally Full N0-valued Propositional Calculi,’ Zeitschrif für mathematische Logik und Grundlagen der Mathematik 18 (1972), 217–226. [Reviewed by Arto Salomaa in MR 46 (1973), 1522; by the author in ZMG 253 (1973), 16.]

    Google Scholar 

  928. I. Rowe: ‘The Generation of Gaussian-distributed Pseudorandom Noise Sequences from Multiple-valued Logic,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 136–152.

    Google Scholar 

  929. Zygmunt Saloni: ‘Gentzen Rules for the m-valued Logic,’ Bulletin de l’Académie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 20 (1972), 819–826. [Reviewed by John Corcoran in MR 47 (1974), 4; by Akira Nakamura in ZMG 255 (1973), 17.]

    Google Scholar 

  930. See Su and Sarris (1972).

    Google Scholar 

  931. Halina Savicka: ‘On Some Properties of Post Algebras with Countable Chain of Constants,’ Colloquium Mathematicum 25 (1972), 201–209. [Reviewed by Tadeusz Traczyk in ZMG 269 (1974), 26.]

    Google Scholar 

  932. J. T. Schwartz: On Programming an Interim Report on the SETL Project, Courant Institute of Mathematical Sciences, New York (Algorithms Press) 1972.

    Google Scholar 

  933. See Sebastian and Vranesic (1972).

    Google Scholar 

  934. P. Sebastian and Zvonko G. Vranesic: ‘Ternary Logic in Arithmetic Units,’ Conference Record of the 1972 Symposium on the Theory and Ap­plications of Multiple-valued Logic Design, Buffalo (1972), pp. 153–159.

    Google Scholar 

  935. L. Sintonen: ‘On the Realization of Functions in H-valued Logic’ IEEE Transactions on Computers C-21 (1972), 610–612.

    Google Scholar 

  936. Jerzy Slupecki: A Criterion of Fullness of Many-valued Systems of Propositional Logic, Studia Logica 30 (1972), 153–157. [An English translation of Siupecki (1939b).] [Reviewed by Arto Salomaa in MR 47 (1974), 1438.]

    Google Scholar 

  937. W. Smith: ‘Some Algebraic Properties and Minimization Techniques for Multi-valued Lattice Logics,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 163–174.

    Google Scholar 

  938. See Malinowski and Spasowski (1972).

    Google Scholar 

  939. James LeRoy Stiver: Presupposition, Implication, and Necessitation: A Critique of and Alternative to van Fraassens Presuppositional Logic. Ph.D. dissertation: University of North Carolina at Chapel Hill, 1972. Ann Arbor (University Microfilms) 1973.

    Google Scholar 

  940. M. Stojaković: ‘On the Exponential Properties of the Implication,’ Publications de I’Institut Mathematiques Beograd, n.s. 13 (27) (1972), 121‘125. [Reviewed by Ayda I. Arruda in ZMG 253 (1973), 13.]

    Google Scholar 

  941. See Su and Sarris (1972).

    Google Scholar 

  942. See Su and Cheung (1972).

    Google Scholar 

  943. Stephan Y. H. Su and Peter T. Cheung: ‘Computer Minimization of Multivalued Switching Functions,’ IEEE Transactions on Computers C-21 (1972), 995–1003.

    Google Scholar 

  944. Stephan Y. H. Su and Achilles A. Sarris: ‘The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement,’ IEEE Transactions on Computers C-21 (1972), 479–485. [Reviewed by H. Rohleder in ZMG 241 (1973), 13.]

    Google Scholar 

  945. Wojciech Suchoń: ‘On Non-equivalence of Two Definitions of the Algebras of Lukasiewicz,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 1 no. 1 (1972), 35–37.

    Google Scholar 

  946. Wojciech Suchoń: ‘Non-equivalence of Certain Definitions of Infinite Łukasiewicz Algebras,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wrocław 1 no. 2 (1972), 10–16.

    Google Scholar 

  947. Wojciech Suchoń: ‘Inequivalence des deux definitions des algèbres de Łukasiewicz,’ Zeszyty Naukowe Uniwersytetu Jagiellonskiego, Prace z Logiki Zeszyty 7(1972), 31–34. [Reviewed by M. Stojakovic in MR 47 (1974), 1130.]

    Google Scholar 

  948. Richard E. Swartwout: ‘The Combination of Soft and Multi-valued Algebra,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 175–180.

    Google Scholar 

  949. See Fujita and Kitahashi and Tanaka (1972).

    Google Scholar 

  950. See Fujita and Kitahashi and Tanaka (1972a).

    Google Scholar 

  951. See Mizumoto and Toyoda and Tanaka (1972).

    Google Scholar 

  952. A. A. Tarasov: ‘Certain Properties of the Essential Function of k-valued Logic’ (Russian), Diskretnyĭ Analiz 20 (1972), 66–78. [Reviewed by Arto Salomaa in MR 47(1974), 1438; by VI. Sotirovand ZMG262(1974), 11.]

    Google Scholar 

  953. See De Lucca and Termini (1972).

    Google Scholar 

  954. See Asabe and Tezuka (1972).

    Google Scholar 

  955. See Asabe and Nakanishi and Tezuka (1972).

    Google Scholar 

  956. See Asabe and Nakanishi and Tezuka (1972a).

    Google Scholar 

  957. See Bell and Page and Thomason (1972).

    Google Scholar 

  958. Marek Tokarz: ‘On Invariant Systems and Structural Completeness of Łukasiewicz’ Logics,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 1 no. 1 (1972), 63–68.

    Google Scholar 

  959. Marek Tokarz: ‘Invariant Systems of Lukasiewicz Calculi,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 1 no. 3 (1972), 44–48.

    Google Scholar 

  960. Marek Tokarz: ‘On Structural Completeness of Łukasiewicz’s Logics,’ Studia Logica 30 (1972), 53–61. [Reviewed by David C. Rine in MR 47 (1974), 834.]

    Google Scholar 

  961. Zivko Tošić: ‘Analytical Representations of m-valued Logical Functions Over the Ring of Integers modulo m’ Publications de la Faculté d’Electrotechnique de l’Univérsite à Belgrade, Série Matheématiques et Physique 410–411 (1972), 1–36. [Re­viewed by VI. Sotirov in ZMG 262 (1974), 11.]

    Google Scholar 

  962. See Mizumoto and Toyoda and Tanaka (1972).

    Google Scholar 

  963. Atwell R. Turquette: ‘Generalized Modal Sets,’ Zeitschrift fr mathe­matische Logik und Grundlagen der Mathematik 18 (1972), 261–266. [Reviewed by Arto Salomaa in MR 46 (1973), 1522; by the author in ZMG 245 (1973), 18–19.]

    Google Scholar 

  964. Dolph E. Ulrich: ‘Some Results Concerning Finite Models for Sentential Calculi,’ Notre Dame Journal of Formal Logic 13 (1972), 363–368. [Reviewed by J. Waszkiewicz in MR 46 (1973), 1520–1521; by the author in ZMG 212 (1971), 16–17.]

    Google Scholar 

  965. Dimitǎr I. Vakarelov: ‘Notes on the Semantics of the Łukasiewicz’s 3-valued Logic’ (Russian), Comptes Rendus de l’Acadǎmie Bulgare des Sciences 25 (1972), 1467–1469. [Reviewed by VI. Sotirov in ZMG 247 (1973), 8.]

    Google Scholar 

  966. Arnold Vander Nat: ‘Axiomatic, Sequenzen-kalkul, and Subordinate Proof Versions of S9,’ Notre Dame Journal of Formal Logic 13 (1972), 309–322. [Reviewed by the author in ZMG 231 (1972), 11.]

    Google Scholar 

  967. See Sebastian and Vranesic (1972).

    Google Scholar 

  968. See Vranesic and Hamacher (1972).

    Google Scholar 

  969. Zvonko G. Vranesic and V. C. Hamacher: ‘Ternary Logic in Parallel Multipliers,’ The Computer Journal 15 (1972), 254–258.

    Google Scholar 

  970. A. S. Wojcick: ‘The Minimization of Higher-order Boolean Functions,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 181–192.

    Google Scholar 

  971. Ryszard Wójcicki: ‘Some Properties of Strongly Finite Propositional Calculi,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 1 no. 1 (1972), 69–71.

    Google Scholar 

  972. Ryszard Wójcicki: ‘Some Results Concerning Many-valued Lukasiewicz Calculi,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 1 no. 3 (1972), 49–51.

    Google Scholar 

  973. Ryszard Wójcicki: ‘The Degree of Completeness of the Finitely-valued Propositional Calculi,’ Zeszyty Naukowe Uniwersytetu Jagiellońskiego, Prace z Logiki Zeszyt 7 (1972), 77–85. [Reviewed by K. Inoue in MR 47 (1974), 1438.]

    Google Scholar 

  974. Andrzej Wrónski: ‘An Algorithm for Finding Finite Axiomatizations of Finite Intermediate Logics,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wrocław 1 no. 1 (1972), 38–44.

    Google Scholar 

  975. Andrzej Wrónski: ‘An Algorithm for Finding Finite Axiomatizations of Finite Intermediate Logics,’ Zeszyty Naukowe Uniwersytetu Jagiellonskiego, Prace z Logiki Zeszyt 7 (1972), 87–92. [Reviewed by M. Stojaković in MR 47 (1974), 1444.]

    Google Scholar 

  976. See Epstein and Yamanaka (1972).

    Google Scholar 

  977. See Preparata and Yeh (1972).

    Google Scholar 

  978. See Ojrala and Yrjola (1972).

    Google Scholar 

  979. E. Ju. Zaharova: ‘Realization of a Function from Pk by Formulae (k ≥ 3)’ (Russian), Matematičeskie Zametki 11 (1972), 99–108. [English translation in Mathematical Notes 11 (1972), 62–69.] [Reviewed by J. Kunztmann in MR 45 (1973), 584; by VI. Sotirov in ZMG 268 (1974), 13.]

    Google Scholar 

  980. See Zaharova and Jablonskiĭ (1972).

    Google Scholar 

  981. E. Zavisca: ‘Multiple-valued Combinational Function Synthesis Using a Single Gate Type,’ Conference Record of the 1972 Symposium on the Theory and Applications of Multiple-valued Logic Design, State University of New York, Buffalo (1972), pp. 193–201.

    Google Scholar 

  982. See Bobrov and Zurkin (1972).

    Google Scholar 

  983. See Aibara and Takamatsu and Murakami (1973).

    Google Scholar 

  984. T. Aibara, Y. Takamatsu and K. Murakami: ‘Multiple-valued Variable-threshold Logic and Its Application to the Realization of the Set of Boolean Functions,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 8–15.

    Google Scholar 

  985. See Mattrey and Givone and Allen (1973).

    Google Scholar 

  986. Charles M. Allen: ‘Coordinate Representation and Structural Invariants for Many-valued Switching Functions,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 16–28.

    Google Scholar 

  987. See Bellman and Giertz (1973).

    Google Scholar 

  988. Paweł Bielak: ‘The Degree of Completeness of Gödel’s Logic,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 2 (1973), 134–138.

    Google Scholar 

  989. See Moraga and Bittner (1973).

    Google Scholar 

  990. See Blochina and Kudrjavcev and Burosch (1973).

    Google Scholar 

  991. See Blochina and Kudrjavcev and Burosch (1973a).

    Google Scholar 

  992. G. N. Blochina, Valeriĭ B. Kudrjavcev and G. Burosch: ‘Ein Vollständigkeitskriterium bis auf eine gewisse Äquivalenzrelation fur eine verallgemeinerte Postsche Algebra,’ Publicationes Mathematicae 20 (1973), 141–152. [Reviewed by Valeriĭ B. Kudrjavcev in ZMG 282 (1975), 17.]

    Google Scholar 

  993. G. N. Blochina, Valeriĭ B. Kudrjavcev and G. Burosch: ‘Über verallgemeinerte Postsche Algebren,’ Mitteilungen der Mathematischen Gesellschaft der Deutschen Demokratischen Republik (1973), no. 2/3 (1973), 5–11. [Reviewed by the authors in ZMG 275 (1975), 25.]

    Google Scholar 

  994. See Bobrov and Koc (1973).

    Google Scholar 

  995. A. E. Bobrov and V. S. Koc: ‘Minimization of Functions of a Many-valued Logic Which are Defined Through the Maximum, the Minimum and All One-place Functions’ (Russian), Avtomatika i Vyčislitel’nà Tehnika 4 (1973), 36–37. [Registered in ZMG 258 (1974), 14.]

    Google Scholar 

  996. See Brady and Routley (1973).

    Google Scholar 

  997. Ross T. Brady and Richard Routley: ‘Don’t Care was Made to Care,’ Australian Journal of Philosophy 51 (1973), 211–225.

    Google Scholar 

  998. See Breuer and Epstein (1973).

    Google Scholar 

  999. M. A. Breuer and George Epstein: ‘The Smallest Many-valued Logic for Treatment of Complemented and Uncomplemented Error Signal,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 29–37.

    Google Scholar 

  1000. See Blochina and Kudrjavcev and Burosch (1973).

    Google Scholar 

  1001. See Blochina and Kudrjavcev and Burosch (1973a).

    Google Scholar 

  1002. See Cabanes and Pichat (1973).

    Google Scholar 

  1003. A. Cabanes and E. Pichat: ‘Minimal Representation of a Function of Several Finite Variables—Applications to Data Bank,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 237–238.

    Google Scholar 

  1004. See Frieder and Fong and Chao (1973).

    Google Scholar 

  1005. P. F. Curran: ‘Obtaining Self-testing Logic Through the Application of Threshold Logic and an A. C. Logic Code,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 38–48.

    Google Scholar 

  1006. See D’Amore and Matteuzzi (1973).

    Google Scholar 

  1007. Bruno D’Amore and Maurizio L. M. Matteuzzi: ‘Considerazioni strutturali sugli insiemi indecidibili,’ Bollettino della Unione Matematica Italiana, Serie IV 8 (1973), 537–546. [Reviewed by D. Rosenzweig in ZMG 282 (1975), 17–18.]

    Google Scholar 

  1008. J. R. Donaldson: ‘Structured Programming,’ Datamation 19, no. 12 (1973), 52–54.

    Google Scholar 

  1009. Jean Drabbe: ‘Sur la représentation des algebres de Post,’ Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, série A 276 (1973), 337–338. [Reviewed by J. S. Johnson in ZMG 255 (1973), 34.]

    Google Scholar 

  1010. See Druzeta and Sedra (1973).

    Google Scholar 

  1011. A. Druzeta and A. S. Sedra: ‘Multi-threshold Circuits in the Design of Multi-state Storage Elements,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 49–58.

    Google Scholar 

  1012. See DuCasse and Metze (1973).

    Google Scholar 

  1013. Edgar G. DuCasse and Gemot A. Metze: ‘Hazard Realizations of Boolean Functions Using Post Functions,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 59–67.

    Google Scholar 

  1014. Michael A. E. Dummett: Frege: Philosophy of Language. London (Duckworth) 1973. [Reviewed by Leslie Stevenson in The Philosophical Quarterly 24, 349–359.]

    Google Scholar 

  1015. See Dzik and Wronski (1973).

    Google Scholar 

  1016. Wojciech Dzik and Andrzej Wronski: ‘Structural Completeness of Godel’s and Dummett’s Propositional Calculi, Studia Logica 32 (1973), 69–75.

    Google Scholar 

  1017. G. Englebretsen: ‘Suggested Truth-tables for a Three-valued Sentential Logic,’ International Logic Review no. 4 (1973), 255–257.

    Google Scholar 

  1018. George Epstein: ‘An Equational Axiomatization for the Disjoint System of Post Algebras,’ IEEE Transactions on Computers C-21 (1973), 422–423. [Reviewed by the author in ZMG 252 (1973), 22.]

    Google Scholar 

  1019. George Epstein: ‘Comments on “The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement’,” IEEE Transactions on Computers C-22 (1973), 864.

    Google Scholar 

  1020. See Breuer and Epstein (1973).

    Google Scholar 

  1021. N. M. Ermolaeva: ‘On Logics Which Are Similar to Hao Wang’s Calculus’ (Russian), Naučno-Tehniceskaà Informacià, Serià 2 (1973) no. 8, pp. 34–37. [Reviewed by VI. Sotirov in ZMG 273 (1974), 8.]

    Google Scholar 

  1022. See Frieder and Fong and Chao (1973).

    Google Scholar 

  1023. Marc Fort: ‘Calcul des prédicats trivalent,’ Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, série A 276 (1973), 1257–1260.

    Google Scholar 

  1024. Marc Fort: ‘Deduction en logique trivalente,’ Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, série A 277 (1973), 823–825. [Reviewed by Alasdair Urquhart in MR 48 (1974), 652; by Tsutomu Hosoi in ZMG 281 (1975), 20.]

    Google Scholar 

  1025. See Frieder and Fong and Chao (1973).

    Google Scholar 

  1026. Gideon Frieder, A. Fong and C. Y. Chao: ‘A Balanced Ternary Computer,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 68–88.

    Google Scholar 

  1027. See Mine and Fujita (1973).

    Google Scholar 

  1028. See Bellman and Giertz (1973).

    Google Scholar 

  1029. See Mattrey and Givone and Allen (1973).

    Google Scholar 

  1030. See Goddard and Routley (1973).

    Google Scholar 

  1031. Leonard Goddard and Richard Routley: The Logic of Significance and Context. Volume 1. Edinburgh (Scottish Academic Press) 1973 and New York (Halsted Press) 1973. [Reviewed by H. A. Lewis in Philosophical Books 16 (1975), 15–17.]

    Google Scholar 

  1032. V. V. Gorlov: ‘On Congruences in Closed Post Classes’ (Russian), Mate­matičeskie Zametki 13 (1973), 725–734. [Reviewed by Elliott Mendelson in ZMG 261 (1974), 28.]

    Google Scholar 

  1033. Siegfried Gottwald: ‘Über Einbettungen in Zahlenbereiche einer mehrwertigen Mengenlehre,’ Mathematische Nachrichten 56 (1973), 43–46. [Reviewed by the author in ZMG 263 (1974), 20–21.]

    Google Scholar 

  1034. See Green and Kelsch (1973).

    Google Scholar 

  1035. D. H. Green and R. G. Kelsch: ‘Nonlinear Ternary Feedback Shift Registers,’ Computer Journal 16 (1973), 360–367. [Reviewed by the authors in ZMG 269 (1974), 547.]

    Google Scholar 

  1036. R. S. Grigolia: ‘Algebraiczeskij analiz n-znachnych logiczeskich sistem Łukasiewicza-Tarkskogo,’ Proceedings of Tbilisi University, A 6–7 (149-150), Mathe­matical and Natural Sciences, Tbilisi (1973), pp. 121–132.

    Google Scholar 

  1037. Grize (1973). Jean-Blaise Grize: Logique moderne. Fasc. III: Implications-modalités, logiques polyvalentes, logique combinatoire, ontologie et méréologie de Leśniewski. Mathematiques et sciences de l–homme. XXII. Paris (Mouton/Gauthier-Villars) 1973. 104 pp. [Reviewed by Phan Dinh Dieu in ZMG 279 (1974), 15.]

    Google Scholar 

  1038. D. Hampel: ‘Multifunction Threshold Gates,’ IEEE Transactions on Computers C-22(1973), 197–203.

    Google Scholar 

  1039. See Hampel and Micheel and Prost (1973).

    Google Scholar 

  1040. D. Hampel, L. Micheel and K. Prost: ‘Threshold Logic Multiplier,’ NAECON ’73 Record (1973), pp. 288–295.

    Google Scholar 

  1041. Hans G. Herzberger: ‘Dimensions of Truth,’ Journal of Philosophical Logic 2 (1973), 535–556.

    Google Scholar 

  1042. See Imamiya and Noguchi and Oizumi (1973).

    Google Scholar 

  1043. A. Imamiya, S. Noguchi and J. Oizumi: ‘Ternary Threshold Logic Networks Realizing Three-valued Multithreshold Function,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communication Engineers of Japan 65-D (1973), 333–340.

    Google Scholar 

  1044. See Irving and Nagle (1973).

    Google Scholar 

  1045. T. A. Irving and H. T. Nagle, Jr.: ‘An Approach to Multi-valued Sequential Logic,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 89–105.

    Google Scholar 

  1046. L. J. Janczewski: ‘Geometrical Approach to Multivalued Logic Function Synthesis,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 106–118.

    Google Scholar 

  1047. A. Kaniel: ‘Trilogic, a Three-level Logic System Provides Greater Memory Density,’ EDN April 1973, pp. 80–83.

    Google Scholar 

  1048. See Green and Kelsch (1973).

    Google Scholar 

  1049. See Bobrov and Koc (1973).

    Google Scholar 

  1050. See Blochina and Kudrjavcev and Burosch (1973).

    Google Scholar 

  1051. See Blochina and Kudrjavcev and Burosch (1973a).

    Google Scholar 

  1052. Valeriĭ B. Kudrjavcev: ‘On Properties of S-systems of Functions of k-valued Logic’ (Russian), Elektronische Informationsverarbeitung und Kybernetik 9 (1973), 81–105. [Reviewed by the author in ZMG 275 (1974), 25.]

    Google Scholar 

  1053. George Lakoff: ‘Hedges: A Study in Meaning Criteria and the Logic of Fuzzy Concepts,’ Journal of Philosophical Logic 2 (1973), 458-508. [Reviewed by E. Melis in ZMG 271 (1974), 29–30.]

    Google Scholar 

  1054. H. El Lozy: ‘On the Generation of All the One Variable Functions in m-valued Logic,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 119–126.

    Google Scholar 

  1055. Grzegorz Malinowski: ‘MVk Algebras,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 2 (1973), 185–191.

    Google Scholar 

  1056. See D’Amore and Matteuzzi (1973).

    Google Scholar 

  1057. See Mattrey and Givone and Allen (1973).

    Google Scholar 

  1058. R. F. Mattrey, Donald D. Givone and Charles M. Allen: ‘Applying Multiple-valued Algebra Concepts to Neural Modeling,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 127–136.

    Google Scholar 

  1059. Maydole (1973). Robert Edwin Maydole: Many-valued Logic as a Basis for Set Theory. Ph.D. dissertation: Boston University, 1973. Ann Arbor (University Microfilms) 1973.

    Google Scholar 

  1060. See DuCasse and Metze (1973).

    Google Scholar 

  1061. See Hampel and Micheel and Prost (1973).

    Google Scholar 

  1062. See Muzio and Miller (1973).

    Google Scholar 

  1063. See Mine and Fujita (1973).

    Google Scholar 

  1064. Hisashi Mine and S. Fujita: ‘Decomposition of Multi-valued Switching Functions and Its Application to Threshold Networks,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communi­cation Engineers of Japan 56-D (1973), 691–725.

    Google Scholar 

  1065. Toru Miyama: ‘Another Proof of Gill’s Interpolation Theorem,’ Science Reports of the Tokyo Kyoiku Daigaku, section A, 12 (1973), 59–65. [Reviewed by John Thomas Canty in ZMG 279 (1974), 16.]

    Google Scholar 

  1066. See Popov and Skibenko and Mokljak (1973).

    Google Scholar 

  1067. See Moraga and Bittner (1973).

    Google Scholar 

  1068. Claudio Moraga and A. Bittner: A Ternary Positional Automatic Control System,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 137–155.

    Google Scholar 

  1069. See Aibara and Takamatsu and Murakami (1973).

    Google Scholar 

  1070. J. C. Muzio: ‘The Cosubstitution Condition,’ Notre Dame Journal of Formal Logic 14 (1973), 87–94. [Reviewed by Charles G. Morgan in MR 48 (1974), 652; by the author in ZMG 197 (1971), 274.]

    Google Scholar 

  1071. J. C. Muzio: ‘Some Large Classes of n-valued Sheffer Functions,’ Pro­ceedings of the Cambridge Philosophical Association 74 (1973), 201–211. [Reviewed by Alan Rose in ZMG 266 (1974), 14; by R. L. Graham in MR 48 (1974), 1017.]

    Google Scholar 

  1072. See Muzio and Miller (1973).

    Google Scholar 

  1073. J. C. Muzio and D. M. Miller: ‘Decomposition of Ternary Switching Functions,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 156–165.

    Google Scholar 

  1074. See Irving and Nagle (1973).

    Google Scholar 

  1075. Nguen Cat-Ho: ‘Generalized Post Algebras and Their Application to Some Infinitary Many-valued Logics,’ Dissertationes Mathematicae 107 (1973). 72 pp. [Reviewed by Tsutomu Hosoi in ZMG 281 (1975), 34.]

    Google Scholar 

  1076. See Imamiya and Noguchi and Oizumi (1973).

    Google Scholar 

  1077. Hirosato Nomura: ‘Characteristic Vectors of Many-valued Logical Functions and Their Applications to the Realization of Many-valued Threshold Functions,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communication Engineers of Japan 56-D (1973), 17–24.

    Google Scholar 

  1078. See Imamiya and Noguchi and Oizumi (1973).

    Google Scholar 

  1079. See Ojala and Yrjola (1973).

    Google Scholar 

  1080. L. Ojala and P. Yrjola: ‘Design of Incremental Signal Processing Devices Using Binary Coded Ternary Logic,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 228–236.

    Google Scholar 

  1081. M. Orsic: ‘Incremental Curve Generation Using Multiple-valued Logic,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 166–172.

    Google Scholar 

  1082. Biswambhar Pahi: ‘Necessity and Some Non-modal Propositional Calculi,’ Notre Dame Journal of Formal Logic 14 (1973), 401–404. [Reviewed by the author in ZMG 258 (1974), 14.]

    Google Scholar 

  1083. Giinther Patzig: ‘Aristotle, Łukasiewicz and the Origins of Many-valued Logic,’ Logic, Methodology and Philosophy of Science IV, Proceedings of the Fourth International Congress of Logic, Methodology and Philosophy of Science, Bucharest, 1971, edited by Patrick Suppes, Leon Henkin, Athanase Juja and Grigor Constantin Moisil, Amsterdam (North-Holland Publishing Company) 1973, pp. 921–929.

    Google Scholar 

  1084. See Cabanes and Pichat (1973).

    Google Scholar 

  1085. See Popov and Skibenko and Mokljak (1973).

    Google Scholar 

  1086. V. A. Popov, I. T. Skibenko and N. G. Mokljak: ‘On the Number of Types of Systems of k-valued Logical Functions’ (Russian), Kibér­nétika (1973) no. 6, pp. 18–27. [Reviewed by VI. Sotirov in ZMG 281 (1975), 20.]

    Google Scholar 

  1087. V. N. Porus: ‘On an Analytic Manner of Presentation of Many-valued Matrices’ (Russian), Teorià logičeskogo vyvoda, edited by P. V. Tavanec, Moscow (Izdatel’stvo “Nauka”) 1973, pp. 253–258. [Registered in ZMG 263 (1974), 15.]

    Google Scholar 

  1088. R. Pöschel: ‘Postsche Algebren von Funktionen iiber einer Familie endlicher Mengen,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 19 (1973), 37–74. [Reviewed by B. M. Schein in ZMG 274 (1974), 34–35.]

    Google Scholar 

  1089. R. Pöschel: ‘Postsche Algebren von Funktionen über einer Familie endlicher Mengen,’ Mitteilungen der Mathematischen Gesellschaft der Deutschen Demokratischen Republik (1973), no. 2/3, pp. 111–118. [Reviewed by R. S. Pierce in ZMG 273 (1974), 18.]

    Google Scholar 

  1090. See Hampel and Micheel and Prost (1973).

    Google Scholar 

  1091. Helena Rasiowa: ‘On a Logical Structure of Mixed-valued Programs and the ω+-valued Algorithmic Logic, Bulletin de l’Académie Polonaise de Sciences, Série des Sciences Mathematiques, Astronomiques et Physiques 21 (1973), 451–458.

    Google Scholar 

  1092. Helena Rasiowa: ‘On Generalized Post Algebras of Order ω+ and ω+-valued Predicate Calculi,’ Bulletin de l’Académie Polonaise de Sciences, Série des Sciences Mathematiques, Astronomiques et Physiques 21 (1973), 209–219. [Reviewed by A. Tauts in MR 47 (1974), 834; by John T. Canty in ZMG 261 (1974), 20–21.]

    Google Scholar 

  1093. David C. Rine: ‘Basic Concepts of Multiple-discrete Valued Logic and Deci­sion Theory,’ Information and Control 22 (1973), 320–352. [Reviewed by the author in ZMG 255 (1973), 15–16.]

    Google Scholar 

  1094. David C. Rine: ‘Conditional and Post Algebra Expressions,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 173–191.

    Google Scholar 

  1095. David C. Rine: Conditional and Post Algebra Expressions, Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 173–191.

    Google Scholar 

  1096. Alan Rose: ‘Sur certains ‘Erweiterter Aussagenkalkiil’ dont le seul quantificateur primitif constitue son dual,’ Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, série A 277 (1973), 559–561. [Reviewed by Alasdair Urquhart in MR 48 (1974), 652; by the author in ZMG 266 (1974), 14.]

    Google Scholar 

  1097. Alan Rose: ‘Note sur l’“Erweiterter Aussagenkalkul” ayant un seul quantificateur primitif,’ Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, série A 277 (1973), 641–643. [Reviewed by Alasdair Urquhart in MR 48 (1974), 652; by the author in ZMG 266 (1974), 15.]

    Google Scholar 

  1098. See Goddard and Routley (1973).

    Google Scholar 

  1099. See Brady and Routley (1973).

    Google Scholar 

  1100. Imre Ruzsa: ‘Prior-type Modal Logic I,’ Periodica Mathematica Hungarica 4 (1973), 51–69. [Reviewed by the author in ZMG 264 (1974), 22.]

    Google Scholar 

  1101. Zygmunt Saloni: ‘The Sequent Gentzen System for m-valued Logic,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 2 (1973), 30–37.

    Google Scholar 

  1102. Edward Schuh: ‘Many-valued Logics and the Lewis Paradoxes,’ Notre Dame Journal of Formal Logic 14 (1973), 250–252. [Reviewed by Alan Rose in MR 48 (1974), 16.]

    Google Scholar 

  1103. Dana Scott: ‘Background to Formalization,’ Truth, Syntax and Modality, Proceedings of the Temple University Conference on Alternative Semantics, edited by Hugues Leblanc, Amsterdam (North-Holland Publishing Company) 1973, pp. 244–273.

    Google Scholar 

  1104. See Druzeta and Sedra (1973).

    Google Scholar 

  1105. Michel Serfati: ‘Sur les polynômes postiens,’ Comptes Rendus Hebdomadaires des Séances de l’Académie des Sciences, série A 276 (1973), 677–679.

    Google Scholar 

  1106. D. A. Sheppard: ‘An Application of Many-valued Logic to Fault Detection,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 192–204.

    Google Scholar 

  1107. See Shoesmith and Smiley (1973 abstract).

    Google Scholar 

  1108. D. J. Shoesmith and Timothy J. Smiley: ‘Proofs with Multiple Conclusions,’ The Journal of Symbolic Logic 38 (1973), 547.

    Google Scholar 

  1109. See Popov and Skibenko and Mokljak (1973).

    Google Scholar 

  1110. See Shoesmith and Smiley (1973 abstract).

    Google Scholar 

  1111. Wojciech Suchoń: ‘Application of the Theory of Logical Matrices in the Independence Proofs,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 2 (1973), 121–126.

    Google Scholar 

  1112. Wojciech Suchoń: ‘On Defining Moisil’s Functors in n-valued Lukasiewicz Propositional Logic,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 2 (1973), 195–196.

    Google Scholar 

  1113. Stanislaw J. Surma: ‘A Method of the Construction of Łukasiewiczian Algebras and Its Application to Gentzen-style-characterization of Łukasiewiczian Logics,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wrocław 2 (1973), 139–143.

    Google Scholar 

  1114. Stanislaw J. Surma: ‘Jaśkowski’s Matrix Criterion for the Intuitionistic Propositional Calculus,’ Studies in the History of Mathematical Logic, Wrocfaw-Warszawa-Krakow-Gdansk (Ossolineum) 1973, pp. 87–121.

    Google Scholar 

  1115. Stanislaw J. Surma: ‘Nota w sprawie twierdzeń o dedukcji nie wprost ważnych w skończenie wielwartościonych rachunkach zdan Łukasiewicza’ (A note on indirect deduction theorems valid in Łukasiewicz’s finitely-valued propositional calculi), Studia Logica 31 (1973), 139–143. [Reviewed by the author in ZMG 267 (1974), 16–17.]

    Google Scholar 

  1116. Władsyław Szczech: ‘Axiomatizability of Finite Matrices,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 2 (1973), 118–120.

    Google Scholar 

  1117. See Aibara and Takamatsu and Murakami (1973).

    Google Scholar 

  1118. S. F. Thelliez: Introduction à l’etude des structures ternaires de commutation. Paris (Gordon and Breach) 1973.

    Google Scholar 

  1119. D. Tsichritzis: ‘Approximate Logic,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 205–216.

    Google Scholar 

  1120. Alasdair Ian Fenton Urquhart: The Semantics of Entailment. Ph.D. dissertation: University of Pittsburgh, 1973. Ann Arbor (University Microfilms) 1973.

    Google Scholar 

  1121. Alasdair Urquhart: ‘An Interpretation of Many-valued Logic,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 19 (1973), 111–114. [Reviewed by David C. Rine in MR 47 (1974), 274–275.]

    Google Scholar 

  1122. A. S. Wojcick: ‘Multi-valued Asynchronous Circuits,’ Conference Record of the 1973 International Symposium on Multiple-valued Logic, University of Toronto, Toronto (1973), pp. 217–227.

    Google Scholar 

  1123. Ryszard Wójcicki: ‘On Matrix Representations of Consequence Opera­tions of Łukasiewicz Sentential Calculi,’ Zeitschrift für mathematische Logik und Grund­lagen der Mathematik 19 (1970), 239–247. [Reviewed by M. Stojakovic in MR 48 (1974), 340.]

    Google Scholar 

  1124. Czesław Wojtkiewicz: ‘Axiomatization of Finite n-algebras by the Method of T. Hosoi,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wrocław 2 (1973), 144–148.

    Google Scholar 

  1125. See Dzik and Wronski (1973).

    Google Scholar 

  1126. See Ojala and Yrjola (1973).

    Google Scholar 

  1127. G Abraham: ‘Variable Radix Multistable Integrated Circuits,’ Computer 7 no. 9 (1974), 42–59.

    Google Scholar 

  1128. See Takamatsu and Murakami and Aibara (1974).

    Google Scholar 

  1129. John G. Anderson: ‘A Note on Finite Intermediate Logics,’ Notre Dame Journal of Formal Logic 15 (1974), 149–155. [Reviewed by the author in ZMG 236 (1972), 23.]

    Google Scholar 

  1130. See Birk and Farmer (1974).

    Google Scholar 

  1131. J. E. Birk and D. E. Farmer: ‘Design of Multivalued Combina­tional Switching Circuits Using Principally Binary Components,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 115–134.

    Google Scholar 

  1132. Rainer Bodendiek: ‘Über das Repräsentantenproblem in der k-wertigen Logik,’ Mathematisch-Physikalische Semesterberichte, neue Folge 21 (1974), 46–66. [Reviewed by L. Kaluznin in ZMG 285 (1975), 12–13.]

    Google Scholar 

  1133. See Ostapko and Cain and Hong (1974).

    Google Scholar 

  1134. John R. Chidgey: On Entailment. A Consideration of Some of the Formal Properties of the Anderson and Belnap System E of Entailment and of Related Systems. Ph.D. dissertation: Victoria University of Manchester, 1974.

    Google Scholar 

  1135. See Das and Chuang (1974).

    Google Scholar 

  1136. John P. Cleave: ‘The Notion of Logical Consequence in the Logic of Inexact Predicates,’ Zeitschrift für mathematische Logik und Grundlagen der Mathematik 20 (1974), 307–324.

    Google Scholar 

  1137. Kenneth W. Collier: ‘A Result of Extending Bochvars 3-valued Logic,’ Notre Dame Journal of Formal Logic 15 (1974), 344–346. [Reviewed by the author in ZMG 236 (1972), 20.]

    Google Scholar 

  1138. B. Dahn: ‘Kripke-style Semantics for Some Many-valued Propositional Calculi,’ Bulletin de lAcadémie Polonaise des Sciences, Série des Sciences Mathématiques, Astronomiques et Physiques 22 (1974), 99–102. [Reviewed by VI. Sotirov in ZMG 281 (1975), 20–21.]

    Google Scholar 

  1139. See Das and Chuang (1974).

    Google Scholar 

  1140. Santanu Das and Henry Y. H. Chuang: ‘On the Design of Reliable and Fail-safe, Digital Systems Using Multiple-valued Logic,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgan- town (1974), pp. 183–206.

    Google Scholar 

  1141. Robert L. Davis: ‘Uniform Shift Networks,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 225–260.

    Google Scholar 

  1142. See Vranesic and Smith and Druzeta (1974).

    Google Scholar 

  1143. Edgar D. DuCasse: ‘Synthesizing Operators Defined on a Class of Decision Algebras from Post Functions,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 79–94.

    Google Scholar 

  1144. Se Su and DuCasse (1974).

    Google Scholar 

  1145. See Epstein and Frieder and Rine (1974).

    Google Scholar 

  1146. See Epstein and Horn (1974).

    Google Scholar 

  1147. See Epstein and Horn (1974a).

    Google Scholar 

  1148. See Epstein and Frieder and Rine (1974a).

    Google Scholar 

  1149. George Epstein, Gideon Frieder and David C. Rine: ‘The Development of Multiple-valued Logic as Related to Computer Science,’ Computer 1 no. 9 (1974), 20–32.

    Google Scholar 

  1150. George Epstein, Gideon Frieder and David C. Rine: ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 303–314.

    Google Scholar 

  1151. George Epstein and Alfred Horn: ‘Propositional Calculi Based on Subresiduation,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 3 no. 1 (1974), 41–42.

    Google Scholar 

  1152. George Epstein and Alfred Horn: ‘Finite Limitations on a Propositional Calculus for Affirmation and Negation,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 3 no. 1 (1974), 43–44.

    Google Scholar 

  1153. See Etiemble and Israel (1974).

    Google Scholar 

  1154. Daniel Etiemble and Michel Israel: ‘A New Concept for Ternary Logic Elements,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 437–456.

    Google Scholar 

  1155. John Evenden: ‘Generalized Logic,’ Notre Dame Journal of Formal Logic 15 (1974), 35–44. [Reviewed by the author in ZMG 202 (1971), 7–8.]

    Google Scholar 

  1156. See Birk and Farmer (1974).

    Google Scholar 

  1157. Victor K. Finn: ‘A Criteria of Functional Completeness for B3,’ Studia Logica (1914), 121–126.

    Google Scholar 

  1158. See Epstein and Frieder and Rine (1974).

    Google Scholar 

  1159. See Epstein and Frieder and Rine (1974a).

    Google Scholar 

  1160. See Goldberg and Leblanc and Weaver (1974).

    Google Scholar 

  1161. H. Goldberg, H Leblanc and G Weaver: ‘A Strong Completeness Theorem for 3-valued Logic,’ Notre Dame Journal of Formal Logic 15 (1974), 325–330. [Reviewed by the authors in ZMG 232 (1972), 13.]

    Google Scholar 

  1162. See Graczynska and Wroński (1974).

    Google Scholar 

  1163. Ena Graczyńska and Andrzej Wroński: ‘On the Construction of Matrices Strongly Adequate for the Pre-finite Logic,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wrocław 3 no. 2 (1974), 15–18

    Google Scholar 

  1164. See Moraga and Gutierrez (1974).

    Google Scholar 

  1165. See Gutierrez and Moraga (1974).

    Google Scholar 

  1166. Jorge Gutierrez and Claudio Moraga: ‘Multithreshold Periodic Ternary Threshold Logic,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 413–422.

    Google Scholar 

  1167. See Ostapko and Cain and Hong (1974).

    Google Scholar 

  1168. See Epstein and Horn (1974).

    Google Scholar 

  1169. See Epstein and Horn (1974a).

    Google Scholar 

  1170. See Etiemble and Israel (1974).

    Google Scholar 

  1171. See Mouftah and Jordan (1974).

    Google Scholar 

  1172. Abraham Kandel: ‘Fuzzy Representation, CNF Minimization and Their Application to Fuzzy Transmission Structures,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 361–380.

    Google Scholar 

  1173. See Kang and Shen (1974).

    Google Scholar 

  1174. Andy N. C. Kang and Stewart N. T. Shen: ‘On the Boolean Functions Over 4-element Boolean Algebra,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 381–392.

    Google Scholar 

  1175. Lauri Karttunen: ‘Presuppositions of Compound Sentences,’ Linguistic Inquiry 4 (1973), 169–193.

    Google Scholar 

  1176. See Kodandapani and Setlur (1974).

    Google Scholar 

  1177. K. L. Kodandapani and Rangaswamy V. Setlur: ‘Multivalued Algebraic Generalizations of Reed-Muller Canonical Forms,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 505–527.

    Google Scholar 

  1178. Ladislav Kohout: ‘The Pinkava Many-valued Complete Logic Systems and Their Applications in the Design of Many-valued Switching Circuits,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 261–284.

    Google Scholar 

  1179. Valeriĭ B. Kudrjavcev: ‘On the Functional System PΣ’ (Russian), Žurnal Vyčislitel’noi Matematiki i Matematičeskoi Fiziki14 (1974), 198–208. [Reviewed by the author in ZMG 282 (1975), 547–548.]

    Google Scholar 

  1180. See Lam and Vranesic (1974).

    Google Scholar 

  1181. C. I. Lam and Zvonko G. Vranesic: ‘Multiple-valued Pseudorandom Number Generators,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 45–58.

    Google Scholar 

  1182. See Goldberg and Leblanc and Weaver (1974).

    Google Scholar 

  1183. A. Lempicki: ‘A New Look at Optical Logic,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgan-town (1974), pp. 207–208.

    Google Scholar 

  1184. John Loader: ‘A Method for Finding Formulae Corresponding to First Order Universal Decision Elements in m-valued Logic,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (1974), 1–12.

    Google Scholar 

  1185. Grzegorz Malinowski: ‘S-algebras for n-valued Sentential Calculi of Łukasiewicz,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 3 no. 2 (1974), 25–30.

    Google Scholar 

  1186. Grzegorz Malinowski: ‘S-algebras and the Degrees of Maximality for Three and Four Valued Logics of Łukasiewicz,’ Studia Logica 33 (1974), 359–370.

    Google Scholar 

  1187. Grzegorz Malinowski: ‘Degrees of Maximality of Some Łukasiewicz Logics,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 3 no. 3 /4 (1974), 27–33.

    Google Scholar 

  1188. See Malinowski and Spasowski (1974).

    Google Scholar 

  1189. Grzegorz Malinowski and Maciej Spasowski: ‘Dual Counterparts of Łukasiewicz Sentential Calculi,’ Studia Logica 33 (1974), 153–162.

    Google Scholar 

  1190. Antoine Marquetty: ‘Generalized Many-valued Logics,’ The Journal of Symbolic Logic 39 (1974), 419.

    Google Scholar 

  1191. See McDonald and Singh (1974).

    Google Scholar 

  1192. J. F. McDonald and Inder Singh: ‘Extensions of the Weiner—Smith Algorithm for m-ary Synchronous Sequential Circuit Design,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 135–154.

    Google Scholar 

  1193. R. S. Michalski: ‘Variable-valued Logic,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgan-town (1974), pp. 323–340.

    Google Scholar 

  1194. See Miller and Muzio (1974).

    Google Scholar 

  1195. D. M. Miller and J. C. Muzio: ‘A Ternary Cellular Array,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 469–482.

    Google Scholar 

  1196. See Nazarala and Moraga (1974).

    Google Scholar 

  1197. See Moraga and Gutierrez (1974).

    Google Scholar 

  1198. See Gutierrez and Moraga (1974).

    Google Scholar 

  1199. Claudio Moraga and Jorge Gutierrez: ‘Critical Races in Fundamental Mode Ternary Sequential Machines,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 401–412.

    Google Scholar 

  1200. Charles G. Morgan: ‘Resolution in Many-valued Logics,’ The Journal of Symbolic Logic 39 (1974), 199–200.

    Google Scholar 

  1201. ohn M. Motil: ‘A Multiple-valued Digital “Saturation” System,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 483–492.

    Google Scholar 

  1202. See Mouftah and Jordan (1974).

    Google Scholar 

  1203. H. T. Mouftah and I. B. Jordan: ‘Integrated Circuits for Ternary Logic,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 285–302.

    Google Scholar 

  1204. See Takamatsu and Murakami and Aibara (1974).

    Google Scholar 

  1205. See Miller and Muzio (1974).

    Google Scholar 

  1206. See Shiva and Nagle (1974).

    Google Scholar 

  1207. See Nazarala and Moraga (1974).

    Google Scholar 

  1208. Jorge Nazarala and Claudio Moraga: ‘Minimal Realization of Ternary Threshold Functions,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 347–361.

    Google Scholar 

  1209. See Ostapko and Cain and Hong (1974).

    Google Scholar 

  1210. Daniel L. Ostapko, Robert G. Cain and Se June Hong: ‘A Practical Approach to Two-level Minimization of Multivalued Logic,’ Proceedings of the International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 168–182.

    Google Scholar 

  1211. Biswambhar Pahi: ‘On the Non-existence of Finite Characteristic Models for Some Classes of Implicational Calculi,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (1974), 113–119.

    Google Scholar 

  1212. See Porębska and Wroǹski (1974).

    Google Scholar 

  1213. M. T. Porębska and Andrzej Wroǹski: ‘A Characterization of the Fragments of the Intuitionistic Propositional Logic,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 3 no. 2 (1974), 19–20.

    Google Scholar 

  1214. Dhiraj K. Pradhan: ‘A Multivalued Switch Algebra Based on Finite Fields,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 95–112.

    Google Scholar 

  1215. Tadeusz Prucnal: ‘Interpretations of Classical Sentential Calculus in Nonclassical Implicational Calculi,’ Studia Logica 33 (1974), 59–64.

    Google Scholar 

  1216. Juliusz Reichbach: ‘Partitions in Decidability and Generalized Models with Many Valued Codes,’ Proceedings of the 1974 International Symposium on Multiple- valued Logic, West Virginia University, Morgantown (1974), pp. 113–114.

    Google Scholar 

  1217. David C. Rine: ‘There is More to Boolean Algebra Than You Would Have Thought,’ Reports on Mathematical Logic no. 2 (1974), pp. 25–37.

    Google Scholar 

  1218. See Epstein and Frieder and Rine (1974).

    Google Scholar 

  1219. David C. Rine: ‘Multiple-valued Logic and Computer Sciences in the 20th Century,’ Computer 1 no. 9 (1974), 18–19.

    Google Scholar 

  1220. See Epstein and Frieder and Rine (1974a).

    Google Scholar 

  1221. Ivo G. Rosenberg: ‘Completeness, Closed Classes and Relations in Multiple-valued Logics,’ Proceedings of the 1974 International Symposium on Multiple- valued Logic, West Virginia University, Morgantown (1974), pp. 1–26.

    Google Scholar 

  1222. Arto Salomaa: ‘Some Remarks Concerning Many-valued Propositional Logics,’ Logical Theory and Semantic Analysis. Essays Dedicated to Stig Kanger on His Fiftieth Birthday, edited by Sören Stenlund, Dordrecht ( D. Reidel Publishing Company ) 1974, pp. 15–22.

    Google Scholar 

  1223. Kenneth A. Seeskin: ‘Some Remarks on Truth and Bivalence,’ Logique et Analyse, n.s. 17 (1974), 101–109.

    Google Scholar 

  1224. See Kodandapani and Setlur (1974).

    Google Scholar 

  1225. See Kang and Shen (1974).

    Google Scholar 

  1226. See Shiva and Nagle (1974).

    Google Scholar 

  1227. S. G. Shiva and H. T. Nagle, Jr.: ‘On Multiple-valued Memory Elements,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 209–224.

    Google Scholar 

  1228. See McDonald and Singh (1974).

    Google Scholar 

  1229. See Vranesic and Smith (1974).

    Google Scholar 

  1230. See Vranesic and Smith and Druzeta (1974).

    Google Scholar 

  1231. William R. Smith, III: ‘Minimization of Multivalued Functions,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 27–44.

    Google Scholar 

  1232. See Malinowski and Spasowski (1974).

    Google Scholar 

  1233. Udo J. Strasillo: ‘A Multiple-valued Memory System Using Capacitor Storage,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 457–468.

    Google Scholar 

  1234. See Su and DuCasse (1974).

    Google Scholar 

  1235. Stephan Y. H. Su and Edgar G. DuCasse: ‘Application of a Multi-valued Gate to the Design of Fault-tolerant Digital Systems,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 423–436.

    Google Scholar 

  1236. Wojciech Suchoń: ‘La méthode de Smullyan de construire le calcul n-valent de Łukasiewicz avec implication et négation,’ Reports on Mathematical Logic no. 2 (1974), 37–42. [Reviewed by the author in ZMG 284 (1975), 16.]

    Google Scholar 

  1237. Suchoń (1974a). Wojciech Suchoń: ‘Définition des foncteurs modaux de Moisil dans le calcul n-valent des propositions de Łukasiewicz avec implication et negation,’ Reports on Mathematical Logic no. 2 (1974), pp. 43–47. [Reviewed by the author in ZMG 284(1975), 16–17.]

    Google Scholar 

  1238. Wojciech Suchoń: ‘Matrix Lukasiewicz Algebras,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wrocław 3 no. 3 /4 (1974), 9–16.

    Google Scholar 

  1239. SJ. Surma: ‘A Method of the Construction of Finite Łukasiewiczian Algebras and Its Application to a Gentzen-stile Characterization of Finite Logics,’’ Reports on Mathematical Logic no. 2 (1974), 49–54. [Reviewed by the author in ZMG 282(1975), 16.]

    Google Scholar 

  1240. See Surma and Wroński and Zachorowski (1974).

    Google Scholar 

  1241. Stanisław J. Surma: ‘An Algorithm for Axiomatizing Every Finite Logic,’ Reports on Mathematical Logic no. 3 (1974), 57–61.

    Google Scholar 

  1242. Stanislaw J. Surma: ‘An Algorithm for Axiomatizing Every Finite Logic,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 315–327.

    Google Scholar 

  1243. Stanisław J. Surma, Andrzej Wroǹski and S. Zachorowski: ‘On Jaśkowski-type Semantics for the Intuitionistic Propositional Logic,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 3 no. 2 (1974), 6–10.

    Google Scholar 

  1244. See Takamatsu and Murakami and Aibara (1974).

    Google Scholar 

  1245. Y. Takamatsu, K. Murakami and T. Aibara: ‘Isobaricity for a Set of Multiple-valued Logical Functions and Its Application to the Synthesis of Multithreshold Elements,’ Electronics and Communications in Japan, The Transactions of the Institute of Electronics and Communication Engineers of Japan 57-D (1974), 534–541.

    Google Scholar 

  1246. Marek Tokarz: ‘Binary Functions Definable in Implicational Gödel Algebras,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 3 no. 1 (1974), 22–24.

    Google Scholar 

  1247. Marek Tokarz: ‘A Method of Axiomatization of Lukasiewicz Logics,’ Bulletin of the Section of Logic, Polish Academy of Sciences, Institute of Philosophy and Sociology, Wroclaw 3 no. 2 (1974), 21–24.

    Google Scholar 

  1248. Marek Tokar.: ‘A New Proof of ‘Topographic’ Theorem on Łukasiewicz’s Logics,’ Reports on Mathematical Logic no. 3 (1974), 63–66.

    Google Scholar 

  1249. Marek Tokarz: ‘Invariant Systems of Lukasiewicz Calculi,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (1974), 221–228.

    Google Scholar 

  1250. Dolph E. Ulrich: ‘Subsystems of S6, and a Conjecture of Prior’s,’ The Journal of Symbolic Logic 39 (1974), 200.

    Google Scholar 

  1251. Bas C. van Fraassen: ‘The Labyrinth of Quantum Logics,’ Logical and Epistemological Studies in Contemporary Physics, edited by Robert S. Cohen and Marx W. Wartofsky, Dordrecht (D. Reidel Publishing Company) 1974, pp. 224–254.

    Google Scholar 

  1252. See Vranesic and Smith (1974).

    Google Scholar 

  1253. See Lam and Vranesic (1974).

    Google Scholar 

  1254. See Vranesic and Smith and Druzeta (1974).

    Google Scholar 

  1255. Zvonko G. Vranesic and Kenneth C. Smith: ‘Engineering Aspects of Multi-valued Logic Systems,’ Computer 7 no. 9 (1974), 34–41.

    Google Scholar 

  1256. Zvonko G. Vranesic, Kenneth C. Smith and A. Druzeta: ‘Electronic Implementation of Multi-valued Logic Networks,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 59–78.

    Google Scholar 

  1257. Syozo Watanabe: ‘Many-valued Prosthetics,’ The Journal of Symbolic Logic 39 (1974), 409–410.

    Google Scholar 

  1258. See Goldberg and Leblanc and Weaver (1974).

    Google Scholar 

  1259. T. C. Wesselkamper: ‘A Note on UDEs in an n-valued Logic,’ Notre Dame Journal of Formal Logic 15 (1974), 485–486. [Reviewed by the author in ZMG 272 (1974), 21.]

    Google Scholar 

  1260. T. C. Wesselkamper: ‘Some Completeness Results for Abelian Semigroups and Groups,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 393–400.

    Google Scholar 

  1261. Bruce White: ‘A Note on Natural Deduction in Many-valued Logic,’ Notre Dame Journal of Formal Logic 15 (1974), 167–168. [Reviewed by the author in ZMG 246 (1973), 16.]

    Google Scholar 

  1262. J. E. Wiredu: ‘A Remark on a Certain Consequence of Connexive Logic for Zermelo’s Set Theory,’ Studia Logica 33 (1974), 127–130.

    Google Scholar 

  1263. Anthony S. Wójcick: ‘Multi-valued Asynchronous Sequential Circuits,’ Proceedings of the 1974 International Symposium on Multiple-valued Logic, West Virginia University, Morgantown (1974), pp. 155–167.

    Google Scholar 

  1264. Ryszard Wójcicki: ‘Note on Deducibility and Many-valuedness,’ The Journal of Symbolic Logic 39 (1974), 563–566.

    Google Scholar 

  1265. Ryszard Wójcicki: ‘Matrix Approach in Methodology of Sentential Calculi,’ Studia Logica 32 (1974), 7–39.

    Google Scholar 

  1266. Ryszard Wójcicki: ‘The Logics Stronger Than Łukasiewicz’s Three Valued Sentential Calculus. The Notion of Degree of Maximality Versus the Notion of Degree of Completeness,’ Studia Logica 33 (1974), 201–214.

    Google Scholar 

  1267. Ryszard Wójcicki: ‘Degree of Maximality Versus Degree of Completeness,’ Bulletin of the Section of Logic, Polish Academy of Sciences, The Institute of Philosophy and Sociology, Wrocław 3 no. 2 (1974), 41–43.

    Google Scholar 

  1268. Peter W. Woodruff: ‘A Constructive Lukasiewiczian Logic,’ The Journal of Symbolic Logic 39 (1974), 390.

    Google Scholar 

  1269. Peter W. Woodruff: ‘A Modal Interpretation of Three-valued Logic,’ Journal of Philosophical Logic 3 (1974), 433–440.

    Google Scholar 

  1270. John Woods: The Logic of Fiction. A Philosophical Sounding of Deviant Logics. The Hague (Mouton) 1974.

    Google Scholar 

  1271. Andrzej Wroński: ‘On Equivalentiai Fragments of Some Intermediate Logics,’ Bulletin of the Section of Logic, Polish Academy of Sciences, The Institute of Philosophy and Sociology, Wroclaw 3 no. 2 (1974), 11–14.

    Google Scholar 

  1272. See Surma and Wroński and Zachorowski (1974).

    Google Scholar 

  1273. See Graczynska and Wroński (1974).

    Google Scholar 

  1274. See Porębska and Wroński (1974).

    Google Scholar 

  1275. Andrzej Wroński: ‘On Cardinalities of Matrices Strongly Adequate for the Intuitionistic Propositional Logic,’ Reports on Mathematical Logic, no. 3 (1974), 67–72.

    Google Scholar 

  1276. See Surma and Wronski and Zachorowski (1974).

    Google Scholar 

  1277. See Anderson and Belnap (1975).

    Google Scholar 

  1278. Alan Ross Anderson and Nuel D. Belnap, Jr.: Entailment. The Logic of Relevance and Necessity. Volume 1. Princeton (Princeton University Press) 1975.

    Google Scholar 

  1279. See Anderson and Belnap (1975).

    Google Scholar 

  1280. See DuCasse and Metze (1975).

    Google Scholar 

  1281. Edgar G. DuCasse and Gemot A. Metze: “Comments on ‘The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement’,” IEEE Transactions on Computers C-24 (1975), 220.

    Google Scholar 

  1282. Susan Haack: Deviant Logic. New York (Cambridge University Press) 1975.

    Google Scholar 

  1283. See DuCasse and Metze (1975).

    Google Scholar 

  1284. See Su and Sarris (1975).

    Google Scholar 

  1285. See Su and Sarris (1975).

    Google Scholar 

  1286. Stephan Y. H. Su and Achilles A. Sarris: ‘Authors’ Reply,’ IEEE Transactions on Computers C-24 (1975), 220–221.

    Google Scholar 

  1287. T. C. Wesselkamper: ‘A Sole Sufficient Operator,’Notre Dame Journal of Formal Logic 16 (1975), 86–88. [Reviewed by the author in ZMG 245 (1973), 18.]

    Google Scholar 

  1288. Robert J. Ackermann: ‘Matrix Satisfiability and Axiomatization,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 184 (1970), 280.]

    Google Scholar 

  1289. See Anderson and Belnap and Meyer (197 +).

    Google Scholar 

  1290. Alan Ross Anderson, Nuel D. Belnap, Jr. and Robert K. Meyer: Entailment. The Logic of Relevance and Necessity. Volume 2. Princeton (Princeton University Press).

    Google Scholar 

  1291. R. Beazer: ‘Post-like Algebras and Injective Stone Algebras,’ Algebra Universalis.

    Google Scholar 

  1292. R. Beazer: ‘Compactness in Abstractions of Post Algebras,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 283 (1975), 25.]

    Google Scholar 

  1293. See Humberstone and Bell (197 +).

    Google Scholar 

  1294. See Anderson and Belnap and Meyer (197 +).

    Google Scholar 

  1295. Leon Birnbaum: ‘Tripolar Algebra and Logic,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 253 (1973), 15.]

    Google Scholar 

  1296. Ross T. Brady: ‘Significance Logics,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 226 (1972), 16.]

    Google Scholar 

  1297. Ross T. Brady: ‘Significance Range Theory,’ Notre Dame Journal of Formal Logic.

    Google Scholar 

  1298. E. William Chapin, Jr.: ‘Set-valued Set Theory. I,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 236 (1972), 34.]

    Google Scholar 

  1299. E. William Chapin, Jr.: ‘Set-valued Set Theory. II,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 236 (1972), 34.]

    Google Scholar 

  1300. See Druzeta and Vranesic and Sedra (197 +).

    Google Scholar 

  1301. A. Druzeta, Zvonko G. Vranesic and A. Sedra: ‘Application of Multi-threshold Elements in the Realization of Many-valued Logic Networks,’ IEEE Transactions on Computers.

    Google Scholar 

  1302. George Epstein: ‘The Extension of FSR’s to FSCR’s for p ≥ 2.

    Google Scholar 

  1303. See Epstein and Horn (197 +).

    Google Scholar 

  1304. See Epstein and Horn (197 +a).

    Google Scholar 

  1305. See Epstein and Horn (197 +b).

    Google Scholar 

  1306. George Epstein: Decisive Implication.

    Google Scholar 

  1307. George Epstein: From Fixed to Mixed Radix.

    Google Scholar 

  1308. George Epstein and Alfred Horn: ‘P-algebras, an Abstraction From Post Algebras,’ Algebra Universalis.

    Google Scholar 

  1309. George Epstein and Alfred Horn: ‘Chain Based Lattices,’ Pacific Journal of Mathematics.

    Google Scholar 

  1310. George Epstein and Alfred Horn: ‘Logics Which are Characterized by Subresiduated Lattices,’ Zeitschrift fur mathematische Logik und Grundlagen der Mathematik.

    Google Scholar 

  1311. John Evenden: ‘Generalized Logic. II,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 283 (1975), 16.]

    Google Scholar 

  1312. George Georgescu: ‘The θ-valued Lukasiewicz Algebras. IV.’

    Google Scholar 

  1313. George Georgescu: ‘Monadic and Polyadic Lukasiewicz Algebras,’

    Google Scholar 

  1314. See Georgescu and Vraciu (197 +).

    Google Scholar 

  1315. George Georgescu and Constantin Vraciu: ‘La dualite des algèbres de Post θ-valentes,’ Journal of Algebra.

    Google Scholar 

  1316. Hans G. Herzberger: ‘Setting Russell Free.’

    Google Scholar 

  1317. See Epstein and Horn (197 +).

    Google Scholar 

  1318. See Epstein and Horn (197 +a).

    Google Scholar 

  1319. See Epstein and Horn (197 +b).

    Google Scholar 

  1320. See Hosoi and Ono (197 +).

    Google Scholar 

  1321. Tsutomu Hosoi and Hiroakira Ono: ‘Intermediate Propositional Logics (A Survey),’ Journal ofTsuda College.

    Google Scholar 

  1322. See Humberstone and Bell (197+).

    Google Scholar 

  1323. I. L. Humberstone and J. M. Bell: ‘Two Systems of Presupposition Logic,’ Notre Dame Journal of Formal Logic. [Reviewed by the authors in ZMG 254 (1973), 16 and in ZMG 283 (1975), 17.]s

    Google Scholar 

  1324. Dieter Klaua: ‘Zur Arithmetik mehrwertiger Zahlen,’ Mathematische Nachrichten. [Reviewed by the author in ZMG 251 (1973), 31.]

    Google Scholar 

  1325. Hugues Leblanc: ‘A Strong Completeness Theorem for 3-valued Logic. II,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 283 (1975), 16.]

    Google Scholar 

  1326. Robert P. McArthur: ‘Three-valued Free Tense Logic,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 245 (1973), 20.]

    Google Scholar 

  1327. Robert K. Meyer: Coherence Revisited.

    Google Scholar 

  1328. See Anderson and Belnap and Meyer (197 +).

    Google Scholar 

  1329. Charles G. Morgan: ‘Local and Global Operators and Many-valued Modal Logics,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 283(1975), 17.]

    Google Scholar 

  1330. See Hosoi and Ono (197 +).

    Google Scholar 

  1331. Richard L. Purtill: ‘Paradox-free Deontic Logics,’ Notre Dame Journal of Formal Logic.

    Google Scholar 

  1332. Helena Rasiowa: ‘Post Algebras as a Semantic Foundation of Many-valued Logic,’ MAA Studies in Mathematics.

    Google Scholar 

  1333. Richard Routley: ‘Universal Semantics?,’ Journal of Philosophical Logic.

    Google Scholar 

  1334. Richard Routley: ‘No Rational Sentential Logic Has a Finite Characteristic Matrix,’ Logique et Analyse.

    Google Scholar 

  1335. Dana Scott: ‘Completeness and Axiomatizability in Many-valued Logic,’ Tarski Symposium, Princeton (American Mathematical Society).

    Google Scholar 

  1336. See Druzeta and Vranesic and Sedra (197 +).

    Google Scholar 

  1337. Paul Vincent Spade: ‘An Alternative to Brian Skyrms Approach to the Liar,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 258 (1974), 10-11.]

    Google Scholar 

  1338. Wojciech Suchon: ‘Matrix Łukasiewiczian Algebras,’ Reports on Mathematical Logic.

    Google Scholar 

  1339. Saburo Tamura: ‘A Sequential Formulation for Sobociński’s Three-valued Logic,’ Proceedings of the International Conference on Relevance Logics. In Memoriam: Alan Ross Anderson, edited by Kenneth W. Collier and Robert G. Wolf.

    Google Scholar 

  1340. Dolph E. Ulrich: ‘The Nonexistence of Finite Characteristic Matrices for Subsystems of R1,’ Proceedings of the International Conference on Relevance Logics. In Memoriam: Alan Ross Anderson, edited by Kenneth W. Collier and Robert G. Wolf.

    Google Scholar 

  1341. See Georgescu and Vraciu (197 +).

    Google Scholar 

  1342. See Druzeta and Vranesic and Sedra (197 +).

    Google Scholar 

  1343. Alan C. Wilde: ‘Generalizations of the Distributive and Associative Laws,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 245 (1973), 17.]

    Google Scholar 

  1344. Alan C. Wilde: ‘A Substitution Property,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 254 (1973), 15.]

    Google Scholar 

  1345. R. L. Wilson: ‘On Some Modal Logics Related to the Ł-modal System,’ Notre Dame Journal of Formal Logic. [Reviewed by the author in ZMG 214 (1971), 10]

    Google Scholar 

Abdugaliev, V. A

  • Abdugaliev, V. A., (1967) ‘Normal Forms of k-valued Logic’ (Russian).

    Google Scholar 

  • Abdugaliev, V. A., (1969) ‘On the Question of the Representation of Functions of a k-valued Logic by a Normal Form. I’ (Russian).

    Google Scholar 

  • Abdugaliev, V. A., (1970) ‘On the Question of the Representation of Functions of a k-valued Logic by a Normal Form. II. Selection of the Simple Parts of a Pair (A, B) When (LA, LB) = 0 and L a Lb. Construction of the Reduced Disjunctive Normal Form’ (Russian).

    Google Scholar 

Abe, K

  • Abe, K., (1972) ‘A Problem in the Many-valued Threshold Logic and Its Solution’ (With T. Haga and T. Fukumura).

    Google Scholar 

Abian, Alexander

  • Abian, A., (1967) ‘Some Generalized Sheffer Functions’ (with Samuel La Macchia). (1967a) ‘Examples of Generalized Sheffer Functions’ (with Samuel La Macchia).

    Google Scholar 

Abraham, George

  • Abraham, G., (1974) ‘Variable Radix Multistable Integrated Circuits’.

    Google Scholar 

Ackermann, Robert J

  • Abraham, R. J., (1967) An Introduction to Many-valued Logics. ‘Matrix Satisfiability and Axiomatization’.

    Google Scholar 

Adži-Veli, Ja. H

  • Adži-Veli, J. H., (1966) ‘An Application of the Blake-Poreckii Method to the Minimization of the Functions of a Many-valued Logic’ (Russian).

    Google Scholar 

Again, J

Aibara, T

  • Aibara, T., (1973) ‘Multiple-valued Variable-Threshold Threshold Logic and Its Application to the Realization of the Set of Boolean Functions’ (with Y. Takamatsu and K. Murakami).

    Google Scholar 

  • Aibara, T., (1974) ‘Isobaricity for a Set of Multiple-valued Logical Functions and Its Application to the Synthesis of Multithreshold Elements’ (with Y. Takamatsu and K. Murakami).

    Google Scholar 

Aĭzenberg, N. N

  • Aĭzenberg, N. N., (1965) ‘Representation of a Sum mod m in a Class of Normal Forms of Functions of ra-valued Logic’ (Russian).

    Google Scholar 

  • Aĭzenberg, N. N., (1968) Polinomialnye predstavlenia funktsii K-značnoi logiki polinomam nad koltsam klassov vyčetov po mod K (The Representations of Functions of k-valued Logic by Polynomials mod k).

    Google Scholar 

Alekseev, V. B

  • Alekseev, V. B., (1969) ‘The Simple Bases of a k-valued Logic’ (Russian).

    Google Scholar 

  • Alekseev, V. B., (1971) ‘Simple Bases and Simple Functions in k-valued Logic’ (Russian).

    Google Scholar 

  • Alekseev, V. B., (1971a) ‘On the Number of Simple Bases in a k-valued Logic’ (Russian).

    Google Scholar 

Alexander, W

  • Alexander, W., (1960) ‘An Introduction to the Ternary Code Number System’ (with D. J. Morris).

    Google Scholar 

Allen, Charles M

  • Allen, C. M., (1968) ‘A Minimization Technique for the Multiple-valued Logic Systems’ (with Donald D. Givone).

    Google Scholar 

  • Allen, C. M., (1971) ‘An Approach to Multiple-valued Sequential Circuit Synthesis’ (with E. Zavisca).

    Google Scholar 

  • Allen, C. M., (1973) ‘Applying Multiple-valued Algebra Concepts to Neural Modeling’ (with R. F. Mattrey and Donald D. Givone).

    Google Scholar 

  • Allen, C. M., (1973a) ‘Coordinate Representation and Structural Invariants for Many-valued Switching Functions’.

    Google Scholar 

Aloisio, Pantaleo

  • Aloisio, P., (1971) ‘Alcune osservazioni sull definibilita di operatori finiti e sulla decidibilità al- goritmica della completezza fuzionale e deduttiva delle logiche a più valori’.

    Google Scholar 

Anderson, Alan Ross

  • Anderson, A. R., (1954) ‘On the Interpretation of a Modal System of Łukasiewicz’.

    Google Scholar 

  • Anderson, A. R., (1975) Entailment. The Logic of Relevance and Necessity. Volume 1 (with Nuel D. Belnap, Jr.).

    Google Scholar 

  • Anderson, A. R., (197 +) Entailment. The Logic of Relevance and Necessity. Volume 2 (with Nuel D. Belnap, Jr. and Robert K. Meyer).

    Google Scholar 

Anderson, D. J

  • Anderson, D. J., (1971) ‘A Magnetic Ternary Device’ (with D. L. Dietmeyer). Anderson, John G.

    Google Scholar 

  • Anderson, D. J., (1971) ‘The Degree of Completeness of Dummett’s LC and Thomas’ LCn’

    Google Scholar 

  • Anderson, D. J., (1974) ‘A Note on Finite Intermediate Logics’.

    Google Scholar 

Angell, Richard Bradshaw

  • Angell, R. B., (1971 abstract) ‘Connexive Implication, Modal Logic and Subjunctive Conditionals’.

    Google Scholar 

Applebee, Ralph C

  • Applebee, R. C., (1971) ‘Some Results on Generalized Truth-tables’ (with Biswambhar Pahi).

    Google Scholar 

Arango, H

  • Arango, H., (1964) ‘On the Analysis and Synthesis of 3-valued Digital Systems’ (with J. Santos).

    Google Scholar 

  • Arango, H., (1965) ‘A Ternary Storage Element Using a Conventional Ferrite Core’ (with J. Santos and M. Pascual).

    Google Scholar 

  • Arango, H., (1966) ‘Threshold Implementation of Ternary Systems’ (with M. Pascual, M. E. Valentinuzzi and J. Santos).

    Google Scholar 

  • Arango, H., (1970) ‘A Cyclic Algebra for the Synthesis of Ternary Digital Systems’ (with J. Santos and M. Pascual and G. Roing).

    Google Scholar 

Asabe, T

  • Asabe, T., (1972) ‘Multilevel Balanced Code with Redundant Digits’ (with Yohikazu Tezuka).

    Google Scholar 

  • Asabe, T., (1972a) ‘On Cyclic Multilevel Codes’ (with H. Nakanishi and Yoshikazu Tezuka).

    Google Scholar 

  • Asabe, T., (1972b) ‘Spectral Density of Cyclic Multilevel Code’ (with H. Nakanishi and Yoshikazu Tezuka).

    Google Scholar 

Asenjo, F. G

Ataka, H

  • Ataka, H., (1972) ‘On the Definition of Ternary Threshold Functions’.

    Google Scholar 

  • Ataka, H., (1972a) ‘On the Unateness of Ternary Functions’.

    Google Scholar 

Ayat, K. A

  • Ayat, K. A., (1971) ‘Application of Multi-valued Cyclic Codes’ (with Zvonko G. Vranesic).

    Google Scholar 

Backus, J. W

  • Backus, J. W., (1955) ‘The Syntax and Semantics of the Proposed International Algebraic Language of the Zurich ACM-GAMM Conference’.

    Google Scholar 

Bădele, I

  • Bădele, I., (1969) ‘Sur les extensions des algèbres de Lukasiewicz’ (with Vlad Boicescu).

    Google Scholar 

Badillo, M. C

  • Badillo, M. C., (1961) ‘Many-valued Logics of Systems’ (Spanish).

    Google Scholar 

Bailey, J. S

  • Bailey, J. S., (1962) ‘Single Function Shifting Counters’ (with George Epstein).

    Google Scholar 

  • Bailey, J. S., (1966) ‘Generalized Single-ended Counters’.

    Google Scholar 

Baĭramov, R. A

  • Baĭramov, R. A., (1967) ‘K voprosu o funktsionalnoi polnosti v mnogoznachinykh logikakh’ (On the Question of Functional Completeness in Many-valued Logic).

    Google Scholar 

  • Baĭramov, R. A., (1967a) ‘O funktsiiakh Sefferi v mnogoznachinoi loguike’ (Sheffer Functions in Many- valued Logic).

    Google Scholar 

  • Baĭramov, R. A., (1967b) ‘Ob odnoi serii predpolnykh klassov v k-znachinoi logike’ (A Series of Pre- complete Classes of k-valued Logic).

    Google Scholar 

  • Baĭramov, R. A., (1968) ‘Stabilizatory predikatov i funktsii Sheffera v konecinoznačino logike’ (Predicate Stabilizers and Sheffer Functions in a Finite-valued Logic).

    Google Scholar 

  • Baĭramov, R. A., (1968a) ‘Letter to the Editors’ (Russian).

    Google Scholar 

  • Baĭramov, R. A., (1969) ‘The Predicative Characterizability of Subalgebras of Many-valued Logic’ (Russian).

    Google Scholar 

  • Baĭramov, R. A., (1969a) ‘Fundamentally Criteria for Permutation Groups and Transformation Semigroups’ (Russian).

    Google Scholar 

  • Baĭramov, R. A., (1971) ‘The Classes of Multiplace Functions of Finite Sets’ (Russian).

    Google Scholar 

  • Baĭramov, R. A., (1972) ‘Derivation of Criteria for the Basis Group of Substituting Groups and Subgroups of Images’ (Russian).

    Google Scholar 

Bakarelov, D. I

  • Bakarelov, D. I., (1972) ‘Notes on the Semantics of Three-valued Lukasiewicz Logic’ (Russian).

    Google Scholar 

Bałuka, Edward

  • Bałuka, E., (1965) ‘On Verification of the Expressions of Many-valued Sentential Calculi. I.’

    Google Scholar 

Barton, Giuliano

Beazer, R

  • Beazer, R., (197 +) ‘Post-like Algebras and Injective Stone Algebras’.

    Google Scholar 

  • Beazer, R., (197 +a) ‘Compactness in Abstractions of Post Algebras’.

    Google Scholar 

Becchio, Denise

  • Becchio, D., (1972) ‘Nouvelle démonstration de la complétude du système de Wajsberg axiomatisant la logique trivalente de Lukasiewicz.’

    Google Scholar 

Bell, J. M

  • Bell, J. M., (197 +) ‘Two Systems of Presupposition Logic’ (with I. L. Humberstone).

    Google Scholar 

Bell, N

  • Bell, N., (1972) ‘Extension of the Boolean Difference Concept to Multi-valued Logic Systems’ (with E. W. Page and M. G. Thomason).

    Google Scholar 

Bellman, Richard E

  • Bellman, R. E., (1970) ‘Decision-making in a Fuzzy Environment’ (with L. A. Zadeh).

    Google Scholar 

  • Bellman, R. E., (1973) ‘On the Analytic Formalism of the Theory of Fuzzy Sets’ (with Magnus Giertz).

    Google Scholar 

Belluce, Lawrence Peter

  • Belluce, L. P., (1963) ‘A Weak Completeness Theorem for Infinite-valued First-order Logic’ (with Chen Chung Chang).

    Google Scholar 

  • Belluce, L. P., (1964) ‘Further Results on Infinite Valued Predicate Logic’.

    Google Scholar 

  • Belluce, L. P., (1964a) The Theory of Infinite-valued Predicate Logic.

    Google Scholar 

Belnap, Nuel D., Jr

  • Belnap, N. D. Jr., (1970) ‘Every Functionally Complete m-valued Logic has a Post-complete Axiomatization (with Storrs McCall).

    Google Scholar 

  • Belnap, N. D. Jr., (1973) ‘Restricted Quantification and Conditional Assertion’.

    Google Scholar 

  • Belnap, N. D. Jr., (1975) Entailment. The Logic of Relevance and Necessity. Volume 1 (with Alan Ross Anderson).

    Google Scholar 

  • Belnap, N. D. Jr., (197 +) Entailment. The Logic of Relevance and Necessity. Volume 2 (with Alan Ross Anderson and Robert K. Meyer).

    Google Scholar 

Bertolini, Fernando

  • Bertolini, F., (1970) ‘Kripke Models and Many-valued Logics’.

    Google Scholar 

  • Bertolini, F., (1970a) ‘Kripke Models and Many-valued Logics. II.’ Bielak, Pawel

    Google Scholar 

  • Bertolini, F., (1973 abstract) ‘The Degree of Completeness of Godel’s Logic.’

    Google Scholar 

Bieltz, Petre

  • Bieltz, P., (1970) ‘Some Remarks Concerning the Principle of Excluded Middle’ (with Mihai Dan Birliba).

    Google Scholar 

Birk, J. E

  • Birk, J. E., (1974) ‘Design of Multivalued Combinational Switching Circuits Using Principally Binary Components’ (with D. E. Farmer).

    Google Scholar 

Bîrliba, Mihai Dan

  • Bîrliba, M. D., (1970) ‘Some Remarks Concerning the Principle of Excluded Middle’ (with Petre Bieltz).

    Google Scholar 

Birnbaum, Leon

Bittner, A

  • Bittner, A., (1973) ‘A Ternary Positional Automatic Control System’ (with Claudio Moraga).

    Google Scholar 

Blanchè, Robert

Blochina, G. N

  • Blochina, G. N., (1971) ‘On Basic Groups in k-valued Logics’ (Russian) (with V. B. Kudrjavcev).

    Google Scholar 

  • Blochina, G. N., (1972) ‘Über gewisse Eigenschaften des Systems P’ (with V. B. Kudrjavcev and G. Burosch ).

    Google Scholar 

  • Blochina, G. N., (1973) ‘Ein Vollstandigkeitskriterium bis auf eine gewisse Äquivalenzrelation für eine verallgemeinerte Postsche Algebra’ (with V. B. Kudrjavcev and G. Burosch).

    Google Scholar 

  • Blochina, G. N., (1973a) ‘Über verallgemeinerte Postsche Algebren’ (with V. B. Kudrjavcev and G. Burosch ).

    Google Scholar 

Bobrov, A. E

  • Bobrov, A. E., (1972) ‘Minimization of Functions of a Many-valued Logic in a System Which has Cyclic Negation’ (Russian) (with V. A. Zurkin).

    Google Scholar 

  • Bobrov, A. E., (1973) ‘Minimization on Functions of a Many-valued Logic Which is Defined Through the Maximum, the Minimum and All Unary Functions’ (Russian) (with V. S. Koc).

    Google Scholar 

Bodendiek, Rainer

  • Bodendiek, R., (1974) ‘Über das Reprasentantenproblem in der k-wertigen Logik’.

    Google Scholar 

Bodnarčuk, V. G

  • Bodnarčuk, V. G., (1969) ‘Galois Theory for Post Algebras I, II’ (Russian) (with L. A. Kaluznin, V. N. Kotov and B. A. Romov ).

    Google Scholar 

Böhm, C

  • Böhm, C., (1966) ‘Flow Diagrams, Turing Machines, and Languages with Only Two Formation Rules’ (with G. Jacopini).

    Google Scholar 

Boicescu, Vlad

  • Boicescu, V., (1969) ‘Sur les extensions des algèbres de Lukasiewicz’ (with I. Bădele).

    Google Scholar 

  • Boicescu, V., (1970) ‘Sur la représentation des algebres de Lukasiewicz n-valentes.’

    Google Scholar 

  • Boicescu, V., (1970a) ‘Les algebres de Lukasiewicz centrees et axees’.

    Google Scholar 

  • Boicescu, V., (1971) ‘Sur les algebres de Lukasiewicz’.

    Google Scholar 

  • Boicescu, V., (1971a) ‘Sur les systèmes déductifs dans la logique θ-valente’.

    Google Scholar 

Börner, Walter

  • Börner, W., (1969) ‘Eine Klasse von Darstellungen der Funktionen der k-wertigen Logik’.

    Google Scholar 

Braddock, R. C

  • Braddock, R. C., (1971) ‘Multiple Logic Design and Applications in Binary Computers’ (with George Epstein and H. Yamanaka).

    Google Scholar 

Brady, Ross Thomas

  • Brady, R. T., (1971) A 4-valued Theory of Classes and Individuals.

    Google Scholar 

  • Brady, R. T., (1971a) ‘The Consistency of the Axioms of Abstraction and Extensionality in a Three- valued Logic’.

    Google Scholar 

  • Brady, R. T., (1972) ‘The Relative Consistency of the Class Axioms of Abstraction and Extensionality and the Axioms of NBG in a Three-valued Logic’.

    Google Scholar 

  • Brady, R. T., (1973) ‘Don’t Care was Made to Care’ (with Richard Routley). (197 +) ‘Significance Logics’.

    Google Scholar 

  • Brady, R. T., (197 +a) ‘Significance Range Theory’.

    Google Scholar 

Brever, M. A

  • Brever, M. A., (1973) ‘The Smallest Many-valued Logic for Treatment of Complemented and Uncomplemented Error Signals’ (with George Epstein).

    Google Scholar 

Brusentzov, N. P

  • Brusentzov, N. P., (1960) ‘The Computer Setun’ of Moscow State University’ (Russian).

    Google Scholar 

  • Brusentzov, N. P., (1962) ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with Y. A. Zhogolev and V. Verigin and S. P. Maslov and A. M. Tishulina ).

    Google Scholar 

  • Brusentzov, N. P., (1965) ‘A Ternary Arithmetic Machine’ (Russian).

    Google Scholar 

Bryll, Grzegorz

  • Bryll, G., (1967) ‘Some Remarks on Three-valued Logic of J. Lukasiewicz’ (with Jerzy Shipecki and Tadeusz Prucnal).

    Google Scholar 

Bueno, Eramis

  • Bueno, E., (1969) ‘Polyvalent Modal Logics’ (Spanish).

    Google Scholar 

  • Bueno, E., (1970) ‘A Certain Class of Many-valued Modal Systems’.

    Google Scholar 

Bull, Robert Ansley

  • Bull, R. A., (1962) ‘The Implicational Fragment of Dummett’s LC.’

    Google Scholar 

  • Bull, R. A., (1964) ‘An Axiomatization of Prior’s Modal Calculus Q

    Google Scholar 

  • Bull, R. A., (1964a) ‘Some Results for Implicational Calculi’.

    Google Scholar 

Burle, G. A

  • Burle, G. A., (1967) ‘Classes of k-valued Logic Which Contain all Functions of a Single Variable’ (Russian).

    Google Scholar 

Burosch, G

  • Burosch, G., (1972) ‘Das Problem der Vollstandigkeit fur Boolesche Funktionen uber zwei Dual- mengen’ (with V. B. Kudrjavcev).

    Google Scholar 

  • Burosch, G., (1972a) ‘Uber gewisse Eigenschaften des Systems P’ (with G. N. Blochina and V. B. Kudrjavcev).

    Google Scholar 

  • Burosch, G., (1973) ‘Ein Vollständigkeitskriterium bis auf eine gewisse Äquivalenzrelation für eine verallgemeinerte Postsche Algebra’ (with G. N. Blochina and V. B. Kudrjavcev).

    Google Scholar 

  • Burosch, G., (1973a) ‘Über verallgemeinerte Postsche Algebren’ (with G. N. Blochina and V. B. Kudrjavcev).

    Google Scholar 

Cabanes, A

  • Cabanes, A., (1973) ‘Minimal Representation of a Function of Several Finite Variable-applications to Data Bank’ (with E. Pichat).

    Google Scholar 

Cain, Robert G

  • Cain, R. G., (1974) ‘A Practical Approach to Two-level Minimization of Multivalued Logic’ (with Daniel L. Ostapko and Se June Hong).

    Google Scholar 

Call, Richard L

  • Call, R. L., (1968) ‘A Minimal Canonically Complete M-valued Proper Logic for Each M.’

    Google Scholar 

Caracciolo di Forino, Alfonso

  • Caracciolo di Forino, A., (1966) ‘m-valued Logics and m-ary Selection Functions’.

    Google Scholar 

Carr, J. W., III

  • Carr, J. W., III (1959) ‘A Visit to Computation Centers in the Soviet Union’ (with A. J. Perlis and J. E. Robertson and N. R. Scott).

    Google Scholar 

Carvallo, Michel

  • Carvallo, M., (1967) ‘Sur la resolution des équations de Post’.

    Google Scholar 

  • Carvallo, M., (1968) Logique d trois valeurs. Logique a seuil.

    Google Scholar 

  • Carvallo, M., (1968a) ‘Sur la résolution des équations de Post à v valeurs’.

    Google Scholar 

Casenoves, D. M

  • Casenoves, D. M., (1964) ‘L-algebres, multivalent logice’.

    Google Scholar 

Castaneda, Hector-Neri

Cazacu, C

Caton, Charles E

  • Caton, C. E., (1962) ‘A Stipulation of Logical Truth in a Modal Propositional Calculus’.

    Google Scholar 

Ceĭtlin, G. E

  • Ceĭtlin, G. E., (1970) ‘The Structure of a Modified Post Algebra and Its Properties’ (Russian).

    Google Scholar 

  • Ceĭtlin, G. E., (1971) ‘The Infinitely Generated Subalgebras of a Modified Post Algebra’ (Russian).

    Google Scholar 

Chang Chen Chung

  • Chang C. C., (1957) ‘Algebraization of Infinitely Many-valued Logic’.

    Google Scholar 

  • Chang C. C., (1958b) ‘Algebraic Analysis of Many-valued Logics’.

    Google Scholar 

  • Chang C. C., (1959) ‘A New Proof of the Completeness of the Lukasiewicz Axioms’.

    Google Scholar 

  • Chang C. C., (1961b) ‘Prime Ideal Characterization of Generalized Post Algebras’ (with Alfred Horn).

    Google Scholar 

  • Chang C. C., (1963a) ‘Logic with Positive and Negative Truth Values’.

    Google Scholar 

  • Chang C. C., (1963b) ‘The Axiom of Comprehension in Infinite-valued Logic’.

    Google Scholar 

  • Chang C. C., (1963d) ‘A Weak Completeness Theorem for Infinite-valued First-order Logic’ (with Lawrence Peter Belluce).

    Google Scholar 

Chang, Chin-liang

  • Chang C., (1971) ‘Some Properties of Fuzzy Logic’ (with Richard C. T. Lee).

    Google Scholar 

Chao, C. Y

  • Chao, C. Y., (1973) ‘A Balanced Ternary Computer’ (with Gideon Frieder and A. Fong).

    Google Scholar 

Chapin, E. William, Jr

  • Chapin, E. W., Jr. (197 +) ‘Set-valued Set Theory. I’.

    Google Scholar 

Cherciu, Mihail

  • Cherciu, M., (1971) ‘Filtres de Stone dans les treillis distributifs’.

    Google Scholar 

Cheung, Peter T

  • Cheung, P. T., (1971) ‘Algebraic Properties of Multi-valued Symmetric Switching Functions’ (with Stephan Y. H. Su).

    Google Scholar 

  • Cheung, P. T., (1971a) ‘Computer-oriented Algorithm for Minimizing Multi-valued Switching Functions’ (with Stephan Y. H. Su).

    Google Scholar 

  • Cheung, P. T., (1972) ‘Computer Minimization of Multi-valued Switching Functions’ (with Stephan Y. H. Su).

    Google Scholar 

Chidgey, John R

  • Chidgey, J. R., (1972) ‘Necessity and Ticket Entailment’ (with R. Zane Parks).

    Google Scholar 

  • Chidgey, J. R., (1974) On Entailment. A Consideration of Some of the Formal Properties of the Anderson and Belnap System E of Entailment and of Related Systems.

    Google Scholar 

Čimev, Kiril N

  • Čimev, K. N., (1967) ‘A Certain Kind of Dependence of Certain Function of P k on Their Arguments’ (Bulgarian).

    Google Scholar 

  • Čimev, K. N., (1968-69) ‘The Various Kinds of Dependence of the Functions of Many-valued Logic on Their Arguments’ (Bulgarian).

    Google Scholar 

  • Čimev, K. N., (1968-69a) ‘The First Order Variables of the Functions of Many-valued Logic’ (Bulgarian) (with Georgi A. Kutirkov).

    Google Scholar 

Choundhyry, A. C

Chresterson, H. E

  • Chresterson, H. E., (1955) ‘A Class of Generalized Walsh Functions’.

    Google Scholar 

Chuang, Henry Y. H

  • Chuang, H. Y. H., (1974) ‘On the Design of Reliable and Fail-safe Digital Systems Using Multiple-valued Logic’ (with Santano Das).

    Google Scholar 

Cignoli, Roberto

  • Cignoli, R., (1965) ‘Boolean Elements in Lukasiewicz Algebras I’.

    Google Scholar 

  • Cignoli, R., (1965a) ‘Boolean Elements in Lukasiewicz Algebras IF’ (with Antonio Monteiro).

    Google Scholar 

  • Cignoli, R., (1969) Estudio algebraico de logicas polivalentes. Algebras de Moisil de orden N.

    Google Scholar 

  • Cignoli, R., (1970) Moisil Algebras.

    Google Scholar 

  • Cignoli, R., (1972) ‘Representation of Lukasiewicz and Post Algebras by Continuous Functions’.

    Google Scholar 

Cleave, John P

  • Cleave, J. P., (1974) ‘The Notion of Logical Consequence in the Logic of Inexact Predicates’.

    Google Scholar 

Cohen, K. J

  • Cohen, K. J., (1953) ‘A Remark on Łukasiewicz’s “On the Intuitionistic Theory of Deduction’”.

    Google Scholar 

Cohn, M

  • Cohn, M., (1961) ‘Canonical Forms of Functions inp-valued Logics’.

    Google Scholar 

Collier, Kenneth W

  • Collier, K. W., (1974) ‘A Result of Extending Bochvar’s 3-valued Logic’.

    Google Scholar 

Cooper, G. A

  • Cooper, G. A., (1972) ‘Toward a Characterization of Logically Complete Switching Functions in /t-valued Logic’ (with Y. N. Patt).

    Google Scholar 

Curran, P. F

  • Curran, P. F., (1973) ‘Obtaining Self-testing Logic Through the Application of Threshold Logic and an A. C. Logic Code’.

    Google Scholar 

Dahn, B

  • Dahn, B., (1974) ‘Kripke-style Semantics for Some Many-valued Propositional Calculi’.

    Google Scholar 

D’Amore, Bruno

  • D’Amore, B., (1972) ‘Sulla definizione di una implicazione nelle logiche polivalente che soddisfi alia transitivita che rispetti la struttura di reticolo di Boole’ (with Maurizio L. M. Matteuzzi).

    Google Scholar 

  • D’Amore, B., (1973) ‘Considerazioni strutturali sugli insiemi indecidibili’ (with Maurizio M. Mateuzzi).

    Google Scholar 

Darzins, A. Luis

  • Darzins, A. L., (1967 abstract) ‘The Unambiguous Characterization Problem’ for Many-valued and Aristotelian and- and or- Propositional and Functional Calculi’.

    Google Scholar 

Das, Santano

  • Das, S., (1974) ‘On the Design of Reliable and Fail-safe Digital Systems Using Multiple-valued Logic’ (with Henry Y. H. Chuang).

    Google Scholar 

Davis, Robert L

De Luca, A

  • De Luca, A., (1972) ‘Algebraic Properties of Fuzzy Sets’ (with S. Termini).

    Google Scholar 

Dietmeyer, D. L

  • Dietmeyer, D. L., (1963) ‘A Magnetic Ternary Device’ (with D. J. Anderson).

    Google Scholar 

Dijkstra, J. W

  • Dijkstra, J. W., (1968) ‘GO TO Statement Considered Harmful’.

    Google Scholar 

Donaldson, J. R

Drabbe, Jean

  • Drabbe, J., (1973) ‘Sur la representation des algèbres de Post’.

    Google Scholar 

  • Drabbe, J., (1973a) ‘Étude algèbrique des logiques á plusieurs valeurs’.

    Google Scholar 

Drange, T

Dreben, Burton

  • Dreben, B., (1960) ‘Relation of m-valued Quantificational Logic to 2-valued Quantificational Logic’.

    Google Scholar 

Druzeta, A

  • Druzeta, A., (1973) ‘Multi-threshold Circuits in the Design of Multi-state Storage Elements’ (with A. S. Sedra).

    Google Scholar 

  • Druzeta, A., (1974) ‘Electronic Implementation of Multi-valued Logic Networks’ (with Zvonko G. Vranesic and Kenneth C. Smith).

    Google Scholar 

  • Druzeta, A., (197+) ‘Application of Multi-threshold Elements in the Realization of Many-valued Logic Networks’ (with Zvonko G. Vranesic and Kenneth C. Smith).

    Google Scholar 

DuCasse, Edgar G

  • DuCasse, E. G., (1972) ‘A Generalized Equivalence Relation for Post Algebras’ (with Gemot A. Metze).

    Google Scholar 

  • DuCasse, E. G., (1973) ‘Hazard-free Realizations of Boolean Functions Using Post Functions’ (with Gemot A. Metze).

    Google Scholar 

  • DuCasse, E. G., (1974) ‘Synthesizing Operators Defined on a Class of Decision Algebras from Post Functions’.

    Google Scholar 

  • DuCasse, E. G., (1974a) ‘Applications of a Multi-valued Gate to the Design of Fault-tolerant Digital Systems’ (with Stephan Y. H. Su).

    Google Scholar 

  • DuCasse, E. G., (1975) “Comments on ‘The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement’” (with Gemot A. Metze).

    Google Scholar 

Dumitriu, Anton

  • Dumitriu, A., (1971) Logica polivalentă. Second edition (in collaboration with Teodor Stihi).

    Google Scholar 

Dummett, Michael

  • Dummett, M., (1959) ‘A Propositional Calculus with Denumerable Matrix’.

    Google Scholar 

  • Dummett, M., (1973) Frege: Philosophy of Language.

    Google Scholar 

Dunderdale, H

  • Dunderdale, H., (1969) ‘Current-mode Circiuts for Ternary-logic Realization’.

    Google Scholar 

  • Dunderdale, H., (1970) ‘Current-mode Circuits for the Unary Functions of a Ternary Variable’.

    Google Scholar 

Dunn, Jon Michael

  • Dunn, J. M., (1968 abstract) ‘Representation Theory of Normal R-mingle Matrices’.

    Google Scholar 

  • Dunn, J. M., (1969) ‘E, R and y’ (with Robert K. Meyer).

    Google Scholar 

  • Dunn, J. M., (1970) ‘Algebraic Completeness Results for R-mingle and Its Extensions’.

    Google Scholar 

  • Dunn, J. M., (1970a abstract) Extensions of RM and LC.

    Google Scholar 

  • Dunn, J. M., (1971) ‘Algebraic Completeness Results for Dummett’s LC and Its Extensions’ (with Robert K. Meyer).

    Google Scholar 

Dwinger, P

Dzik, Wojciech

  • Dzik, W., (1973) ‘Structural Completeness of Godel’s and Dummett’s Propositional Calculi’.

    Google Scholar 

Edmonds, Ernest

  • Edmonds, E., (1969) ‘Independence of Rose’s Axioms for m-valued Implication’.

    Google Scholar 

Eichelberger, E

  • Eichelberger, E., (1965) ‘Hazard Detection in Combinational and Sequential Circuits’.

    Google Scholar 

Engineering Research Associates

  • Engineering Research Associates (1950) High-Speed Computing Devices.

    Google Scholar 

Englebretsen, G

  • Englebretsen, G., (1973) ‘Suggested Truth-tables for a Three-valued Sentential Logic’.

    Google Scholar 

Epstein, George

  • Epstein, G., (1959) ‘A General Design Theory for Digital Computers’.

    Google Scholar 

  • Epstein, G., (1960) ‘The Lattice Theory of Post Algebras’.

    Google Scholar 

  • Epstein, G., (1962) ‘Single Function Shifting Counters’ (with J. S. Bailey).

    Google Scholar 

  • Epstein, G., (1971 abstract) ‘On Unary Functions in Post Algebras’.

    Google Scholar 

  • Epstein, G., (1971a abstract) ‘Aspects of Post Algebras’.

    Google Scholar 

  • Epstein, G., (1971b) ‘Multiple-valued Logic Design and Applications in Binaiy Computers’ (with R. C. Braddock and H. Yamanaka).

    Google Scholar 

  • Epstein, G., (1971c) ‘Decision Algebras’.

    Google Scholar 

  • Epstein, G., (1972) ‘Applications of Post and Generalized Post Algebras to Finite and Infinite Valued Switching Circuits’.

    Google Scholar 

  • Epstein, G., (1972a) ‘Multiple-valued Signal Processing with Limiting’.

    Google Scholar 

  • Epstein, G., (1972b) ‘Tri-stable State Circuitry for Digital Computers’ (with Hideki Yamanaka).

    Google Scholar 

  • Epstein, G., (1973) ‘An Equational Axiomatization for the Disjoint System of Post Algebras’.

    Google Scholar 

  • Epstein, G., (1973a) “Comments on ‘The Relationship between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement’”.

    Google Scholar 

  • Epstein, G., (1973b) ‘The Smallest Many-valued Logic for Treatment of Complemented and Uncomplemented Error Signals’ (with M. A. Breuer).

    Google Scholar 

  • Epstein, G., (1974) ‘The Development of Multiple-valued Logic as Related to Computer Science’ (with Gideon Frieder and David C. Rine).

    Google Scholar 

  • Epstein, G., (1974a) ‘Propositional Calculi Based on Subresiduation’ (with Alfred Horn).

    Google Scholar 

  • Epstein, G., (1974b) ‘Finite Limitations on Propositional Calculus for Affirmation and Negation’ (with Alfred Horn).

    Google Scholar 

  • Epstein, G., (1974c) ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science’ (with Gideon Frieder and David C. Rine).

    Google Scholar 

  • Epstein, G., (197 +) ‘The Extensions of FSR’s to FSCR’s for p ≥ 2’.

    Google Scholar 

  • Epstein, G., (197 +a) ‘P-algebras: an Abstraction from Post Algebras’ (with Alfred Horn).

    Google Scholar 

  • Epstein, G., (197 +b) ‘Chain Based Lattices’.

    Google Scholar 

  • Epstein, G., (197 +c) ‘Logics which are Characterized by Subresiduated Lattices’ (with Alfred Horn).

    Google Scholar 

  • Epstein, G., (197 +d) Decisive Implication.

    Google Scholar 

  • Epstein, G., (197 +e) From Fixed to Mixed Radix.

    Google Scholar 

Ermolauer, N. M

  • Ermolauer, N. M., (1973) ‘On Logics Which are Similar to Hao Wang’s Calculus’ (Russian).

    Google Scholar 

Etiemble, Daniel

  • Etiemble, D., (1974) ‘A New Concept for Ternary Logic Elements’ (with Michel Israel).

    Google Scholar 

Evendon, John

Fadini, Angelo

  • Fadini, A., (1962) ‘II calcolo delle class in una logica a tre valori di verità’.

    Google Scholar 

Farmer, D. E

  • Farmer, D. E., (1974) ‘Design of Multivalued Combinational Switching Circuits Using Principally Binary Components’ (with J. E. Birk).

    Google Scholar 

Fenstad, Jens Erik

  • Fenstad, J. E., (1964) ‘On the Consistency of the Axiom of Comprehension in the Łukasiewicz Infinite Valued Logic’.

    Google Scholar 

Finn, Victor K

  • Finn, V. K., (1969) ‘The Precompleteness of a Class of Functions that Corresponds to the Three- valued Logic of J. Lukasiewicz’ (Russian).

    Google Scholar 

  • Finn, V. K., (1970) ‘Certain Characteristic Truth-tables of Classical Logic and of the Three-valued Logic of J. Lukasiewicz’ (Russian).

    Google Scholar 

  • Finn, V. K., (1971) ‘On the Axiomatization of a Three-valued Logic’ (Russian).

    Google Scholar 

  • Finn, V. K., (1971a) Axiomatization of Some 3-valued Propositional Calculi and of Their Algebras (Russian).

    Google Scholar 

  • Finn, V. K., (1974) ‘A Criterion of Functional Completeness for B3’.

    Google Scholar 

Fisch, Max

  • Fisch, M., (1966) ‘Peirce’s Triadic Logic’ (with Atwell R. Turquette).

    Google Scholar 

Fischer, Mark

  • Fischer, M., (1961) ‘A Three-valued Calculus for Deontic Logics’.

    Google Scholar 

Fong, A

  • Fong, A., (1973) ‘A Balanced Ternary Computer’ (with Gideon Frieder and C. Y. Chao).

    Google Scholar 

Fort, Marc

Foulk, C

  • Foulk, C.,(1972) ‘Smooth Programs and Languages’ (with O. Juelich).

    Google Scholar 

Freĭvald, R. V

  • Freĭvald, R. V., (1966) ‘A Completeness Criterion for Partial Functions of Logic and Many-valued Logic Algebra’ (Russian).

    Google Scholar 

  • Freĭvald, R. V., (1968) The Completeness to Within Coding of Systems of Functions of a k-valued Logic and the Complexity of Its Recognition’ (Russian).

    Google Scholar 

  • Freĭvald, R. V., (1970) ‘Coding of Finite Sets and a Criterion of Completeness Up to Coding in Three- valued Logic’ (Russian).

    Google Scholar 

Frieder, Gideon

  • Frieder, G., (1972) ‘Ternary Computers—Why and How’.

    Google Scholar 

  • Frieder, G., (1973) ‘A Balanced Ternary Computer’ (with A. Fong and C. Y. Chao).

    Google Scholar 

  • Frieder, G., (1974) ‘The Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and David C. Rine).

    Google Scholar 

  • Frieder, G., (1974a) ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and David C. Rine).

    Google Scholar 

Fu, K. S

  • Fu, K. S., (1969) ‘A Formulation of Fuzzy Automata and its Application as a Model of Learning Systems’ (with William G. Wee).

    Google Scholar 

Fujita, S

  • Fujita,., (1973) ‘Decomposition of Multi-valued Switching Functions and Its Application to Threshold Networks’ (with Hisashi Mine).

    Google Scholar 

Fujita, Y

  • Fujita, Y., (1971) ‘Homorphisms of Logical Functions and Their Applications’ (with Tadahiro Kitahashi and Kokichi Tanaka).

    Google Scholar 

  • Fujita, Y., (1972) ‘A Consideration on Compositions of Many-valued Logical Functions’ (with Tadahiro Kitahashi and Kokichi Tanaka).

    Google Scholar 

  • Fujita, Y., (1972a) ‘An Extension of the Theorem of Isomorphism Concerning the Compositions of Many-valued Switching Functions’ (with Tadahiro Kitahashi and Kokichi Tanaka).

    Google Scholar 

Fukumura, T

  • Fukumura, T (1972) ‘A Problem in the Many-valued Threshold Logic and Its Solution’ (with T. Haga and K. Abe).

    Google Scholar 

Gabbay, Dov M

  • Gabbay, D. M., (1970) ‘The Decidability of the Kreisel-Putnam System’.

    Google Scholar 

  • Gabbay, D. M., (1971 abstract) ‘The Decidability of the Kreisel-Putnam System’.

    Google Scholar 

Gavrilov, G. P

  • Gavrilov, G. P., (1964) ‘On Quasi-Peano Functions’ (Russian).

    Google Scholar 

  • Gavrilov, G. P., (1965) ‘On Functional Completeness in Countably-valued Logic’.

    Google Scholar 

  • Gavrilov, G. P., (1966) Funkcii algebry logiki i klassy Posta (with S. V. Jablonskii and V. B. Kudrjavcev).

    Google Scholar 

Georgescu, George

  • Georgescu, G., (1969) ‘Algèbres de Lukasiewicz completes’.

    Google Scholar 

  • Georgescu, G., (1969a) ‘W-valued Centered Lukasiewicz Algebras’ (with Constantin Vraciu).

    Google Scholar 

  • Georgescu, G., (1969b) ‘Le spectre maximal d’une algebre de Lukasiewicz’ (with Constant in Vraciu).

    Google Scholar 

  • Georgescu, G., (1969c) ‘Sur les algebres de Lukasiewicz centrees’ (with Constant in Vraciu).

    Google Scholar 

  • Georgescu, G., (1969d) ‘Sur le spectre maximal d’une algèbre de Lukasiewicz’ (with Constantin Vraciu).

    Google Scholar 

  • Georgescu, G., (1969e) ‘Sur les epimorphismes centrees des algèbres de Lukasiewicz’ (with Constant in Vraciu).

    Google Scholar 

  • Georgescu, G., (1970) ‘Caractérisation des épimorphismes des algèbres de Lukasiewicz θ-valentes’.

    Google Scholar 

  • Georgescu, G., (1970a) ‘La dualité des algèbres de Post θ-valentes’.

    Google Scholar 

  • Georgescu, G., (1970b) ‘Les algèbres de Lukasiewicz centrées et axées’ (with Vlad Boicesu).

    Google Scholar 

  • Georgescu, G., (1970c) ‘On the Characterization of Centered Lukasiewicz Algebras’ (with Constant in Vraciu).

    Google Scholar 

  • Georgescu, G., (1970d) The Centered Epimorphisms and the Construction of the Tensor Product in Lukn’.

    Google Scholar 

  • Georgescu, G., (1971) ‘Les algèbres de Lukasiewicz θ-valentes’.

    Google Scholar 

  • Georgescu, G., (1971a) ‘Algèbres de Lukasiewicz monadiques et polyadiques’.

    Google Scholar 

  • Georgescu, G., (1971b) ‘Théorème de complétitude en logique θ-valente’.

    Google Scholar 

  • Georgescu, G., (1971c) ‘The θ-valued Lukasiewicz Algebras.I’

    Google Scholar 

  • Georgescu, G., (197Id) ‘Algebras de Lukasiewicz de orden θ. II’

    Google Scholar 

  • Georgescu, G., (1971e) N-valued Complete Lukasiewicz Algebras’.

    Google Scholar 

  • Georgescu, G., (1971f) ‘Algebre Lukasiewicz monadice’ (with Constant in Vraciu).

    Google Scholar 

  • Georgescu, G., (1971g) ‘The 0-valued Lukasiewicz Algebras-III. Duality Theory’.

    Google Scholar 

  • Georgescu, G., (1971h) ‘Les θ-ultrafiltres validants d’algèbre de Lindenbaum-Tarski d’un calcul des prédicats a θ-valeurs’.

    Google Scholar 

  • Georgescu, G., (1972) ‘Represéntation des algebres de Lukasiewicz θ-valentes polyadiques’.

    Google Scholar 

  • Georgescu, G., (1972a) ‘Representation of Locally Finite and of Infinite Degree Polyadic Lukasiewicz Algebras’ (Roumanian).

    Google Scholar 

  • Georgescu, G., (197 +) ‘The θ-valued Lukasiewicz Algebras. IV’. (197 +a) ‘Monadic and Polyadic Lukasiewicz Algebras’. (197 +b) ‘La dualité des algèbres de Post θ-valentes’ (with Constantin Vraciu).

    Google Scholar 

Giertz, Magnus

  • Giertz, M., (1973) ‘On the Analytic Formalism of the Theory of Fuzzy Sets’ (with Richard E. Bellman).

    Google Scholar 

Gindikin, S. G

Givone, Donald D

  • Givone, D. D., (1968) ‘A Minimization Technique for Multiple-valued Logic Systems’ (with Charles M. Allen).

    Google Scholar 

  • Givone, D. D., (1968a) Final Report on the Design of Multiple-Valued Logic Systems (with R. W. Snelsire).

    Google Scholar 

  • Givone, D. D., (1973) ‘Applying Multiple-valued Algebra Concepts to Neural Modeling’ (with R. F. Mattrey and Charles M. Allen).

    Google Scholar 

Gnidenko, V. M

  • Gnidenko, V. M., (1963) ‘Determinarea ordinelor claselor aproape complete in logica trivalenta’.

    Google Scholar 

Goddard, Leonard

Goguen, J. A

  • Goguen, J. A., (1969) ‘The Logic of Inexact Concepts’.

    Google Scholar 

Goldberg, H

  • Goldberg, H., (1974) ‘A Strong Completeness Theorem for 3-valued Logic’ (with Hugues Leblanc and George Weaver).

    Google Scholar 

Golomb, S. W

Golunkov, Yu. V

  • Golunkov, Y. V., (1964) ‘On the Equivalence of Formulae Realizing Transformations of Functions in a K-valued Logic’.

    Google Scholar 

Gorelik, A. G

  • Gorelik, A. G., (1967) ‘Geometric Interpretation of a Three-valued Algebra’ (Russian).

    Google Scholar 

Gorlov, V. V

  • Gorlov, V. V., (1973) ‘On Congruences in Closed Post Classes’ (Russian).

    Google Scholar 

Gottwald, Siegfried

  • Gottwald, S., (1973) ‘Über Einbettungen in Zahlenbereiche einer mehrwertigen Mengenlehre’.

    Google Scholar 

Graczynski, Ena

  • Graczynski, E., (1974) ‘On the Construction of Matrices Strongly Adequate for Pre-finite Logics’ (with Andrzej Wroriski).

    Google Scholar 

Graham, R. L

  • Graham, R. L., (1967) ‘On n-valued Functionally Complete Truth Functions’.

    Google Scholar 

Green, D. H

  • Green, D. H., (1973) ‘Nonlinear Ternary Feedback Shift Registers’ (with R. G. Kelsch).

    Google Scholar 

Greniewski, Henryk

  • Greniewski, H., (1958) ‘Refleksje na marginesie wikladow z driejow logik Tadeusza Kotarbinskiego’.

    Google Scholar 

Grigolia, R. S

  • Grigolia, R. S., (1973) ‘Algebraiczeskij analiz n-znacznych logiczeskich sistem Łukasiewicza-Tarskogo’.

    Google Scholar 

Grize, Jean-Blaise

  • Grize, J. B., Logique moderne. Fasc. Ill: Implications-modalités, logiques polyvalentes, logique combinatoire, ontologie et méréologie de Leshiewski.

    Google Scholar 

Grosch, H. J. R

  • Grosch, H. J. R., (1952) ‘Signed Ternary Arithmetic’.

    Google Scholar 

Guttierrez, Jorge

  • Guttierrez, J., (1974) ‘Critical Races in Fundamental Mode Ternary Sequential Machines’ (with Claudio Moraga).

    Google Scholar 

  • Guttierrez, J., (1974a) ‘Multithreshold Periodic Ternary Threshold Logic’ (with Claudio Moraga).

    Google Scholar 

Haack, R. J

Haack, Susan

Haberlin, H

  • Haberlin, H., (1970) ‘Arithmetische Operationen mit binar codierten Ternarzahlen’ (with H. Muller).

    Google Scholar 

Hacking, Ian

Haga, J

  • Haga, J., (1972) ‘A Problem in the Many-valued Threshold Logic and Its Solution’ (with K. Abe and T. Fukumura).

    Google Scholar 

Halldén, Soren

Hall worth, R. P

  • Hallworth, R. P., (1962) ‘Semiconductor Circuits for Ternary Logic’ (with F. G. Heath).

    Google Scholar 

Halperu, Israel

  • Halperu, I., (1968) ‘Ternary Arithmetic Unit’ (with Michael Yoeli).

    Google Scholar 

Hamacher, V. C

  • Hamacher, V. C., (1971) ‘Multivalued versus Binary High Speed Multipliers’ (with Zvonko G. Vranesic).

    Google Scholar 

  • Hamacher, V. C., (1972) ‘Ternary Logic in Parallel Multipliers’ (with Zvonko G. Vranesic).

    Google Scholar 

Hampel, D

  • Hampel, D., (1973) ‘Multifunction Threshold Gates’.

    Google Scholar 

  • Hampel, D., (1973a) ‘Threshold Logic Multiplier’ (with L. Micheel and K. Prost).

    Google Scholar 

Hansel, Georges

  • Hansel, G., (1969) ‘Construction d’un schema functionnel en logic a plusieurs valeurs’ (with Gerard Levy).

    Google Scholar 

Hanazawa, Masazumi

  • Hanazawa, M., (1966) ‘A Characterization of Axiom Schema Playing the Role of Tertium non Datur in Intuitionistic Logic’.

    Google Scholar 

Hanzawa, M

  • Hanzawa, M., (1938) ‘The Theory of Equivalent Transformation of Simple Partial Paths in the Relay Circuit’ (with A. Nakasima).

    Google Scholar 

Hasegawa, Toshiharu

  • Hasegawa, T., (1964) ‘Tunnel Diode Circuits for Ternary Logic’ (Japanese) (with Y. Nagaoka and Yoshikazu Tezuka and Yoshiro Kasahara).

    Google Scholar 

  • Hasegawa, T., (1969) ‘Construction and Analysis of Tri-stable Circuit and Its Application to Ternary Feedback Shift Register’ (with Hisashi Mine and Yoshiahi Koga and M. Ideda and T. Shintani).

    Google Scholar 

  • Hasegawa, T., (1971) ‘Four Ternary Arithmetic Operations’ (with Hisashi Mine and Ryosako Shimada).

    Google Scholar 

  • Hasegawa, T., (1972) ‘Many-valued Logic and Its Applications’ (Japanese).

    Google Scholar 

Heath, F. G

  • Heath, F. G., (1962) ‘Semiconductor Circuits for Ternary Logic’ (with R. P. Hallworth).

    Google Scholar 

Heelan, Patrick A

  • Heelan, P. A., (1970) ‘Quantum Logic and Classical Logic. Their Respective Roles’.

    Google Scholar 

Hendry, Herbert E

  • Hendry, H. E., (1969) ‘On the Concepts of Sheffer Functions’ (with Gerald J. Massey).

    Google Scholar 

Herzberger, Hans G

  • Herzberger, H. G., (1970) ‘Truth and Modality in Semantically Closed Languages’.

    Google Scholar 

  • Herzberger, H. G., (1973) ‘Dimensions of Truth’.

    Google Scholar 

  • Herzberger, H. G., (197 +) ‘Setting Russell Free’.

    Google Scholar 

Heyting, Arend

Hong, Se June

  • Hong, S. J., (1974) ‘A Practical Approach to Two-level Minimization of Multivalued Logic’ (with Daniel C. Ostapko and Robert G. Cain).

    Google Scholar 

Horn, Alfred

  • Horn, A., (1961) ‘Prime Ideal Characterization of Generalized Post Algebras’ (with Chen Chung Chang).

    Google Scholar 

  • Horn, A., (1969) ‘Logic with Truth Tables in a Linearly Ordered Heyting Algebra’.

    Google Scholar 

  • Horn, A., (1969a) ‘Free L-algebras’

    Google Scholar 

  • Horn, A., (1974) ‘Propositional Calculi Based on Subresiduation’ (with George Epstein).

    Google Scholar 

  • Horn, A., (1974a) ‘Finite Limitations on a Propositional Calculus for Affirmation and Negation’ (with George Epstein).

    Google Scholar 

  • Horn, A., (197 +) ‘P-algebras, an Abstraction from Post Algebras’ (with George Epstein). (197 +a) ‘Chain Based Lattices’ (with George Epstein).

    Google Scholar 

  • Horn, A., (197 4-b)‘Logics which are Characterized by Subresiduated Lattices’ (with George Epstein).

    Google Scholar 

Hosoi, Tsutomu

  • Hosoi, T., (1966) ‘Algebraic Proof of the Separation Theorem on Dummett’s LC’.

    Google Scholar 

  • Hosoi, T., (1966a) ‘On the Separation Theorem of Intermediate Propositional Calculi’.

    Google Scholar 

  • Hosoi, T., (1966b) ‘The Separable Axiomatization of the Intermediate Systems S’.

    Google Scholar 

  • Hosoi, T., (1966c) ‘The Axiomatization of the Intermediate Propositional Sn of Gödel’.

    Google Scholar 

  • Hosoi, T., (1967) ‘On Intermediate Logics V.’

    Google Scholar 

  • Hosoi, T., (1967a) ‘On the Axiomatic Method and the Algebraic Method for Dealing with Propositional Logics’.

    Google Scholar 

  • Hosoi, T., (1967b) ‘A Criterion for the Separable Axiomatization of Gödel’s Sn’.

    Google Scholar 

  • Hosoi, T., (1969) ‘On Intermediate Logics II.’

    Google Scholar 

  • Hosoi, T., (1970) ‘The Intermediate Logics on the Second Slice’ (with Hiroakira Ono).

    Google Scholar 

  • Hosoi, T., (197 +) ‘Intermediate Propositional Logics (A Survey)’ (with Hiroakira Ono).

    Google Scholar 

Humberstone, I. L

  • Humberstone, I. L., (197 +) ‘Two Systems of Presupposition Logic’ (with J. M. Bell).

    Google Scholar 

Hung, Chen Uan

  • Hung, C. U., (1970) ‘Remarks on Intermediate Logics’.

    Google Scholar 

Hurst, S. L

  • Hurst, S. L., (1968) ‘An Extension of Binary Minimisation Techniques to Ternary Equations’.

    Google Scholar 

  • Hurst, S. L., (1968a) ‘Semiconductor Circuits for 3-state Logic Applications’.

    Google Scholar 

Ideda, M

  • Ideda, M., (1969) ‘Construction and Analysis of a Tri-stable Circuit and Its Application to Ternary Feedback Shift Register’ (with Hisashi Mine and Toshiharu Hasegawa and Yoshiahi Koga and T. Shintani).

    Google Scholar 

Ilkka, Seppo

  • Ilkka, S., (1966) A New Arithmetization for Finitely Many-valued Propositional Calculi.

    Google Scholar 

Imamiya, A

  • Imamiya, A., (1973) ‘Ternary Threshold Logic Networks Realizing Three-valued Multithreshold Functions’ (with S. Noguchi and J. Oizumi).

    Google Scholar 

Irving, T. A

  • Irving, T. A., (1973) ‘An Approach to Multi-valued Sequential Logic’ (with H. T. Nagle).

    Google Scholar 

Iséki, Kiyoshi

  • Iséki, K., (1966) ‘A Pentavalued Logic and Its Algebraic Theory’ (with Shotaro Tanaka).

    Google Scholar 

  • Iséki, K., (1966a) ‘Some Three Valued Logics and Its Algebraic Representations’.

    Google Scholar 

  • Iséki, K., (1968) Kigo ronrigaku (Meidai ronri). (Symbolic Logic (Propositional Logic).

    Google Scholar 

Israel, Michel

  • Israel, M., (1974) ‘A New Concept for Ternary Logic Elements’ (with Daniel Etiemble).

    Google Scholar 

Iturrioz, Luisa

  • Iturrioz, L., (1965) ‘Axiomas para il calculo proposicional trivalente de Lukasiewicz’.

    Google Scholar 

  • Iturrioz, L., (1968) ‘Sur une classe particuliere d’algebres de Moisil’.

    Google Scholar 

  • Iturrioz, L., (1969) ‘Erratum: Sur une classe particuliere d’algebres de Moisil’.

    Google Scholar 

Ivas’kiv, Ju. L

  • Ivas’kiv, J. L., (1963) ‘A Class of Canonical Forms for the Representation of 3-valued Functions’ (with Z. L. Rabinowitz).

    Google Scholar 

  • Ivas’kiv, J. L., (1969) ‘Description of Many-valued Logics’ (Russian) (with D. A. Pospelov and Z. Tosic).

    Google Scholar 

  • Ivas’kiv, J. L., (1971) Principles of Multivalued Implementation Schemes (Russian).

    Google Scholar 

Ivin, A. A

  • Ivin, A. A., (1970) ‘Definitions of Alethic and Deontic Modal Functors in Terms of Material Implication and Constants’ (Russian).

    Google Scholar 

Jablonskiĭ, S. V

  • Jablonskiĭ, S. V., (1966) Funkcii algébry i klassy Posta (with G. P. Gavrilov and V. B. Kudrjavcev).

    Google Scholar 

  • Jablonskiĭ, S. V., (1969) ‘Precomplete Classes in /:-valued Logics’ (Russian) (with E. Ju. Zaharova and V. B. Kudrjavcev).

    Google Scholar 

  • Jablonskiĭ, S. V., (1972) ‘Certain Properties of Nondegenerate Superpositions in Pk’ (Russian).

    Google Scholar 

  • Jacopini, C.

    Google Scholar 

  • Jacopini, C., (1966) ‘Flow Diagrams, Turing Machines, and Languages with Only Two Formation Rules’ (with C. Böhm).

    Google Scholar 

Janczewski, L. J

  • Janczewski, L. J., (1970) Practical Realization of Multivalued Logic Circuits.

    Google Scholar 

  • Janczewski, L. J., (1971) ‘Circuit Implementations of Multivalued Logic’ (with Kenneth C. Smith and Zvonko G. Vranesic).

    Google Scholar 

  • Janczewski, L. J., (1973) ‘Geometrical Approach to Multivalued Logic Function Synthesis’.

    Google Scholar 

Janin, P

  • Janin, P., (1969) ‘Bases de l’algèbrisation de la logique trivalente’.

    Google Scholar 

Jankov, V. A

  • Jankov, V. A., (1963) ‘O nékotoryh supérkonstruktivnyh isčisléniàh vyskazyvanij’ (Some Supercon-structive Propositional Calculi).

    Google Scholar 

  • Jankov, V. A., (1963a) ‘O réalizuemyh formulah logiki vyskazyvanij’ (Realizable Formulas of Pro- positional Logic).

    Google Scholar 

  • Jankov, V. A., (1963b) ‘O svázi méždu vyvodimost’u v intuičionistkom isčislénii vyskazyvanij i konéčnymi implikativnymi strukturami’ (The Relationship Between Deducibility in the Intuitionist Propositional Calculus and Finite Implicational Structures).

    Google Scholar 

  • Jankov, V. A., (1968) ‘Postroénié poslédovatél’nosti sil’no nézavisimyh supérintuicionistskih propozicional’nyh isčislénij’ (Constructing a Sequence of Strongly Independent Superintui-tionistic Propositional Calculi).

    Google Scholar 

  • Jankov, V. A., (1968a) ‘Ob isčislenii slabogo zakona isklučennogo trét’ego’ (The Calculus of the Weak “Law of Excluded Middle”).

    Google Scholar 

  • Jankov, V. A., (1968b) ‘On the Extension of the Intuitionist Propositional Calculus to the Classical Calculus, and the Minimal Calculus to the Intuitionist Calculus’ (Russian).

    Google Scholar 

  • Jankov, V. A., (1969) ‘Konúnktivno nérazložimyé formuly v propozicional’nyh isčisléniáh’ (Conjunctively Indecomposable Formulas in Propositional Calculi).

    Google Scholar 

Jørgensen, Chr. Klixbiill

  • Jørgensen, C. K., (1967) ‘The Extensional Classification of Categorical Propositions and Trivalent Logic’.

    Google Scholar 

Jordan, I. B

  • Jordan, I. B., (1974) ‘Integrated Circuits for Ternary Logic’ (with H. T. Mouftah).

    Google Scholar 

Jordan, Zbigniew

Jorgović, Milutin M

  • Jorgović, M. M., (1969) ‘A Remark Concerning a Base for Many-valued Propositional Algebra’ (Serbo- Croatian).

    Google Scholar 

Juelich, D

  • Juelich, D., (1972) ‘Smooth Programs and Languages’ (with C. Foulk).

    Google Scholar 

Kalužnin, L. A

  • Kalužnin, L. A., (1969) ‘Galois Theory for Post Algebras. I, II’ (Russian) (with V. G. Bodnarcuk and V. N. Kotov and B. A. Romov ).

    Google Scholar 

Kandel, Abraham

  • Kandel, A., (1974) ‘Fuzzy Representation, CNF Minimization and Their Application to Fuzzy Transmission Structures’.

    Google Scholar 

Kang, Andy N. C

  • Kang, A. N. C., (1974) ‘On the Boolean Functions Over 4-element Boolean Algebra’ (with Stephan N. T. Shen).

    Google Scholar 

Kaniel, A

  • Kaniel, A., (1973) ‘Trilogic, a Three-level Logic System Provides Greater Memory Density’.

    Google Scholar 

Karttunen, Lauri

  • Karttunen, L., (1973) ‘Presupposition of Compound Sentences’.

    Google Scholar 

Kasahara, Yoshiro

  • Kasahara, Y., (1964) ‘Tunnel Diode Circuits for Ternary Logic’ (Japanese) (with Toshiharu Hasegawa and Y. Nagaoka and Yoshikazu Tezuka).

    Google Scholar 

  • Kasahara, Y., (1969) ‘The Characterizing Parameters of Ternary Logical Functions and Their Applications to Threshold Logical Functions’ (with Tadahiro Kitahashi and Hirosato Nomura and Yoshikazu Tezuka).

    Google Scholar 

  • Kasahara, Y., (1970) ‘Monotonicity of Ternary Logical Functions and Its Applications to the Analysis of Ternary Threshold Functions’ (Japanese) (with Tadahiro Kitahashi and Yoshikazu Tezuka and Hirosato Nomura).

    Google Scholar 

Keir, Y. A

  • Keir, Y. A., (1963) ‘The Functional Capability of the Saturable-Hall Logic Element’.

    Google Scholar 

Keenan, Edward

  • Keenan, E., (1972) ‘On a Semantically Based Grammar’.

    Google Scholar 

Kelsch, R. G

  • Kelsch, R. G., (1973) ‘Nonlinear Ternary Feedback Shift Sequences’ (with D. H. Green).

    Google Scholar 

King-Farlow, John

Kimura, M

  • Kimura, M., (1972) ‘Testing and Realization of Ternary Threshold Functions’.

    Google Scholar 

Kirin, Vladimir G

  • Kirin, V. G., (1963) ‘On the Polynomial Representation of Operators in the n-valued Propositional Calculus’.

    Google Scholar 

  • Kirin, V. G., (1966) ‘Gentzen’s Method for the Many-valued Propositional Calculi’.

    Google Scholar 

  • Kirin, V. G., (1968) ‘Post Algebras as Semantic Bases of Some Many-valued Logics’.

    Google Scholar 

Kirk, Robert Elefter

  • Kirk, R. E., (1972) Intermediate Logics and Equational Classes of Brouwerian Algebras.

    Google Scholar 

Kitahashi, Tadahiro

  • Kitahashi, T., (1969) ‘The Characterizing Parameters of Ternary Logical Functions and Their Application to Threshold Logical Functions’ (with Hirosato Nomura and Yoshikazu Tezuka and Yoshiro Kasahara).

    Google Scholar 

  • Kitahashi, T., (1970) ‘Monotonicity of Ternary Logical Functions and Its Applications to the Analysis of Ternary Threshold Functions’ (Japanese) (with Yoshikaza Tezuka and Yoshiro Kasahara and Hirosato Nomura).

    Google Scholar 

  • Kitahashi, T., (1970) ‘Homomorphisms of Logical Functions and Their Applications’ (with Y. Fujita and Kokichi Tanaka).

    Google Scholar 

  • Kitahashi, T., (1971a) ‘An Orthogonal Expansion of Multiple-valued Logical Functions’ (with Kokichi Tanaka).

    Google Scholar 

  • Kitahashi, T., (1972) ‘A Consideration on Compositions of Many-valued Logical Functions’ (with Y. Fujita and Kokichi Tanaka).

    Google Scholar 

  • Kitahashi, T., (1972a) ‘An Extension of the Theorem of Isomorphism Concerning the Compositions of Many-valued Switching Functions’ (with Y. Fujita and Kokichi Tanaka).

    Google Scholar 

Klaua, Dieter

  • Klaua, D., (1965) ‘Über einen Ansatz zur mehrwertigen Mengenlehre’.

    Google Scholar 

  • Klaua, D., (1966) ‘Über einen zweiten Ansatz zur mehrwertigen Mengenlehre’.

    Google Scholar 

  • Klaua, D., (1967) ‘Ein Ansatz zur mehrwertigen Mengenlehre’.

    Google Scholar 

  • Klaua, D., (1967a) ‘Einbettung der klassischen Mengenlehre in die Mehrwertige’.

    Google Scholar 

  • Klaua, D., (197 +) ‘Zur Arithmetik mehrwertiger Zahlen’.

    Google Scholar 

Kleene, Stephan Cole

  • Kleene, S. C., (1956) ‘Representation of Events on Nerve Nets and Finite Automata’.

    Google Scholar 

Klevačev, V. I

  • Klevačev, V. I., (1970) ‘Certain Systems that are Complete in Pk’ (Russian).

    Google Scholar 

Kline, George L

  • Kline, G. L., (1965) ‘N. A. Vasil’ev and the Development of Many-valued Logics’.

    Google Scholar 

Knuth, D. E

  • Knuth, D. E., (1969) The Art of Computer Programming. Volume 2: Seminumerical Algorithms.

    Google Scholar 

Koc, V. S

  • Koc, V. S., (1973) ‘Minimization of Functions of a Many-valued Logic, Which are Defined Through the Maximum, the Minimum and All Unary Functions’ (Russian) (with D. E. Bobrov).

    Google Scholar 

Kodandapani, K. L

  • Kodandapani, K. L., (1974) ‘Multi-valued Algebraic Generalizations of Reed-Muller Canonical Forms’ (with Rangaswamy V. Setlur).

    Google Scholar 

Kohonen, Teuvo

  • Kohonen, T., (1974) ‘On the Implementation of Logic and Tables by Linear Networks’.

    Google Scholar 

Kohout, Ladislav

  • Kohout, L., (1974) ‘The Pinkava Many-valued Complete Logic Systems and Their Applications in the Design of Many-valued Switching Circuits’.

    Google Scholar 

Koga, Yoshiaki

  • Koga, Y., (1966) ‘A Property of Three-valued Functions of One Variable’ (with Hisashi Mine).

    Google Scholar 

  • Koga, Y., (1969) ‘Construction and Analysis of a Tri-stable Circuit and Its Application to Ternary Feedback Shift Register’ (with Hisashi Mine and Toshiharu Hasegawa and M. Ideda and T. Shintani).

    Google Scholar 

Kooi, C. F

  • Kooi, C. F., (1964) ‘Nonlinear Hall-effects Ternary Logic Element’ (with J. L. Wenver).

    Google Scholar 

Körner, Stephan

Kotarbiński, Tadeusz

  • Kotarbiński, T., (1913) ‘Zagadnienie istnienia pryszfosci’ (On the Problem of Existence of Future Events).

    Google Scholar 

Kotov, V. N

  • Kotov, V. N., (1969) ‘Galois Theory for Post Algebras. I, II’ (Russian) (with V. G. Bodnarćuk and L. A. Kalužnin and B. A. Romov ).

    Google Scholar 

Koukkunen, H

  • Koukkunen, H., (1972) ‘Some Applications of Many-valued Threshold Logic in Digital Arithmetic’ (with L. Ojala).

    Google Scholar 

Krauss, Peter Holger

Kreisel, George

  • Kreisel, G., (1957) ‘Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül’ (with Hilary Putnam).

    Google Scholar 

Krishnamurty, E. V

  • Krishnamurty, E. V., (1964) ‘An Algebra for (m + p) Switching Circuits’.

    Google Scholar 

Kudrjavcev, Valeriĭ B

  • Kudrjavcev, V. B., (1966) Funkcii algébry logiki i klassy Posta (with S. V. Jablonskiĭ and G. P. Gavrilov ).

    Google Scholar 

  • Kudrjavcev, V. B., (1969) ‘Precomplete Classes in k-valued Logics’ (Russian) (with E. Ju. Zaharova and S. V. Jablonskiĭ).

    Google Scholar 

  • Kudrjavcev, V. B., (1970) ‘The Coverings of Precomplete Classes of k-valued Logic’ (Russian).

    Google Scholar 

  • Kudrjavcev, V. B., (1971) ‘Concerning S-systems of Functions of a k-valued Logic’ (Russian).

    Google Scholar 

  • Kudrjavcev, V. B., (1971a) ‘The Properties of S-systems of Functions of k-valued Logic’ (Russian).

    Google Scholar 

  • Kudrjavcev, V. B., (1971b) ‘On Basic Groups in k-valued Logics’ (Russian) (with G. N. Blohina).

    Google Scholar 

  • Kudrjavcev, V. B., (1972) ‘Das Problem der Vollständigkeit für Boolesche Funktionen über zwei Dualmengen’ (with G. Burosch).

    Google Scholar 

  • Kudrjavcev, V. B., (1972a) ‘Über gewisse Eigenschaften des System P’ (with G. N. Blochina and G. Burosch).

    Google Scholar 

  • Kudrjavcev, V. B., (1973) ‘Ein Vollständigkeitskriterium bis auf eine gewisse Äquivalenzrelation für eine verallgemeinerte Postsche Algebra’ (with G. N. Blochina and G. Burosch).

    Google Scholar 

  • Kudrjavcev, V. B., (1973a) ‘Über verallgemeinerte Postsche Algebren’ (with G. N. Blochina and G. Burosch).

    Google Scholar 

  • Kudrjavcev, V. B., (1973b) ‘On Properties of S-systems of k-valued Logic’ (Russian).

    Google Scholar 

  • Kudrjavcev, V. B., (1974) ‘On the Functional System PΣ’ (Russian).

    Google Scholar 

Kumar, Dharmendra

  • Kumar, D., (1967) ‘Logic and Inexact Predicates’.

    Google Scholar 

  • Kumar, D., (1969) ‘Neutrality, Contingency and Undecidability’.

    Google Scholar 

  • Kumar, D., (1971) ‘Vagueness and Subjunctivity’.

    Google Scholar 

Kutirkov, Georgi A

  • Kutirkov, G. A., (1968-69) ‘The First Order Variables of the Functions of Many-valued Logic’ (Bulgarian) (with Kiril N. Čimev).

    Google Scholar 

Lakoff, George

  • Lakoff, G., (1973) ‘Hedges: A Study in Meaning Criteria and the Logic of Fuzzy Concepts’.

    Google Scholar 

Lam, C. I

  • Lam, C. I. (1974) ‘Multiple-valued Pseudorandom Number Generators’ (with Zvonko G. Vranesic).

    Google Scholar 

Lambert, Karel

La Macchia, Samuel

  • La Macchia, S., (1967) ‘Some Generalized Sheffer Functions’ (with Alexander Abian).

    Google Scholar 

  • La Macchia, S., (1967a) ‘Examples of Generalized Sheffer Functions’ (with Alexander Abian).

    Google Scholar 

Leblanc, Hugues

  • Leblanc, H., (1974) ‘A Strong Completeness Theorem for 3-valued Logic’ (with H. Goldberg and George Weaver).

    Google Scholar 

  • Leblanc, H., (197 +) ‘A Strong Completeness Theorem for 3-valued Logic. II’.

    Google Scholar 

Lee, E. S

  • Lee, E. S., (1970) ‘A Many-valued Algebra for Switching Systems’ (with Zvonko G. Vranesic and Kenneth C. Smith).

    Google Scholar 

  • Lee, E. S., (1971) ‘Multivalued Symmetric Functions’ (with S. C. Lee).

    Google Scholar 

Lee, Richard C. T

  • Lee, Richard C. T., (1971) ‘Some Properties of Fuzzy Logic’ (with Chin-liang Chang).

    Google Scholar 

  • Lee, Richard C. T., (1972) ‘Fuzzy Logic and the Resolution Principle’.

    Google Scholar 

Lee, S. C

  • Lee, S. C., (1971) ‘Multivalued Symmetric Functions’ (with E. T. Lee).

    Google Scholar 

Leigh, Vivien

  • Leigh, V., (1972) ‘Self-dual Sets of Unary and Binary Connectives for the 3-valued Propositional Calculus’.

    Google Scholar 

Lejewski, Czesaw

Lempicki, A

Lévy, Gérard

  • Lévy, G., (1969) ‘Formes disjonctives minimales dans une logique à plusieurs valeurs’.

    Google Scholar 

  • Lévy, G., (1969a) ‘Construction d’un schema fonctionnel en logique à plusieurs valeurs’ (with Georges Hansel).

    Google Scholar 

Liebler, M

  • Liebler, M., (1971) ‘Multiple-real-valued Walsch Functions’ (with R. Roesser).

    Google Scholar 

Loader, John

  • Loader, J., (1974) ‘A Method for Finding Formulae Corresponding to First Order Universal Decision Elements in m-valued Logic’.

    Google Scholar 

Łos, Jerzy

  • Łos, J., (1949) O matrycach logicznych (On Logical Matrices).

    Google Scholar 

Lozy, H. El

  • Lozy, H. E., (1973) ‘On the Generation of All the One Variable Functions in M-valued Logic’.

    Google Scholar 

Łukasiewicz, Jan

  • Łukasiewicz, J., (1910) ‘Über den Satz des Widerspruchs bei Aristoteles’.

    Google Scholar 

  • Łukasiewicz, J., (1918) ‘Treść wykładu poz egnalnego prof. Jana Łukasiewicza, wygfoszonego w auli Uniwersytetu Warszawskiego dnia 7-go Marca 1918’ ( Farewell Lecture by Professor Jan Łukasiewicz, Delivered in the Warsaw University Lecture Hall on March 7, 1918 ).

    Google Scholar 

  • Łukasiewicz, J., (1920) ‘O logice trojwartosciowej’ (On Three-valued Logic).

    Google Scholar 

  • Łukasiewicz, J., (1921) ‘Logika dwuwartosciowa’ (Two-valued Logic).

    Google Scholar 

  • Łukasiewicz, J., (1923) ‘O determinzmie’ (On Determinism).

    Google Scholar 

  • Łukasiewicz, J., (1929) Elementy logiki matematycznej (Elements of Mathematical Logic).

    Google Scholar 

  • Łukasiewicz, J., (1930a) ‘Philosophisehe Bemerkungen zu mehrwertigen Systemen des Aussagenkalkiils’.

    Google Scholar 

  • Łukasiewicz, J., (1930b) ‘Untersuchungen uber den Aussagenkalkül’ (with Alfred Tarski).

    Google Scholar 

  • Łukasiewicz, J., (1934) ‘Z historji logiki zdań’ (On the History of the Logic of Propositions).

    Google Scholar 

  • Łukasiewicz, J., (1937) ‘Wobronie logistyki’ (A Defense of Logistic).

    Google Scholar 

  • Łukasiewicz, J., (1938) ‘Die Logik und das Grundlagenproblem’.

    Google Scholar 

  • Łukasiewicz, J., (1952) ‘On the Intuitionistic Theory of Deduction’.

    Google Scholar 

  • Łukasiewicz, J., (1953b) ‘A System of Modal Logic’.

    Google Scholar 

  • Łukasiewicz, J., (1953c) ‘Comment of K. J. Cohen’s Remark’.

    Google Scholar 

  • Łukasiewicz, J., (1961) Z zagadnień logiki ifilozofii (Logical and Philosophical Papers).

    Google Scholar 

  • Łukasiewicz, J., (1970) Selected Works.

    Google Scholar 

Maduch, Maria

  • Maduch, M., (1972) ‘A Definability Criterion for the Operations in Finite Lukasiewicz’s Implicational Matrices’.

    Google Scholar 

Majstrova, T. D

  • Majstrova, T. D., (1960) ‘Priménié mnogoznačnoj logiki v teorii réléjnyh shém’ (Application of Many- valued Logics in the Theory of Relay Networks).

    Google Scholar 

  • Majstrova, T. D., (1961) ‘Réléjnye shémy i mnogoznačinaà logika’ (Relay Networks and Many-valued Łogics) (with V. I. Roghinski).

    Google Scholar 

Maksimova, Larisa L

  • Maksimova, L. L., (1972) ‘Prjedtablicznyje superintuicjonistskije logiki’ (Pretabular Superintuitionist Logic).

    Google Scholar 

Mal’cév, A. I

  • Mal’cév, A. I., (1966) ‘Iterativnyé algébry i mnogoobraziá Posta’ (Iterative Algebra and Post Manifolds).

    Google Scholar 

  • Mal’cév, A. I., (1967) ‘Ob odnom usilenii teorem Shipeckogo i Jablonskogo’.

    Google Scholar 

  • Mal’cév, A. I., (1972) ‘Congruences and Automorphisms in Cells of Post Algebras’ (Russian).

    Google Scholar 

  • Mal’cév, A. I., (1972a) ‘Some Properties of Cellular Subalgebras of a Post Algebra and Their Basic Cells’ (Russian).

    Google Scholar 

Malinowski, Grzegorz

  • Malinowski, G., (1972) ‘Dual Counterparts of Lukasiewicz Sentential Calculi’ (with Maciej Spasowski).

    Google Scholar 

  • Malinowski, G., (1973) MVk Algebras’.

    Google Scholar 

  • Malinowski, G., (1974) ‘S-afgebras for n-valued Sentential Calculi of Łukasiewicz’.

    Google Scholar 

  • Malinowski, G., (1974a) ‘S-algebras and the Degrees of Maximality for Three and Four Valued Logics of Łukasiewicz’.

    Google Scholar 

  • Malinowski, G., (1974b) ‘Degrees of Maximality of Some Lukasiewicz Logics’.

    Google Scholar 

  • Malinowski, G., (1974c) ‘Dual Counterparts of Lukasiewicz’s Sentential Calculi’ (with Maciej Spasowski).

    Google Scholar 

  • Marek, W.

    Google Scholar 

  • Marek, W., (1969) ‘Generalized Lukasiewicz Algebras’ (with Tadeusz Traczyk).

    Google Scholar 

Margaris, Angelo

  • Margaris, A., (1956) A Problem of Rosser and Turquette in Many-valued Logic.

    Google Scholar 

  • Margaris, A., (1958) ‘A Problem of Rosser and Turquette’.

    Google Scholar 

Marinos, Peter

  • Marinos, P., (1969) ‘Fuzzy Logic and Its Application to Switching Systems’.

    Google Scholar 

Marquetty, Antoine

  • Marquetty, A., (1974 abstract) ‘Generalized Many-valued Logics’.

    Google Scholar 

Martyniok, V. V

  • Martyniok, V. V., (1960) ‘Issledovanie nekotorykh klassov funksij v mnogoznacnykh logikakh, II’.

    Google Scholar 

Maslov, S. P

  • Maslov, S. P., (1962) ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with N. P. Brusentzov and Y. A. Zhogolev and V. V. Verigin and A. M. Tisholina ).

    Google Scholar 

Massey, Gerald J

  • Massey, G. J., (1969) ‘On the Concepts of Sheffer Functions’ (with Herbert E. Hendry).

    Google Scholar 

  • Massey, G. J., (1969a) ‘Sheffer Functions for Many-valued Modal Logics’.

    Google Scholar 

  • Massey, G. J., (1971 abstract) ‘Functional Completeness in m-valued Truth Tabular Logic’.

    Google Scholar 

  • Massey, G. J., (1972) ‘The Modal Structure of the Prior-Rescher Family of Infinite Product Systems’.

    Google Scholar 

Materna, Pavel

  • Materna, P., (1972) ‘Intensional Semantics of Vague Constants. An Application of Tichy’s Concept of Semantics’. Matteuzzi

    Google Scholar 

Maurizio L. M

  • Maurizio L. M., (1972) ‘Sulla definizione di una implicazione nelle logiche polivalenti che soddisfi alia transitivita e che rispetti la struttura di reticolo di Boole’ (with Bruno A’Amore).

    Google Scholar 

  • Maurizio L. M., (1973) ‘Considerazione strutturali sugli insiemi indecidibili’ (with Bruno D’Amore).

    Google Scholar 

Mattrey, R. F

  • Mattrey, R. F., (1973) ‘Applying Multiple-valued Algebra Concepts to Neural Modeling’ (with Donald D. Givone and Charles M. Allen).

    Google Scholar 

Maydole, Robert Edwin

  • Maydole, R. E., (1973) Many-valued Logic as a Basis for Set Theory.

    Google Scholar 

McArthur, Robert P

  • McArthur, R. P., (197 +) ‘Three-valued Free Tense Logic’.

    Google Scholar 

McCall, Storrs

  • McCall, S., (1966) ‘Connexive Implication’.

    Google Scholar 

  • McCall, S., (1966a) ‘Pure Three-valued Lukasiewiczian Implication’ (with Robert K. Meyer).

    Google Scholar 

  • McCall, S., (1967) Polish Logic: 1920–1939.

    Google Scholar 

  • McCall, S., (1967a) ‘MacColl’.

    Google Scholar 

  • McCall, S., (1967b) ‘Connexive Implication and the Syllogism’.

    Google Scholar 

  • McCall, S., (1967c) ‘Connexive Class Logic’.

    Google Scholar 

  • McCall, S., (1969) ‘The System S9’ (with Arnold Vander Nat).

    Google Scholar 

  • McCall, S., (1970) ‘Every Functionally Complete m-valued Logic has a Post-complete Axiomatiza- tion’ (with Nuel D. Belnap, Jr.).

    Google Scholar 

McCoy, N

  • McCoy, N., (1937) ‘A Representation of Generalized Boolean Rings’.

    Google Scholar 

McCulloch, W. S

  • McCulloch, W. S., (1943) ‘A Logical Calculus of the Ideas Immanent in Nervous Activity’ (with W. S. Pitts).

    Google Scholar 

McDonald, J. F

  • McDonald, J. F., (1974) ‘Extensions of the Weiner-Smith Algorithm for m-ary Synchronous Sequential Circuit Design’ (with Inder Singh).

    Google Scholar 

McKay, C. G

  • McKay, C. G., (1967) ‘On Finite Logics’.

    Google Scholar 

  • McKay, C. G., (1967a) ‘A Note on the Jaśkowski Sequence’.

    Google Scholar 

  • McKay, C. G., (1968) ‘The Decidability of Certain Intermediate Propositional Logics’.

    Google Scholar 

  • McKay, C. G., (1968a) ‘The Non-separability of a Certain Finite Extension of Heyting’s Propositional Logic’.

    Google Scholar 

  • McKay, C. G., (1968b) ‘The Non-separability of a Certain Finite Extension of Heyting’s Propositional Logic’.

    Google Scholar 

  • McKay, C. G., (1971) ‘A Class of Decidable Intermediate Propositional Logics’.

    Google Scholar 

Meredith, C. A

  • Meredith, C. A., (1966) ‘Postulates for Implicational Calculi’.

    Google Scholar 

Metze, Gemot A

  • Metze, G. A., (1955) ‘An Application of Multi-valued Logic Systems to Circuits’.

    Google Scholar 

  • Metze, G. A., (1971) ‘Some Relationships Between Post and Boolean Algebras’ (with R. S. Wojcik).

    Google Scholar 

  • Metze, G. A., (1972) ‘A Generalized Equivalence Relation for Post Algebras’ (with Edgar G. DuCasse).

    Google Scholar 

  • Metze, G. A., (1973) ‘Hazard-free Realizations of Boolean Functions Using Post Functions’ (with Edgar G. DuCasse).

    Google Scholar 

  • Metze, G. A., (1975) “Comments on ‘The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement’” (with Edgar G. DuCasse).

    Google Scholar 

Meyer, Robert Kenneth

  • Meyer, R. K., (1966) Topics in Modal and Many-valued Logic.

    Google Scholar 

  • Meyer, R. K., (1966a) ‘Pure Denumerable Łukasiewiczian Implication’.

    Google Scholar 

  • Meyer, R. K., (1966b) ‘Pure Three-valued Łukasiewiczian Implication’ (with Storrs McCall).

    Google Scholar 

  • Meyer, R. K., (1969) ‘E, R and y’ (with J. Michael Dunn).

    Google Scholar 

  • Meyer, R. K., (1971 abstract) ‘R-mingle and Relevant Disjunction’.

    Google Scholar 

  • Meyer, R. K., (1971a) ‘Algebraic Completeness Results for Dummett’s LC and Its Extensions’ (with J. Michael Dunn).

    Google Scholar 

  • Meyer, R. K., (1972) ‘Independent Axioms for the Implicational Fragment of Sobociński’s Three- valued Logic’ (with R. Zane Parks).

    Google Scholar 

  • Meyer, R. K., (197 +) Coherence Revisited.

    Google Scholar 

Michalski, R. S

Micheel, L

  • Micheel, L., (1973) ‘Threshold Logic Multiplier’ (with D. Hampel and K. Prost).

    Google Scholar 

Miller, D. M

  • Miller, D. M., (1973) ‘Decomposition of Ternary Switching Functions’ (with J. C. Muzio).

    Google Scholar 

  • Miller, D. M., (1974) ‘A Ternary Cellular Array’ (with J. C. Muzio).

    Google Scholar 

Mine, Hisashi

  • Mine, H., (1966) ‘A Property of Three-valued Functions of One Variable’ (with Yoshiaki Koga).

    Google Scholar 

  • Mine, H., (1969) ‘Construction and Analysis of Tri-stable Circuit and Its Application to Ternary Feedback Shift Register’ (with Toshiharu Hasegawa and Yoshiahi Koga and M. Ideda and T. Shintani).

    Google Scholar 

  • Mine, H., (1970) ‘Permutations and Lattice Operations in Many-valued Logic’ (Japanese) (with Ryosaku Shimada).

    Google Scholar 

  • Mine, H., (1971) ‘Four Ternary Arithmetic Operations’ (with Toshiharu Hasegawa and Ryosaku Shimada).

    Google Scholar 

  • Mine, H., (1973) ‘Decomposition of Multi-valued Switching Functions and Its Application to Threshold Networks’ (with S. Fujita).

    Google Scholar 

MIT Computing Center

Miura, Satoshi

  • Miura, S., (1968) ‘Certain Method for Generating a Series of Logics’ (with Shûrô Nagata).

    Google Scholar 

Miyama, Tôru

  • Miyama, T., (1973) ‘Another Proof and an Extension of Gill’s Interpolation Theorem’.

    Google Scholar 

Mizumoto, M

  • Mizumoto, M., (1972) ‘General Formulation of Formal Grammars’ (with J. Toyoda and Kokichi Tanaka).

    Google Scholar 

Mizuno, H

  • Mizuno, H., (1972) ‘Testing and Realization of Ternary Threshold Functions’ (with M. Kimura).

    Google Scholar 

Mlëziva, Miroslav

  • Mlëziva, M., (1960) ‘K axiomatisaci trojhodnotové vyrokove logiky’ (On the Axiomatization of Three-valued Propositional Logic).

    Google Scholar 

Moisil, Grigor Constantin

  • Moisil, G. C., (1936) ‘Recherches sur l’algèbre de la logique’.

    Google Scholar 

  • Moisil, G. C., (1938) ‘Sur la théorie classique de la modalité des jugements’.

    Google Scholar 

  • Moisil, G. C., (1939b) ‘Recherches sur le syllogisme’.

    Google Scholar 

  • Moisil, G. C., (1939c) ‘La logique formelle et son problème actuel’.

    Google Scholar 

  • Moisil, G. C., (1940) ‘Recherches sur les logiques non-chrysippiènnes’.

    Google Scholar 

  • Moisil, G. C., (1940-41) ‘Sur la structure algèbrique de la logique de M. Bochvar’.

    Google Scholar 

  • Moisil, G. C., (1941a) ‘Notes sur les logique non-chrysippiennes’.

    Google Scholar 

  • Moisil, G. C., (1941c) ‘Contributions a l’etude des logiques non-chrysippiènnes. I. Un nouveau système d’axiomes pour les algèbres Łukasiewicziennes tetra-valentes’.

    Google Scholar 

  • Moisil, G. C., (1941d) ‘Remarques sur la logique modale du concept’.

    Google Scholar 

  • Moisil, G. C., (1941e) ‘Sur les anneaux de caracteristique 2 ou 3 et leurs applications’.

    Google Scholar 

  • Moisil, G. C., (1941f) ‘Sur les theories déductives à logique non-chrysippienne’.

    Google Scholar 

  • Moisil, G. C., (1942a) ‘Logique modale’.

    Google Scholar 

  • Moisil, G. C., (1942b) ‘Contributions a l’étude des logiques non-chrysippiènnes. II. Anneaux engendrés par les algèbres Łukasiewicziennes tetravalentes centrées’.

    Google Scholar 

  • Moisil, G. C., (1942c) ‘Contributions a l’étude des logiques non-chrysippiènnes. III. Anneaux engendrés par les algèbres Łukasiewicziennes tetravalentes axèes’.

    Google Scholar 

  • Moisil, G. C., (1943) ‘Contributions a l’etude des logiques non-chrysippiènnes. I V. Sur la logique de Mr. Becker’.

    Google Scholar 

  • Moisil, G. C., (1957a) Teoria algebrica dei meccanismi automatici.

    Google Scholar 

  • Moisil, G. C., (1960a) ‘Sur les idéaux des algèbres Łukasiewicziennes trivalentes’.

    Google Scholar 

  • Moisil, G. C., (1960b) ‘Asupra logicii lue Bochvar’ (On the Logic of Bochvar).

    Google Scholar 

  • Moisil, G. C., (1960c) Logica matematica si teknica modernă: logicile cu mai multe valori si circuitele cu contacte di relee ( Mathematical Logic and Modern Technology: Many-valued Logic and Relay-contact Circuits).

    Google Scholar 

  • Moisil, G. C., (1961a) Les logique a plusieurs valeurs et l’automatique’.

    Google Scholar 

  • Moisil, G. C., (1961b) ‘The Predicate Calculus in Three-valued Logic’.

    Google Scholar 

  • Moisil, G. C., (1962b) ‘Sur la logique a trois valeurs de Łukasiewicz’.

    Google Scholar 

  • Moisil, G. C., (1963a) ‘Le algebre di Łukasiewicz’.

    Google Scholar 

  • Moisil, G. C., (1964) ‘Sur les logiques de Lukasiewicz a un nombre fini de valeurs’.

    Google Scholar 

  • Moisil, G. C., (1966) Zastosowanie algebr Łukasiewicza do teorii uktadow przekaźnikowo-stykowych, volume 1 (Applications of Lukasiewiczian Algebra to the Study of Relay-contact Networks, volume 1).

    Google Scholar 

  • Moisil, G. C., (1967) Zastosowanie algebr Lukasiewicza do teorii układow przékaznikowo-stykowych, volume 2 (Applications of Łukasiewiczian Algebra to the Study of Relay-contact Networks, volume 2).

    Google Scholar 

  • Moisil, G. C., (1967a) ‘Sur le calcul des propositions de type supérieur dans la logique de Lukasiewicz à plusieurs valeurs’.

    Google Scholar 

  • Moisil, G. C., (1968) ‘Lukasiewiczian Algebras’.

    Google Scholar 

  • Moisil, G. C., (1971) ‘Les etats transitoires dans les circuits sequentiels’.

    Google Scholar 

  • Moisil, G. C., (1972) Essais sur les logiques non-chrysippiennes.

    Google Scholar 

  • Moisil, G. C., (1972a) ‘Les ensembles flous et la logique a trois valeurs’.

    Google Scholar 

  • Moisil, G. C., (1972b) ‘Exemples de propositions a plusieurs valeurs’.

    Google Scholar 

  • Moisil, G. C., (1972c) ‘La logique des concepts nuances’.

    Google Scholar 

  • Moisil, G. C., (1972d) ‘Le paradoxe du chauve et les logiques a plusieurs valeurs’.

    Google Scholar 

  • Moisil, G. C., (1972e) ‘Les axiomes de algebres de Lukasiewicz n-valentes’.

    Google Scholar 

  • Moisil, G. C., (1972f) ‘Sur les algebres de Lukasiewicz 0-valentes’.

    Google Scholar 

  • Moisil, G. C., (1972g) ‘Sur le calcul des predicats dans la logique a trois valeurs’.

    Google Scholar 

Moklajak, N. G

  • Moklajak, N. G., (1973) ‘On the Number of Types of Systems of k-valued Logical Functions’ (Russian) (with V. A. Popov and I. T. Skibenko ).

    Google Scholar 

Montgomery, D

  • Montgomery, D., (1937) ‘A Representation of Generalized Boolean Rings’.

    Google Scholar 

Monteiro, António

  • Monteiro, A., (1963) ‘Sur la definition des algebres de Łukasiewicz trivalentes’.

    Google Scholar 

  • Monteiro, A., (1965) ‘Boolean Elements in Łukasiewicz Algebras IF’ (with Roberto Cignoli).

    Google Scholar 

  • Monteiro, A., (1967) ‘Construction des algèbres de Lukasiewicz trivalentes dans les algèbres de Boole monadiques. I’.

    Google Scholar 

Monteiro, Luiz F. T

  • Monteiro, L. F. T., (1963) ‘Axiomes independents pour les algèbres de Łukasiewicz trivalentes’.

    Google Scholar 

  • Monteiro, L. F. T., (1965a) ‘Sur les algèbres de Łukasiewicz injectives’.

    Google Scholar 

  • Monteiro, L. F. T., (1970) ‘Les algèbres de Heyting et de Lukasiewicz trivalentes’.

    Google Scholar 

  • Monteiro, L. F. T., (1970a) ‘Extension d’homomorphismes dans les algèbres de Lukasiewicz trivalentes’. Montgomery, Hugh

    Google Scholar 

  • Monteiro, L. F. T., (1968) ‘On Systems Containing Aristotle’s Thesis’ (with Richard Routley).

    Google Scholar 

Moraga, Claudio

  • Moraga, C., (1971) ‘A Tri-stable Switching Circuit for Synchronized Sequential Machines’.

    Google Scholar 

  • Moraga, C., (1972) ‘Non-linear Ternary Threshold Logic’.

    Google Scholar 

  • Moraga, C., (1973) ‘A Ternary Positional Automatic Control System’ (with R. Bittner).

    Google Scholar 

  • Moraga, C., (1974) ‘Minimal Realization of Ternary Threshold Functions’ (with Jorge Nazarala).

    Google Scholar 

  • Moraga, C., (1974a) ‘Critical Races in Fundamental Mode Ternary Sequential Machines’ (with Jorge Gutierrez).

    Google Scholar 

  • Moraga, C., (1974b) ‘Multithreshold Periodic Ternary Threshold Logic’ (with Jorge Gutierrez).

    Google Scholar 

Morgan, Charles Grady

  • Morgan, C. G., (1974 abstract) ‘Resolution for Many-valued Logics’.

    Google Scholar 

  • Morgan, C. G., (197 +) ‘Local and Global Operators and Many-valued Modal Logics’.

    Google Scholar 

Mori, R

  • Mori, R., (1972) ‘On an Extended Threshold Logic as a Unit Cell of Array Logics’.

    Google Scholar 

Morris, D. J

  • Morris, D. J., (1960) ‘An Introduction to the Ternary Code Number System’ (with W. Alexander).

    Google Scholar 

Morscher, Edgar

  • Morscher, E., (1971) ‘A Matrix Method for Deontic Logic’.

    Google Scholar 

Mostowski, Andrzej

  • Mostowski, A., (1961a) ‘Axiomatizability of Some Many-valued Predicate Calculi’.

    Google Scholar 

  • Mostowski, A., (1961b) ‘An Example of a Non-axiomatizable Many-valued Logic’.

    Google Scholar 

Motil, John M

  • Motil, J. M., (1974) ‘A Multiple-valued Digital “Saturation” System’.

    Google Scholar 

Motohashi, Nobuyoshi

  • Motohashi, N., (1972) ‘Some Investigations on Many Valued Logics’.

    Google Scholar 

Mouftah, H. T

  • Mouftah, H. T., (1974) ‘Integrated Circuits for Ternary Logic’ (with I. B. Jordan).

    Google Scholar 

Muehldorf, E. I

  • Muehldorf, E. I., (1958) ‘Ternary Switching Algebras’.

    Google Scholar 

  • Muehldorf, E. I., (1959) ‘Multivalued Switching Algebras and Their Applications in Digital Systems’.

    Google Scholar 

Muller, H

  • Muller, H., (1970) ‘Arithmetische Operationen mit binarcodierten Ternarzahlen’ (with H. Haberlin).

    Google Scholar 

Murakami, K

  • Murakami, K., (1973) ‘Multiple-valued Variable-threshold Threshold Logic and Its Application to the Realization of the Set of Boolean Functions’ (with T. Aibara and Y. Takamatsu).

    Google Scholar 

  • Murakami, K., (1974) ‘Isobaricity for a Set of Multiple-valued Logical Functions and Its Application to the Synthesis of Multithreshold Elements’ (with Y. Takamatsu and T. Aibara).

    Google Scholar 

Murskij, V. L

  • Murskij, V. L., (1965) ‘Suščéstvovanié v tréhznačnoj logiké zamknutogo klassa s konéčnym bazisom, né iméúščego konéčnoj polnoj sistémy toždéstv’ ( The Existence in Three-valued Logic of a Closed Class with Finite Basis, Not Having a Finite Complete System of Identities).

    Google Scholar 

Muzio, J. C

  • Muzio, J. C., (1970) ‘A Decision Process for 3-valued Sheffer Functions. I’.

    Google Scholar 

  • Muzio, J. C., (1971) ‘A Decision Process for 3-valued Sheffer Functions. II’.

    Google Scholar 

  • Muzio, J. C., (1972) ‘On the t-closure Condition of Martin’.

    Google Scholar 

  • Muzio, J. C., (1973) ‘The Cosubstitution Condition’.

    Google Scholar 

  • Muzio, J. C., (1973a) ‘Some Large Classes of 3-valued Sheffer Functions’.

    Google Scholar 

  • Muzio, J. C., (1973b) ‘Decomposition of Ternary Switching Functions’.

    Google Scholar 

  • Muzio, J. C., (1974) ‘A Ternary Cellular Array’.

    Google Scholar 

Nadiu, Gh. S

  • Nadiu, G. S., (1967) ‘On a Method of Construction of a trivalent Lukasiewicz Algebra’ (Romanian).

    Google Scholar 

Nagaoka, Y

  • Nagaoka, Y., (1964) ‘Tunnel Diode Circuits for Ternary Logic’ (Japanese) (with Toshiharu Hasegawa and Yoshikazu Tezuka and Yoshiro Kasahara).

    Google Scholar 

Nagata, Shûrô

  • Nagata, S., (1966) ‘A Series of Successive Modifications of Peirce’s Rule’.

    Google Scholar 

  • Nagata, S., (1968) ‘Certain Method for Generating a Series of Logics’ (with Satoshi Miura).

    Google Scholar 

Nagle, H. T., Jr

  • Nagle, H. T., Jr. (1973) ‘An Approach to Multi-valued Sequential Logic’ (with T. A. Irving).

    Google Scholar 

  • Nagle, H. T., Jr. (1974) ‘On Multiple-valued Memory Elements’ (with S. G. Shiva).

    Google Scholar 

Nakamura, Akira

  • Nakamura, A., (1962c) ‘Tati ronri to sono kôrikei ni tuite’ (On the Many-valued Logics and an Axiomatic System for Them).

    Google Scholar 

  • Nakamura, A., (1962-64) ‘Yoso ronri to tati ronri no kanki ni tuite’ (On the Relation Between Modal Logic and Many-valued Logic).

    Google Scholar 

  • Nakamura, A., (1963c) ‘On a Simple Axiomatic System of the Infinitely Many-valued Logic Based on →’.

    Google Scholar 

  • Nakamura, A., (1965) ‘On the Infinitely Many-valued Double-threshold Logic’.

    Google Scholar 

Nakanishi, H

  • Nakanishi, H., (1972) ‘On Cyclic Multilevel Codes’ (with T. Asabe and Yoshikazu Tezuka).

    Google Scholar 

  • Nakanishi, H., (1972a) ‘Spectral Density of Cyclic Multilevel Code’ (with T. Asabe and Yoshikazu Tezuka).

    Google Scholar 

Nakasima, A

  • Nakasima, A., (1938) ‘The Theory of Equivalent Transformation of Simple Partial Path in the Relay Circuit’ (with M. Hanzawa).

    Google Scholar 

Nazarala, Jorge

  • Nazarala, J., (1974) ‘Minimal Realization of Ternary Threshold Function’ (with Claudio Moraga).

    Google Scholar 

Nečiporuk, E. I

  • Nečiporuk, E. I., (1969) ‘The Topological Principles of Autocorrection’ (Russian).

    Google Scholar 

Nguen Cat-Ho

  • Nguen C. H., (1972) ‘Generalized Algebras of Post and Their Applications to Infinitely Many-valued Logics with Infinitely Long Formulas’.

    Google Scholar 

  • Nguen C. H., (1973) ‘Generalized Post Algebras and Their Applications to Some Infinitary Many- valued Logics’.

    Google Scholar 

Nicolau, Edward

  • Nicolau, E., (1965) ‘Sinetza unei clase di automate care modeleazá operatori in logica n-valentă cu functii de timp date’.

    Google Scholar 

Noguchi, S

  • Noguchi, S., (1973) ‘Ternary Threshold Logic Networks Realizing Three-valued Multithreshold Functions’ (with A. Imamiya and J. Oizumi).

    Google Scholar 

Nomura, Nirosato

  • Nomura, N., (1969) ‘The Characterizing Parameters of Ternary Logical Functions and Their Applications to Threshold Logic’ (with Tadahiro Kitahashi and Yoshikazu Tezuka and Yoshiro Kasahara).

    Google Scholar 

  • Nomura, N., (1970) ‘Monotonicity of Ternary Logical Functions and Its Applications to the Analysis of Ternary Threshold Functions’ (Japanese) (with Tadahiro Kitahashi and Yoshikazu Kasahara and Yoshiro Kasahara).

    Google Scholar 

  • Nomura, N., (1972) ‘Learning of the Multi-thresh old Function and Its Application to the Synthesis of Logical Function’.

    Google Scholar 

  • Nomura, N., (1972a) ‘Some Properties of Monotonicity on Many-valued Logic and Their Applications to the Analysis of Many-valued Threshold Functions’.

    Google Scholar 

  • Nomura, N., (1973) ‘Characteristics Vectors of Many-valued Logical Functions and Their Applications to the Realization of Many-valued Threshold Functions’.

    Google Scholar 

Nutter, R. S

  • Nutter, R. S., (1971) ‘A Ternary Logic Minimization Technique’ (with Richard E. Swartwout).

    Google Scholar 

  • Nutter, R. S., (1972) ‘The Algebraic Simplification of a Ternary Full Adder’.

    Google Scholar 

O’Carroll, M. J

  • O’Carroll, M. J., (1967) ‘A Threevalued Non-levelled Logic Consistent for All Self-reference’.

    Google Scholar 

Ockham, William

  • Ockham, W., (1969) Predestination, God’s Foreknowledge and Future Contingents.

    Google Scholar 

Ohba, R

  • Ohba, R., (1968) ‘Some Properties of Mutually Connected Threshold Elements’.

    Google Scholar 

Ohya, Takemasa

  • Ohya, T., (1968) ‘Many-valued Logics Extended to Simple Type Theory’.

    Google Scholar 

Oizumi, J

  • Oizumi, J., (1973)‘Ternary Threshold Logic Networks Realizing Three-valued Multithreshold Functions’.

    Google Scholar 

Ojala, L

  • Ojala, L., (1972) ‘Some Applications of Many-valued Threshold Logic in Digital Arithmetic’ (with H. Koukunen).

    Google Scholar 

  • Ojala, L., (1972a) ‘Design of A/D Converters for Binary Coded Ternary Systems’ (with P. Yrjola).

    Google Scholar 

  • Ojala, L., (1973) ‘Design of Incremental Signal Processing Devices Using Binary Coded Ternary Logic’ (with P. Yrjola).

    Google Scholar 

Ono, Hiroakira

  • Ono, H., (1970) The Intermediate Logics on the Second Slice (with Tsutomu Hosoi).

    Google Scholar 

  • Ono, H., (1971) ‘Kripke Models and Intermediate Logics’.

    Google Scholar 

  • Ono, H., (1971–72)‘On the Finite Model Property for Kripke Models’.

    Google Scholar 

  • Ono, H., (1972) ‘Some Results on the Intermediate Logics’.

    Google Scholar 

  • Ono, H., (197+) ‘Intermediate Propositional Logics (A Survey)’.

    Google Scholar 

Ono, Katuzi

  • Ono, K., (1968) ‘A Remark on Peirce’s Rule in Many-valued Logics’.

    Google Scholar 

Orłowska, E

  • Orłowska, E., (1967) ‘Mechanical Proof Procedure for the n-valued Propositional Calculus’.

    Google Scholar 

Orsic, M

  • Orsic, M., (1972) ‘Multiple-valued Universal Logic Modules’.

    Google Scholar 

  • Orsic, M., (1973) ‘Incremental Curve Generator Using Multiple-valued Logic’.

    Google Scholar 

Ostapko, Daniel L

  • Ostapko, D. L., (1974) ‘A Practical Approach to Two-level Minimization of Multivalued Logic’.

    Google Scholar 

Ovsievic, B. L

  • Ovsievic, B. L., (1965) ‘Some Properties of Symmetric Functions of the Three-valued Logic’ (Russian).

    Google Scholar 

Page, E. W

  • Page, E. W., (1972) ‘Extension of the Boolean Difference Concept to Multivalued Logic Systems’ (with N. Bell and M. G. Thomason).

    Google Scholar 

Pahi, Biswambhar

  • Pahi, B., (1966) Studies in Implicational Calculi.

    Google Scholar 

  • Pahi, B., (1966a abstract) ‘On the Non-existence of Finite Characteristic Matrices for Some Implicational Calculi’.

    Google Scholar 

  • Pahi, B., (1971) ‘Some Results on Generalized Truth-tables’ (with Ralph C. Apple bee).

    Google Scholar 

  • Pahi, B., (1972) ‘Maximal Full Matrices’.

    Google Scholar 

  • Pahi, B., (1972a) ‘A Method for Proving the Non-existence of Finite Characteristic Models for Implicational Calculi’.

    Google Scholar 

  • Pahi, B., (1973) ‘Necessity and Some Non-modal Propositional Calculi’.

    Google Scholar 

  • Pahi, B., (1974) ‘On the Non-existence of Finite Characteristic Models for Some Classes of Implicational Calculi’.

    Google Scholar 

Pannier, Robert A

  • Pannier, R. A., (1970 abstract) ‘Axiomatic Systems and m-valued Calculi’.

    Google Scholar 

Parks, Ralph Zane, Jr

  • Parks, R. Z., Jr. (1971) The Mystery of Phi and Psi.

    Google Scholar 

  • Parks, R. Z., Jr. (1972) ‘A Note on R-mingle and Sobociński’s Three-valued Logic’.

    Google Scholar 

  • Parks, R. Z., Jr. (1972a) ‘Necessity and Ticket Entailment’ (with John R. Chidgey).

    Google Scholar 

  • Parks, R. Z., Jr. (1972b) ‘Dependence of Some Axioms of Rose’.

    Google Scholar 

  • Parks, R. Z., Jr. (1972c) ‘Independent Axioms for the Implicational Fragments of Sobocinski’s Three-valued Logic’ (with Robert K. Meyer).

    Google Scholar 

Pascual, M

  • Pascual, M., (1965) ‘A Ternary Storage Element Using a Conventional Ferrite Core’ (with J. Santos and H. Arango).

    Google Scholar 

  • Pascual, M., (1966) ‘Threshold Implementation of Ternary Systems’ (with H. Arango and M. E. Valentinuzzi and J. Santos).

    Google Scholar 

  • Pascual, M., (1970) ‘A Cyclic Algebra for the Synthesis of Ternary Digital Systems’ (with J. Santos and H. Arango and G. Roing).

    Google Scholar 

Patt, Y. N

  • Patt, Y. N., (1972) ‘Toward a Characterization of Logically Complete Switching Functions in k-valued Logic’ (with G. A. Cooper).

    Google Scholar 

Patzig, Günther

  • Patzig, G., (1973) ‘Aristotle, Lukasiewicz and the Origins of Many-valued Logic’.

    Google Scholar 

Perkowska, Eleonora

  • Perkowska, E., (1971) ‘Herbrand Theorem for Theories Based on m-valued Logics’.

    Google Scholar 

  • Perkowska, E., (1972) ‘On Algorithmic M-valued Logic’. (1972a) ‘On Algorithmic m-valued Logics’.

    Google Scholar 

Perlis, A. J

  • Perlis, A. J., (1959) ‘A Visit to Computation Centers in the Soviet Union’ (with J. W. A. Carr I II, J. E. Robertson and N. R. Scott ).

    Google Scholar 

Petcu, Alexandru

  • Petcu, A., (1968) ‘The Definition of the Trivalent Lukasiewicz Algebras by Three Equations’.

    Google Scholar 

Pichat, E

  • Pichat, E., (1973) ‘Minimal Representation of a Function of Several Finite Variables—Applications to Data Bank’ (with A. Cabanes).

    Google Scholar 

Piesch, H

  • Piesch, H., (1939) ‘Begriff der allgemeinen Schaltungstechnik’.

    Google Scholar 

Pinkava, V

  • Pinkava, V., (1971) ‘Logical Models of Sexual Deviations’.

    Google Scholar 

Pitts, W. S

  • Pitts, W. S., (1943) ‘A Logical Calculus of the Ideas Immanent in Nervous Activity’ (with W. S. McCulloch).

    Google Scholar 

Pogorzelski, Witold A

  • Pogorzelski, W. A., (1966) ‘Nota o modelach dwuwartościowej logiki implikacyjno-negacynej w wielo- wartosciowych logikach Łukasiewicza’.

    Google Scholar 

Pohm, A

  • Pohm, A., (1960) ‘Some Applications of Magnetic Film Parameters as Logical Devices’ (with R. Schaver and R. Stewart and A. Reid).

    Google Scholar 

Popov, V. A

  • Popov, V. A., (1973) ‘On the Number of Types of Systems of k-valued Logical Functions’ (Russian) (with I. T. Skibenko and N. G. Molkljak ).

    Google Scholar 

Popovici, Nicolae

  • Popovici, N., (1968) ‘On the Consensus Theory for the Trivalent Argument Functions’.

    Google Scholar 

Porat, D. I

Porębska, M. T

  • Porębska, M. T., (1974) ‘A Characterization of Fragments of the Intuitionistic Propositional Logic’ (with Andrzej Wronski).

    Google Scholar 

Porus, V. N

  • Porus, V. N., (1973) ‘On an Analytic Manner of Presentation of Many-valued Matrices’ (Russian).

    Google Scholar 

Pöschel, R

  • Pöschel, R., (1973) ‘Postsche Algebren von Funktionen uber einer Familie endlicher Mengen’.

    Google Scholar 

  • Pöschel, R., (1973a) ‘Postsche Algebren von Funktionen uber einer Familie endlicher Mengen’.

    Google Scholar 

Pospelov, D. A

  • Pospelov, D. A., (1969) ‘Introduction to Many-valued Logics’ (Russian) (with Ju. L. Ivas’kiv and Ž. Tošič).

    Google Scholar 

Pradhan, Dhiraj K

  • Pradhan, D. K., (1974) ‘A Multivalued Switching Algebra Based on Finite Fields’.

    Google Scholar 

Preparata, F. P

  • Preparata, F. P., (1971) ‘On a Theory of Continuously Valued Logic’ (with R. T. Yeh).

    Google Scholar 

  • Preparata, F. P., (1972) ‘Continuously Valued Logic’ (with R. T. Yeh).

    Google Scholar 

Prior, Arthur Norman

Programming Research Group

  • Programming Research Group (1954) ‘Preliminary Report, Specifications for the IBM Mathematical FORmula TRANslating System, FORTRAN’.

    Google Scholar 

Prost, K

  • Prost, K., (1973) ‘Threshold Logic Multiplier’ (with D. Hampel and L. Micheel).

    Google Scholar 

Prucnal, Tadeusz

  • Prucnal, T., (1966) ‘A Proof of Completeness of the Three-valued C-N Sentential Calculus of Łukasiewicz’.

    Google Scholar 

  • Prucnal, T., (1967) ‘Some Remarks on Three-valued Logic of J. Łukasiewicz’ (with Jerzy Shipecki and G. Bryll).

    Google Scholar 

  • Prucnal, T., (1967a) ‘A Proof of the Axiomatizability of Łukasiewicz’s Three-valued Implicational Propositional Calculus’ (Polish).

    Google Scholar 

  • Prucnal, T., (1974) ‘Interpretations of Classical Implicational Sentential Calculus in Nonclassical Implicational Calculi’.

    Google Scholar 

Purtill, Richard L

  • Purtill, R. L., (1970) ‘Four-valued Tables and Modal Logic’.

    Google Scholar 

Putnam, Hilary

  • Putnam, H., (1957) Eine Unableitbarkeitsbeweisemethode für den intuitionistischen Aussagenkalkül (with George Kreisel).

    Google Scholar 

  • Putnam, H., (1969) ‘Is Logic Empirical?’.

    Google Scholar 

Quine, Willard Van Orman

Rabinowicz, Z. L

  • Rabinowicz, Z. L., (1963) ‘A Class of Canonical Forms for the Representation of 3-valued Functions’ (with Yu. L. Ivas’kiv).

    Google Scholar 

Raca, M. F

  • Raca, M. F., (1965) ‘Class of Logic Functions Corresponding to the First Matrix of Jaśkowski’ (Russian).

    Google Scholar 

  • Raca, M. F., (1966) A Criterion of Functional Completeness in Logic Corresponding to the First Jaskowski Matrix’ (Russian).

    Google Scholar 

  • Raca, M. F., (1969) ‘The Class of Functions of Three-valued Logic that Corresponds to the First Matrix of Jaśkowski’ (Russian).

    Google Scholar 

  • Raca, M. F., (1970) ‘Functional Completeness in Certain Logics that are Intermediate Between the Classical and Intuitionistic Ones’ (Russian).

    Google Scholar 

Rasiowa, Helena

  • Rasiowa, H., (1969) ‘A Theorem on the Existence of Prime Filters in Post Algebras and the Completeness Theorem for Some Many-valued Predicate Calculi’.

    Google Scholar 

  • Rasiowa, H., (1970) ‘Ultraproducts of m-valued Models and a Generalization of the Löwenheim- Skolem-Gödel-Malcev Theorem for Theories Based on m-valued Logics’.

    Google Scholar 

  • Rasiowa, H., (1972) ‘The Craig Interpolation Theorem for m-valued Predicate Calculi’.

    Google Scholar 

  • Rasiowa, H., (1972a) ‘On Logical Structure of Programs’.

    Google Scholar 

  • Rasiowa, H., (1973) On a Logical Structure of Mixed-valued Programs and the ω+-valued Algorithmic Logic.

    Google Scholar 

  • Rasiowa, H., (1973a) ‘On Generalized Post Algebras of Order w+ and co + -valued Predicate Calculi’.

    Google Scholar 

  • Rasiowa, H., (1974) An Algebraic Approach to Non-classical Logics.

    Google Scholar 

  • Rasiowa, H., (197 +) ‘Post Algebras as a Semantic Foundation of Many-valued Logics’.

    Google Scholar 

Reichbach, Juliusz

  • Reichbach, J., (1963) ‘About Connection of the First-order Functional Calculus with Many-valued Propositional Calculi’.

    Google Scholar 

  • Reichbach, J., (1967) Boolean Many Valued Calculi with Quantifiers and a Homogeny Proof of Gödel- Skolem-Low enheim-Her brand’s Theorems.

    Google Scholar 

  • Reichbach, J., (1974) ‘Partitions in Decidability and Generalized Models with Many Valued Codes’.

    Google Scholar 

Reid, A

  • Reid, A., (1960) ‘Some Applications of Magnetic Film Parameters as Logical Devices’ (with R. Schauer and R. Stewart and A. Pohm).

    Google Scholar 

Rennie, Malcolm K

Rescher, Nicholas

  • Rescher, N., (1963) ‘A Probabilistic Approach to Modal Logic’.

    Google Scholar 

  • Rescher, N., (1968) Topics in Philosophical Logic.

    Google Scholar 

  • Rescher, N., (1969) Many-valued Logic.

    Google Scholar 

  • Rescher, N., (1969a abstract) ‘Autodescriptive Systems of Many-valued Logic’.

    Google Scholar 

Rine, David C

  • Rine, D. C., (1792) ‘A Proposed Multi-valued Extension to ALGOL 68’.

    Google Scholar 

  • Rine, D. C., (1972a) ‘A Proposed Multi-valued Extension to ALGOL 68’.

    Google Scholar 

  • Rine, D. C., (1973) ‘Basic Concepts of Multiple-discrete Valued Logic and Decision Theory’.

    Google Scholar 

  • Rine, D. C., (1973a) ‘Conditional and Post Algebra Expressions’.

    Google Scholar 

  • Rine, D. C., (1974) ‘There is More to Boolean Algebra than You Would Think’.

    Google Scholar 

  • Rine, D. C., (1974a) ‘The Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and Gideon Frieder).

    Google Scholar 

  • Rine, D. C., (1974b) ‘Multiple-valued Logic and Computer Science in the 20th Century’. (1974c) ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and Gideon Frieder).

    Google Scholar 

Rinon, S

  • Rinon, S., (1964) ‘Application of Ternary Algebra to the Study of Static Hazards’ (with Michael Yoeli).

    Google Scholar 

Robertson, J. E

  • Robertson, J. E., (1959) ‘A Visit to Computation Centers in the Soviet Union’ (with J. W. A. Carr III and A. J. Perlis and N. R. Scott).

    Google Scholar 

Rockingham Gill, Rowan R

  • Rockingham G. R. R., (1970) ‘The Craig-Lyndon Interpolation Theorem in 3-valued Logic’.

    Google Scholar 

Roesser, R

  • Roesser, R., (1971) ‘Multiple-real-valued Walsh Functions’ (with M. Liebler).

    Google Scholar 

  • Roesser, R., (1972) ‘Multivalued Logic Techniques for Optical Computers’.

    Google Scholar 

Roghinski, V. I

  • Roghinski, V. I., (1961) ‘Réléjnye shémy i mnogoznacinaa logika’ ( Relay Networks and Many-valued Logics’) (with T. D. Majstrova).

    Google Scholar 

Roing, G

  • Roing, G., (1970) ‘A Cyclic Algebra for the Synthesis of Ternary Digital Systems’ (with J. Santos and H. Arango and M. Pascual).

    Google Scholar 

Romov, B. A

  • Romov, B. A., (1969) Galois Theory for Post Algebras. I, IF (Russian) (with V. G. Bodnarcuk and L. A. Kalužnin and B. A. Romov ).

    Google Scholar 

  • Romov, B. A., (1971) ‘On Uniprimitive Bases of Maximal Post Subalgebras’ (Russian).

    Google Scholar 

Rose, Alan

  • Rose, A., (1956b) ‘Formalisations du calcul propositionnel implicatif a N0-valeurs de Lukasiewicz’.

    Google Scholar 

  • Rose, A., (I962g) ‘Remarque sur la machine universelle de Turing’.

    Google Scholar 

  • Rose, A., (1963) ‘A Formalisation of the Propositional Calculus Corresponding to Wang’s Calculus of Partial Predicates’.

    Google Scholar 

  • Rose, A., (1964a) ‘Formalisations de calculs propositionnels polyvalents à foncteurs variables’.

    Google Scholar 

  • Rose, A., (1965) ‘A Formalisation of Post’s m-valued Propositional Calculus with Variable Functors’.

    Google Scholar 

  • Rose, A., (1966 abstract) ‘A Formalisation of an Infinite-valued Propositional Calculus in Which the Truth-values are Lattice Ordered’.

    Google Scholar 

  • Rose, A., (1966a) ‘A Formalisation of the m-valued Lukasiewicz Implicational Propositional Calculus with Variable Functors’.

    Google Scholar 

  • Rose, A., (1966b) ‘Formalisation d’un calcul propositionnel a un nombre infini de valeurs, lesquelles forment un treillis’.

    Google Scholar 

  • Rose, A., (1966c) ‘Formalisation de certains calculs propositionnels polyvalents a foncteurs variables au cas certaines valeurs sont surdesignees’.

    Google Scholar 

  • Rose, A., (1966-68) ‘An Algebraic Model of the m-valued Propositional Calculus With Variable Functors’.

    Google Scholar 

  • Rose, A., (1967) ‘A Formalisation of the K0-valued Propositional Calculus With Variable Functors’.

    Google Scholar 

  • Rose, A., (1967a) ‘A Formalisation of the N0-valued Lukasiewicz Implicational Propositional Calculus With Variable Functors’.

    Google Scholar 

  • Rose, A., (1967b) ‘A Formalisation of the m-valued Lukasiewicz Propositional Calculus With Super-designated Truth-values’.

    Google Scholar 

  • Rose, A., (1967c) ‘Nouveau calcul de non-contradiction’.

    Google Scholar 

  • Rose, A., (1967d) Nouveau calcul de non-contradiction (methode alternative).

    Google Scholar 

  • Rose, A., (1968a) ‘Binary Generators for the m-valued and N-valued Lukasiewicz Propositional Calculi’.

    Google Scholar 

  • Rose, A., (1968b) ‘Formalisations of Some N0-valued Łukasiewicz Propositional Calculi’.

    Google Scholar 

  • Rose, A., (1969) ‘Single Generators for Henkinian Fragments of the 2-valued Propositional Calculus’.

    Google Scholar 

  • Rose, A., (1969a) ‘Nouvelle formalisations du calcul propositionnel a K0 valeurs de Lukasiewicz dans le cas ou il y a des foncteurs variables’.

    Google Scholar 

  • Rose, A., (1969b) ‘Some Many-valued Propositional Calculi Without Single Generators’.

    Google Scholar 

  • Rose, A., (1969c) ‘Sur les elements universels trivalentes de decision’.

    Google Scholar 

  • Rose, A., (1969d) ‘The Degree of Completeness for the m-valued Łukasiewicz Propositional Calculus, Correction and Addendum’.

    Google Scholar 

  • Rose, A., (1971) ‘Note sur la formalisation des calculs propositionnels polyvalent’.

    Google Scholar 

  • Rose, A., (1971a) ‘Sur certains foncteurs à m arguments des calculs propositionnels à m valeurs’.

    Google Scholar 

  • Rose, A., (1972) ‘Locally Full K0-valued Propositional Calculi’.

    Google Scholar 

  • Rose, A., (1973) ‘Sur certains “Erweiterter Aussagenkalkiil” dont le seul quantificateur primitif constitue son dual’.

    Google Scholar 

  • Rose, A., (1973a) Note sur 1 “Erweiterter Aussagenkalkiil” ayant un seul quantificateur primitif.

    Google Scholar 

Rosenberg, Ivo G

  • Rosenberg, I, G., (1965) ‘La structure des fonctions de plusieurs variables sur un ensemble fini’.

    Google Scholar 

  • Rosenberg, I, G., (1969) ‘Uber die Verschiedenheit maximaler Klassen in Pk.’

    Google Scholar 

  • Rosenberg, I, G., (1970) ‘Complete Sets for Finite Algebras’.

    Google Scholar 

  • Rosenberg, I, G., (1974) ‘Completeness, Closed Classes and Relations in Multiple-valued Logics’.

    Google Scholar 

Rosenberg, James

  • Rosenberg, J., (1969) ‘The Application of Ternary Semigroups to the Study of n-valued Sheffer Functions’.

    Google Scholar 

Rosenfeld, G

  • Rosenfeld, G., (1965) ‘Logical Design of Ternary Switching Circuits’ (with Michael Yoeli).

    Google Scholar 

Rousseau, George H

  • Rousseau, G. H., (1967) ‘Sequents in Many-valued Logic I’.

    Google Scholar 

  • Rousseau, G. H., (1967a) ‘Correction to “Sequents in Many-valued Logic I’”.

    Google Scholar 

  • Rousseau, G. H., (1968) ‘Note on a Problem of Porte’.

    Google Scholar 

  • Rousseau, G. H., (1969) ‘Logical Systems with Finitely Many Truth-values’.

    Google Scholar 

  • Rousseau, G. H., (1970) ‘Sequents in Many-valued Logic II’.

    Google Scholar 

  • Rousseau, G. H., (1970a) ‘Post Algebras and Pseudo-Post Algebras’.

    Google Scholar 

Routley, Richard

  • Routley, R., (1966) ‘On a Significance Theory’.

    Google Scholar 

  • Routley, R., (1968) ‘On Systems Containing Aristotle’s Thesis’ (with Hugh Montgomery).

    Google Scholar 

  • Routley, R., (1969) ‘The Need for Nonsense’.

    Google Scholar 

  • Routley, R., (1969a) ‘Categories—Expressions or Things?’ (with Valerie Routley).

    Google Scholar 

  • Routley, R., (1971) ‘Domainless Semantics for Free Quantification and Significance Logics’.

    Google Scholar 

  • Routley, R., (1973) The Logic of Significance and Context. Volume 1 (with Leonard Goddard).

    Google Scholar 

  • Routley, R., (1973a) ‘Don’t Care Was Made to Care’ (with Ross T. Brady).

    Google Scholar 

  • Routley, R., (197 +) ‘Universal Semantics?’.

    Google Scholar 

  • Routley, R., (197 + a) ‘No Rational Sentential Logic Has a Finite Characteristic Matrix’.

    Google Scholar 

Routley, Valerie

  • Routley, V., (1969) ‘Categories—Expressions or Things?’.

    Google Scholar 

Rowe, I

  • Rowe, I., (1972) ‘The Generation of Gaussian-distributed Pseudorandom Noise Sequences from Multiple-valued Logic’.

    Google Scholar 

Ruzsa, Imre

  • Ruzsa, I., (1969) ‘Random Models of Logical Systems. I: Models of Valuing Logics’.

    Google Scholar 

  • Ruzsa, I., (1970) ‘Random Models of Logical Systems. II: Models of Some Modal Logics’.

    Google Scholar 

  • Ruzsa, I., (1973) ‘Prior-type Modal Logic I’.

    Google Scholar 

  • Ruzsa, I., (1973a) ‘Prior-type Modal Logic II’.

    Google Scholar 

Rvačov, V. L

  • Rvačov, V. L., (1967) ‘Some Functionally Closed Classes of Functions in k-valued Logic’ (Russian) (with L. Ī. Škljarov).

    Google Scholar 

  • Rvačov, V. L., (1968) ‘Rk-functions’ (Ukrainian) (with L. Ī. Škljarov).

    Google Scholar 

  • Rvačov, V. L., (1971) ‘A Certain Extension of the Concept of R-function’ (Russian).

    Google Scholar 

Ryoichi, T

  • Ryoichi, T., (1954) ‘On Nine-valued Propositional Calculus’.

    Google Scholar 

Sade, Albert

  • Sade, S., (1969) ‘Fonctions propositionnelles monadiques dans la logique trivalente’.

    Google Scholar 

  • Sade, S., (1969a) ‘Algèbre de Łukasiewicz dans la logique trivalente’.

    Google Scholar 

  • Sade, S., (1969b) ‘Sur le premier système de Lukasiewicz’. Sadowski, Wactow

    Google Scholar 

  • Sade, S., (1964) ‘Dowod aksjomatyzowalności pewnych n-wartościowych rachunkow’ (Proof of Axiomatizability of Certain n-valued Propositional Calculi).

    Google Scholar 

Salomaa, Arto

  • Salomaa, A., (I960) ‘A Theorem Concerning the Composition of Functions of Several Variables Ranging Over a Finite Set’.

    Google Scholar 

  • Salomaa, A., (1960a) ‘On the Composition of Functions of Several Variables Ranging Over a Finite Set’.

    Google Scholar 

  • Salomaa, A., (1962) ‘Some Completeness Criteria for Sets of Functions Over a Finite Domain, I’.

    Google Scholar 

  • Salomaa, A., (1963) ‘Some Analogues of Sheffer Functions in Infinite-valued Logics’.

    Google Scholar 

  • Salomaa, A., (1963a) On Essential Variables of Functions, Especially in the Algebra of Logic.

    Google Scholar 

  • Salomaa, A., (1963b) On Basic Groups for the Set of Functions Over a Finite Domain.

    Google Scholar 

  • Salomaa, A., (1963c) ‘Some Completeness Criteria for Sets of Functions Over a Finite Domain, II’.

    Google Scholar 

  • Salomaa, A., (1974) ‘Some Remarks Concerning Many-valued Propositional Logics’. Saloni, Zygmunt

    Google Scholar 

  • Salomaa, A., (1972) ‘Gentzen Rules for the m-valued Logic’.

    Google Scholar 

  • Salomaa, A., (1973) ‘The Sequent Gentzen System for m-valued Logic’.

    Google Scholar 

Salter, F

  • Salter, F., (1964) ‘A Ternary-memory Element Using a Tunnel Diode’.

    Google Scholar 

Santos, J

  • Santos, J., (1964) ‘On the Analysis and Synthesis of 3-valued Digital Systems’ (with H. Arango).

    Google Scholar 

  • Santos, J., (1965) ‘A Ternary Storage Element Using a Conventional Ferrite Core’ (with H. Arango and M. Pascual).

    Google Scholar 

  • Santos, J., (1966) ‘Threshold Implementation of Ternary Systems’ (with H. Arango and M. Pascual and M. E. Valentinuzzi).

    Google Scholar 

  • Santos, J., (1970) ‘A Cyclic Algebra for the Synthesis of Ternary Digital Systems’ (with H. Arango and M. Pascual and G. Roing).

    Google Scholar 

Sarris, Achilles A

  • Sarris, A. A., (1972) ‘The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement’ (with Stephan Y. H. Su).

    Google Scholar 

  • Sarris, A. A., (1975) ‘Authors’ Reply’ (with Stephan Y. H. Su).

    Google Scholar 

Savicka, Halina

  • Savicka, H., (1971) ‘On Some Properties of Generalized Post Algebras’.

    Google Scholar 

  • Savicka, H., (1972) ‘On Some Properties of Post Algebras with Countable Chain of Constants’.

    Google Scholar 

Scharle, Thomas W

  • Scharle, T. W., (1971 abstract) ‘Completeness of Many-valued Protothetic’.

    Google Scholar 

Schauer, R

  • Schauer, R., (1960) ‘Some Applications of Magnetic Film Parametrons as Logical Devices’ (with R. Stewart and A. Pohm and A. Reid).

    Google Scholar 

Schock, Rolf

  • Schock, R., (1964a) ‘On Finitely Many-valued Logics’.

    Google Scholar 

  • Schock, R., (1964b) ‘On Denumerably Many-valued Logics’.

    Google Scholar 

  • Schock, R., (1965) ‘Some Theorems on the Relative Strengths of Many-valued Logic’. Schofield, Peter

    Google Scholar 

  • Schock, R., (1964) ‘On a Correspondence Between Many-valued and Two-valued Logics’.

    Google Scholar 

  • Schock, R., (1966) ‘Complete Subsets of Mappings Over a Finite Domain’.

    Google Scholar 

  • Schock, R., (1969) ‘Independent Conditions for Completeness of Finite Algebras With a Single Generator’.

    Google Scholar 

Schott, Hermann F

  • Schott, H. F., (1970) ‘Generalizability of the Propositional and Predicate Calculi to Infinite-valued Calculi’.

    Google Scholar 

Schröter, Karl

  • Schröter, K., (1955) ‘Methoden zu Axiomatisierung beliebiger Aussagen- und Prädikatenkalkiile’.

    Google Scholar 

Schuh, Edward

  • Schuh, E., (1973) ‘Many-valued Logics and the Lewis Paradoxes’.

    Google Scholar 

Schumm, George F

  • Schumm, G, F., (1969) ‘On Some Open Questions of B. Sobocinski’.

    Google Scholar 

Schwartz, J. T

  • Schwartz, J. T., (1972) ‘On Programming an Interim Report on the SETL Project’.

    Google Scholar 

Scott, Dana

  • Scott, D., (1973) ‘Background to Formalization’.

    Google Scholar 

  • Scott, D., (197 +) ‘Completeness and Axiomatizability in Many-valued Logic’.

    Google Scholar 

Scott, N. R

  • Scott, N. R., (1959) ‘A Visit to Computation Centers in the Soviet Union’ (with J. W. Carr I II, Alan J. Perlis and J. E. Robertson ).

    Google Scholar 

Scroggs, Schiller Joe

  • Scroggs, S. J., (1951) ‘Extensions of the Lewis System S5.’

    Google Scholar 

Sebastian, P

  • Sebastian, P., (1972) ‘Ternary Logic in Arithmetic Units’ (with Zvonko G. Vranesic).

    Google Scholar 

Sedra, A. S

  • Sedra, A. S., (1973) ‘Multi-threshold Circuits in the Design of Multi-state Storage Elements’ (with A. Druzeta).

    Google Scholar 

  • Sedra, A. S., (197 +) ‘Application of Multi-threshold Elements in the Realization of Many-valued Logic Networks’ (with Zvonko G. Vranesic and A. Druzeta).

    Google Scholar 

Seeskin, Kenneth R

  • Seeskin, K. R., (1971) ‘Many-valued Logic and Future Contingencies’.

    Google Scholar 

  • Seeskin, K. R., (1974) ‘Some Remarks on Truth and Bivalence’.

    Google Scholar 

Segerberg, Krister

  • Segerberg, K., (1965) ‘A Contribution to Nonsense-logic’.

    Google Scholar 

  • Segerberg, K., (1967) ‘Some Modal Logics Based on a Three-valued Logic’. Setlur, Rangaswamy V.

    Google Scholar 

  • Segerberg, K., (1971) ‘Duality in Finite Many-valued Logic’.

    Google Scholar 

  • Segerberg, K., (1974) ‘Multi-valued Algebraic Generalizations of Reed-Muller Canonical Forms’ (with K. L. Kodandapani).

    Google Scholar 

Serfati, Michel

Sette, A. M

Šeinbergas, I. M

  • Šeinbergas, I. M., (1970) ‘Simple Bases and the Number of Functions in Certain Post Classes’.

    Google Scholar 

Shen, Stewart N. T

  • Shen, S. N. T., (1974) ‘On the Boolean Functions Over 4-element Boolean Algebra’ (with Andy N. C. Kang).

    Google Scholar 

Šeper, Kajetan

  • Šeper, K., (1971) ‘A Decision Problem Concerning Autoduality in k-valued Logic’.

    Google Scholar 

Sheppard, D. A

  • Sheppard, D. A., (1973) ‘An Application of Many-valued Logic to Fault Detection’.

    Google Scholar 

Shestakov, V. I

  • Shestakov, V. I., (1941) Algébra dvujpolúsnyh shém, postroénnyh isklúčitel–no iz dvuhpolúsnikov (Algébra A-shem).

    Google Scholar 

  • Shestakov, V. I., (1960b) ‘O dvojnoj arifmétičéskoj intérpretacii tréhznačnogo isčislénia vyskazyvanij ispol’zvemoj pri modélirovanii etogo isčislénia posrédstvom réléjno-kommutatornyh shém’ (A Dual Arithmetic Interpretation of the 3-valued Propositional Calculus Utilized in the Simulation of This Calculus by Relay-contact Networks).

    Google Scholar 

  • Shestakov, V. I., (1964) ‘On the Relationship Between Certain Three-valued Logical Calculi’ (Russian). Shimada, Ryosaku

    Google Scholar 

  • Shestakov, V. I., (1970) ‘Permutations and Lattice Operations in Many Valued Logic’ (Japanese) (with Hisashi Mine).

    Google Scholar 

  • Shestakov, V. I., (1971) ‘Four Ternary Arithmetic Operations’ (with Hisashi Mine and Toshiharu Hasegawa).

    Google Scholar 

Shinahr, Ieka

  • Shinahr, I., (1967) ‘Groups Functions and Multi-valued Cellular Cascades’ (with Michael Yoeli).

    Google Scholar 

Shintani, T

  • Shintani, T., (1969) ‘Construction and Analysis of a Tri-stable Circuit and Its Application to Ternary Feedback Shift Register’ (with Hisashi Mine and Toshiharu Hasegawa and Yoshiahi Koga and M. Ideda).

    Google Scholar 

Shiva, S. G

  • Shiva, S. G., (1974) ‘On Multiple-valued Memory Elements’.

    Google Scholar 

Shoesmith, D. J

  • Shoesmith, D. J., (1971) ‘Deducibility of Many-valuedness’ (with Timothy J. Smiley).

    Google Scholar 

  • Shoesmith, D. J., (1973 abstract) ‘Proofs With Multiple Conclusions’ (with Timothy J. Smiley).

    Google Scholar 

Shukla, Anjan

Sicoe, Corneliu O

  • Sicoe, C. O., (1966) ‘Elements strict chrysippiene in algebre lukasiewiczienne polivalente’ (Strict Chrysippian Elements in Polyvalent Lukasiewicz Algebras).

    Google Scholar 

  • Sicoe, C. O., (1967) ‘Sur les idéaux des algèbres lukasiewiciennes polyvalentes’.

    Google Scholar 

  • Sicoe, C. O., (1967a) ‘On Many-valued Łukasiewicz Algebras’.

    Google Scholar 

  • Sicoe, C. O., (1967b) ‘A Characterization of Lukasiewiczian Algebra I’.

    Google Scholar 

  • Sicoe, C. O., (1967c) ‘A Characterization of Lukasiewiczian Algebra II’.

    Google Scholar 

  • Sicoe, C. O., (1967d) ‘Note supra algebrelor Lukasiewiczienne polivalente’.

    Google Scholar 

  • Sicoe, C. O., (1968) ‘Sur la définition des algèbres lukasiewicziennes polyvalentes’.

    Google Scholar 

Singer, F. Richard

  • Singer, F. R., (1967) ‘Some Sheffer Functions for m-valued Logics’.

    Google Scholar 

Singh, Inder

  • Singh, I., (1974) ‘Extensions of the Weiner-Smith Algorithm for m-ary Synchronous Sequential Circuit Design’ (with J. F. McDonald).

    Google Scholar 

Sintonen, L

  • Sintonen, L., (1972) ‘On the Realization of Functions in n-valued Logic’.

    Google Scholar 

Siosen, Frederic M

  • Siosen, F. M., (1965) ‘A Characterization of the Tautologies in the Many-valued Propositional Calculus’ (Spanish).

    Google Scholar 

Skibenko, I. T

  • Skibenko, I. T., (1973) ‘On the Number of Types of Systems of k-valued Logical Functions’ (Russian) (with V. A. Popov and N. G. Moklajak ).

    Google Scholar 

Škljarov, L. Ī

  • Škljarov, L. Ī., (1967) ‘Some Functionally Closed Classes of Functions in k-v alued Logic’ (Russian) (with V. L. Rvaćov).

    Google Scholar 

  • Rk-functions’ (Ukrainian) (with V. L. Rvaćov).

    Google Scholar 

Skolem, Thoralf

  • Skolem, T., (1929) ‘Über einige Grundlagenfragen der Mathematik’.

    Google Scholar 

  • Skolem, T., (1957a) ‘Mengenlehre gegriindet auf einer Logik mit unendlich vielen Wahrheitswerten’.

    Google Scholar 

  • Skolem, T., (1957b) ‘Bemerkungen zum Komprehensionsaxiom’.

    Google Scholar 

  • Skolem, T., (1960) ‘A Set Theory Based on a Certain 3-valued Logic’.

    Google Scholar 

  • Skolem, T., (1970) Selected Works in Logic.

    Google Scholar 

Skyrms, Brian T

  • Skyrms, B. T., (1970) ‘Return of the Liar: Three-valued Logic and the Concept of Truth’.

    Google Scholar 

  • Skyrms, B. T., (1970a) ‘Notes on Quantification and Self-reference’.

    Google Scholar 

Słupecki, Jerzy

  • Słupecki, J., (1967) ‘Some Remarks on Three-valued Logic of J. Łukasiewicz’ (with G. Bryll and Tadeusz Prucnal).

    Google Scholar 

  • Słupecki, J., (1971) ‘Proof of Axiomatizability of Full Many-valued Systems of Calculus of Propositions’.

    Google Scholar 

  • Słupecki, J., (1972) ‘A Criterion of Fullness of Many-valued Systems of Propositional Logic’.

    Google Scholar 

Smiley, Timothy John

  • Smiley, T. J., (1961) ‘On Łukasiewicz’s Ł-modal System’.

    Google Scholar 

  • Smiley, T. J., (1971) ‘Deducibility and Many-valuedness’ (with D. J. Shoesmith).

    Google Scholar 

  • Smiley, T. J., (1973 abstract) ‘Proofs With Multiple Conclusions’ (with D. J. Shoesmith).

    Google Scholar 

Smith, Kenneth C

  • Smith, K.C., (1970) ‘A Many-valued Algebra for Switching Systems’ (with Zvonko G. Vranesic and E. S. Lee).

    Google Scholar 

  • Smith, K.C., (1971) ‘Circuit Implementations of Multivalued Logic’ (with Zvonko G. Vranesic and L. Janczewski).

    Google Scholar 

  • Smith, K.C., (1974) ‘Engineering Aspects of Multi-valued Logic Systems’ (with Zvonko G. Vranesic).

    Google Scholar 

  • Smith, K.C., (1974a) ‘Electronic Implementation of Multi-valued Logic Networks’ (with Zvonko G. Vranesic and A. Druzeta).

    Google Scholar 

Smith, William R., III

  • Smith, W. R., III (1972) ‘Some Algebraic Properties and Minimization Techniques for Multi-valued Lattice Logics’.

    Google Scholar 

  • Smith, W. R., III (1974) ‘Minimization of Multivalued Functions’.

    Google Scholar 

Snelsire, R. W

  • Snelsire, R. W., (1968) Final Report on the Design of Multiple-valued Logic Systems (with Donald D. Givone).

    Google Scholar 

Sobocinski, Boleslaw

  • Sobocinski, B., (1964) ‘On the Propositional System A of Vučković and Its Extension. I.’

    Google Scholar 

  • Sobocinski, B., (1964a) ‘On the Propositional System A of Vučković and Its Extension. IF.’

    Google Scholar 

Sokolov, V. A

  • Sokolov, V. A., (1971) ‘Remarks on the Class of Partial Functions of Countably-valued Logic’ (Russian).

    Google Scholar 

Soloduhin, Ju. N

  • Soloduhin, J. N., (1970) ‘A Concept of Function-analogue and a Criterion for Functional Incompleteness of Systems of Many-valued Logic’ (Russian).

    Google Scholar 

Sosinskiĭ, L. M

  • Sosinskiĭ, L. M (1964) ‘On the Representation of Functions by Irreversible Superpositions in Three- valued Logic’ (Russian).

    Google Scholar 

Spade, Paul Vincent

  • Spade, P. V., (197 +) ‘An Alternative to Brian Skyrms Approach to the Liar’.

    Google Scholar 

Spasowski, Maciej

  • Spasowski, M., (1972) ‘Dual Counterparts of Łukasiewicz Sentential Calculi’ (with Grzegorz Malinowski).

    Google Scholar 

  • Spasowski, M., (1974) ‘Dual Counterparts of Lukasiewicz’s Sentential Calculi’ (with Grzegorz Malinowski).

    Google Scholar 

Stewart, R

  • Stewart, R., (1960) ’Some Applications of Magnetic Film Parametrons as Logical Devices’ (with R. Schauer and A. Pohm and A. Reid).

    Google Scholar 

Stiver, James LeRoy

  • Stiver, J. L. R. (1972) Presupposition, Implication, and Necessitation: A Critique of and Alternative to van Fraassen’s Presuppositional Logic.

    Google Scholar 

Stojaković, M

  • Stojaković, M., (1966) ‘Matrizeninversion in der algebraischen Theorie der Wahrheitsfunktionen der mehrwertigen Logik’.

    Google Scholar 

  • Stojaković, M., (1972) ‘On the Exponential Properties of the Implication’.

    Google Scholar 

Strasilla, Udo J

  • Strasilla, U, J., (1974) ‘A Multiple-valued Memory System Using Capacitor Storage’.

    Google Scholar 

Su, Stephan Y. H

  • Su, S. Y. H., (1971) ‘Algebraic Properties of Multi-valued Symmetric Switching Functions’ (with Peter T. Cheung).

    Google Scholar 

  • Su, S. Y. H., (1971a) ‘Computer-oriented Algorithm for Minimizing Multi-valued Switching Functions’ (with Peter T. Cheung).

    Google Scholar 

  • Su, S. Y. H., (1972) ‘The Relationship Between Multivalued Algebra and Boolean Algebra Under Different Definitions of Complement’ (with Achilles A. Sarris).

    Google Scholar 

  • Su, S. Y. H., (1972a) ‘Computer Minimization of Multi-valued Switching Functions’ (with Peter T. Cheung).

    Google Scholar 

  • Su, S. Y. H., (1974) ‘Application of a Multivalued Gate to the Design of Fault-tolerant Digital Systems’ (with Edgar G. DuCasse).

    Google Scholar 

  • Su, S. Y. H., (1975) ‘Authors’ Reply’ (with Achilles A. Sarris).

    Google Scholar 

Suchoń, Wojciech

  • Suchoń, W., (1972) ‘On Non-equivalence of Two Definitions of the Algebras of Łukasiewicz’.

    Google Scholar 

  • Suchoń, W., (1972a) ‘Non-equivalence of Certain Definitions of Infinite Łukasiewicz Algebras’.

    Google Scholar 

  • Suchoń, W., (1972b) ‘Inéquivalence des deux définitions des algèbres de Łukasiewicz’.

    Google Scholar 

  • Suchoń, W., (1973) ‘Application of the Theory of Logical Matrices in the Independence Proofs’.

    Google Scholar 

  • Suchoń, W., (1973a) ‘On Defining Moisil Functors in n-valued Łukasiewicz Propositional Logic’.

    Google Scholar 

  • Suchoń, W., (1974) ‘La méthode de Smullyan de construire le calcul n-valent de Lukasiewicz avec implication et négation’.

    Google Scholar 

  • Suchoń, W., (1974a) ‘Définition des foncteurs modaux de Moisil dans le calcul n-valent des propositions de Łukasiewicz avec implication et négation’.

    Google Scholar 

  • Suchoń, W., (1974b) ‘Matrix Łukasiewicz Algebras’.

    Google Scholar 

  • Suchoń, W., (197 +) ‘Matrix Łukasiewicz Algebras’.

    Google Scholar 

Sugihara, Takeo

  • Sugihara, T., (1964) Yòsô ronrigaku kenkyû ( AStudy on Modal Logic).

    Google Scholar 

  • Sugihara, T., (1964a) ‘Sequential Truth-functions’.

    Google Scholar 

Surma, Stanisfaw J

  • Surma, S. J., (1971) ‘Jaskowski’s Matrix Criterion for the Intuitionistic Propositional Calculus’.

    Google Scholar 

  • Surma, S. J., (1973 abstract) ‘A Method of the Construction of Łukasiewiczian Algebras and Its Application to Gentzen-style Characterization of Łukasiewiczian Logics’.

    Google Scholar 

  • Surma, S. J., (1973a) ‘Jaśkowski’s Matrix Criterion for the Intuitionistic Propositional Calculus’.

    Google Scholar 

  • Surma, S. J., (1973b) ‘Nota w sprawie twierdzeń o dedukcji nie wprostwaznych w skończenie wielwartościonych rachunkach zdań Łukasiewicza’ (A Note on Indirect Deduction Theorems Valid in Lukasiewiczs Finitely-valued Propositional Calculi).

    Google Scholar 

  • Surma, S. J., (1974) ‘A Method of the Construction of Finite Łukasiewiczian Algebras and Its Application to a Gentzen-stile Characterization of Finite Logics’.

    Google Scholar 

  • Surma, S. J., (1974a) ‘On Jaśkowski-style Semantics for the Intuitionistic Propositional Calculi’ (with Andrzej Wronski and S. Zachorowski).

    Google Scholar 

  • Surma, S. J., (1974b) ‘An Algorithm for Axiomatizing Every Finite Logic’.

    Google Scholar 

  • Surma, S. J., (1974c) ‘An Algorithm for Axiomatizing Every Finite Logic’.

    Google Scholar 

Susskind, A

  • Susskind, A., (1971) ‘Building Blocks and Synthesis Techniques for the Realization of m-ary Combinational Switching Functions’ (with C. Ying).

    Google Scholar 

Suszko, Roman

  • Suszko, R., (1957) ‘A Formal Theory of the Logical Values. 1’ (Polish).

    Google Scholar 

Swartwout, Richard E

  • Swartwout, R. E., (1971) ‘A Ternary Logic Minimization Technique’ (with R. S. Nutter).

    Google Scholar 

  • Swartwout, R. E., (1972) ‘The Combination of a Soft and Multi-valued Algebra’.

    Google Scholar 

Szczech, Wfadysiaw

  • Szczech, W., (1973) ‘Axiomatizability of Finite Matrices’.

    Google Scholar 

Tahara, Michio

  • Tahara, M., (1970) ‘Functional Completeness and Polyphecks in 3-valued Logic’ (Japanese) (with Sueo Tanaka).

    Google Scholar 

Takahashi, Moto-o

  • Takahashi, M., (1968) Many-valued Logics of Extended Gentzen Style V.

    Google Scholar 

  • Takahashi, M., (1970) ‘Continuous λ-Є Logics’.

    Google Scholar 

  • Takahashi, M., (1970a) ‘Many-valued Logics of Extended Gentzen Style IF.’

    Google Scholar 

  • Takahashi, M., (1971 abstract) ‘On the Consistency of the Comprehension Axiom in Continuous Logic’.

    Google Scholar 

Takamatsu, Y

  • Takamatsu, Y., (1973) ‘Multiple-valued Variable-threshold Threshold Logic and Its Application to the Realization of the Set of Boolean Functions’ (with T. Aibara and K. Murakami).

    Google Scholar 

  • Takamatsu, Y., (1974) ‘Isobaricity for a Set of Multiple-valued Logical Functions and Its Application to the Synthesis of Multithreshold Elements’ (with K. Murakami and T. Aibara).

    Google Scholar 

Takaoka, T

  • Takaoka, T., (1971) ‘A Construction Method of Fail-safe Systems for Many-valued Logic’.

    Google Scholar 

Tallet, Jorge

  • Tallet, J., (1970) ‘On the Symmetry of Many-valued Logical Systems’.

    Google Scholar 

Tamura, Saburo

  • Tamura, S., (197 +) ‘A Sequential Formulation for Sobocinski’s Three-valued Logic’.

    Google Scholar 

Tanaka, Kokichi

  • Tanaka, K., (1971) ‘Homomorphisms of Logical Functions and Their Applications’ (with Y. Fujita and Tadahiro Kitahashi).

    Google Scholar 

  • Tanaka, K., (1971a) ‘An Orthogonal Expansion of Multiple-valued Logical Functions’ (with Tadahiro Kitahashi).

    Google Scholar 

  • Tanaka, K., (1972) ‘A Consideration on Compositions of Many-valued Logical Functions’ (with Y. Fujita and Tadahiro Kitahashi).

    Google Scholar 

  • Tanaka, K., (1972a) ‘An Extension of the Theorem of Isomorphism Concerning the Compositions of Many-valued Switching Functions’ (with Y. Fujita and Tadahiro Kitahashi).

    Google Scholar 

  • Tanaka, K., (1972b) ‘General Formulation of Formal Grammars’ (with M. Mizumoto and J. Toyoda).

    Google Scholar 

Tanaka, Shôtarô

  • Tanaka, S., (1966) ‘A Pentavalued Logic and Its Algebraic Theory’ (with Kiyoshi Iseki).

    Google Scholar 

Tanaka, Sueo

  • Tanaka, S., (1970) ‘Functional Completeness and Polyphecks in 3-valued Logic’ (Japanese) (with Michio Tahara).

    Google Scholar 

Tarasov, A. A

  • Tarasov, A. A., (1972) ‘Certain Properties of the Essential Function of k-valued Logic’ (Russian).

    Google Scholar 

Tarski, Alfred

  • Tarski, A., (1930) Untersuchungen uber den Aussagenkalkül (with Jan Łukasiewicz).

    Google Scholar 

Tauts, A

  • Tauts, A., (1967) ‘The Definition of Truth Values as Formulae’ (Russian).

    Google Scholar 

  • Tauts, A., (1969) ‘Nonregular First Order Predicate Calculus’ (Russian).

    Google Scholar 

Termini, S

  • Termini, S., (1972) ‘Algebraic Properties of Fuzzy Sets’ (with A. de Lucca).

    Google Scholar 

Tezuka, Yoshikazu

  • Tezuka, Y., (1964) ‘Tunnel Diode Circuit for Ternary Logic’ (Japanese) (with Toshiharu Hasegawa and Y. Nagaoka and Yoshiro Kasahara).

    Google Scholar 

  • Tezuka, Y., (1969) ‘The Characterizing Parameters of Ternary Logical Functions and Their Applications to Threshold Logical Functions’ (with Tadahiro Kitahashi and Hirosato Nomura and Yoshiro Kasahara).

    Google Scholar 

  • Tezuka, Y., (1970) ‘Monotonicity of Ternary Logical Functions and Its Applications to the Analysis of Ternary Threshold Functions’ (Japanese) (with Tadahiro Kitahashi and Yoshiro Kasahara and Hirosato Nomura).

    Google Scholar 

  • Tezuka, Y., (1972) ‘Multilevel Balanced Code With Redundant Digits’ (with T. Asabe).

    Google Scholar 

  • Tezuka, Y., (1972a) ‘On Cyclic Multilevel Codes’ (with T. Asabe and H. Nakanishi).

    Google Scholar 

  • Tezuka, Y., (1972b) ‘Spectral Density of Cyclic Multilevel Code’ (with T. Asabe and H. Nakanishi).

    Google Scholar 

Thelliez, S. F

  • Thelliez, S. F., (1966) ‘Simulateur de circuits logiques ternaires’.

    Google Scholar 

  • Thelliez, S. F., (1966a) ‘Theorie de la decomposition appliquee a la logique ternaire’.

    Google Scholar 

  • Thelliez, S. F., (1971) ‘Problems Related to Ternary Sequential Switching Networks Synthesis’.

    Google Scholar 

  • Thelliez, S. F., (1973) Introduction a letude des structures ternaires de commutation.

    Google Scholar 

Thiele, Helmut

  • Thiele, H., (1958) ‘Theorie der endlich-wertigen Łukasiewiczschen Prädikatenkalkule der ersten Stufe’.

    Google Scholar 

Thomas, Ivo

  • Thomas, I., (1962) ‘On the Infinity of Positive Logic’.

    Google Scholar 

  • Thomas, I., (1962a) ‘Finite Limitations on Dummett’s LC.’

    Google Scholar 

  • Thomas, I., (1967) ‘Three-valued Propositional Fragments With Classical Implication’.

    Google Scholar 

Thomason, M. G

  • Thomason, M. G., (1972) ‘Extension of the Boolean Difference Concept to Multi-valued Logic Systems’ (with N. Bell and E. W. Page).

    Google Scholar 

Thomason, Richmond Hunt

  • Thomason, R. H., (1970) ‘Indeterminist Time and Truth-value Gaps’.

    Google Scholar 

Tien, P. S

  • Tien, P. S., (1971) ‘The Analysis and Synthesis of Fuzzy Switching Circuits’.

    Google Scholar 

Tishulina, A. M

  • Tishulina, A. M., (1962) ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with N. P. Brusentzov and Y. A. Zhogolev and V. V. Verigin and S. P. Maslov ).

    Google Scholar 

Tokarz, Marek

  • Tokarz, M., (1971) ‘The Problem of Reconstructability of Propositional Calculi’ (with Ryszard Wójcicki).

    Google Scholar 

  • Tokarz, M., (1972) ‘On Invariant Systems and Structural Completeness of Łukasiewicz’s Logics’.

    Google Scholar 

  • Tokarz, M., (1972a) ‘Invariant Systems of Łukasiewicz Calculi’.

    Google Scholar 

  • Tokarz, M., (1972b) ‘On Structural Completeness of Łukasiewicz’s Logics’.

    Google Scholar 

  • Tokarz, M., (1974) ‘Binary Functions Definable in Implicational Godel Algebras’.

    Google Scholar 

  • Tokarz, M., (1974a) ‘A Method of Axiomatization of Łukasiewicz Logics’.

    Google Scholar 

  • Tokarz, M., (1974b) ‘A New Proof of “Topographic” Theorem on Łukasiewiczs Logics’.

    Google Scholar 

  • Tokarz, M., (1974c) ‘Invariant Systems of Łukasiewicz Logics’.

    Google Scholar 

Tolstova, Yu. M

  • Tolstova, Y. M., (1967) ‘Modelling I-valued Logic in k-valued Logic (k > 1)’ (Russian).

    Google Scholar 

Tošič, Živko

  • Tošič, Ž., (1969) ‘Description of Many-valued Logics’ (Russian) (with Ju. L. Ivs’kiv and D. A. Pospelov).

    Google Scholar 

  • Tošič, Ž., (1972) ‘Analytical Representations of m-valued Logical Functions Over the Ring of Integers modulo M.’

    Google Scholar 

Toyoda, J

  • Toyoda, J., (1972) ‘General Formulation of Formal Grammars’ (with M. Mizumoto and Kikochi Tanaka).

    Google Scholar 

Traczyk, Tadeusz

  • Traczyk, T., (1962) ‘On Axioms and Some Properties of Post Algebras’.

    Google Scholar 

  • Traczyk, T., (1963) ‘Some Theorems on Independence in Post Algebras’.

    Google Scholar 

  • Traczyk, T., (1963a) ‘Axioms and Some Properties of Post Algebras’.

    Google Scholar 

  • Traczyk, T., (1964) ‘A Generalization of Loomis-Sikorski’s Theorem’.

    Google Scholar 

  • Traczyk, T., (1964a) ‘An Equational Definition of a Class of Post Algebras’.

    Google Scholar 

  • Traczyk, T., (1965) ‘Weak Isomorphism of Boolean and Post Algebras’.

    Google Scholar 

  • Traczyk, T., (1967) ‘On Post Algebras With Uncountable Chain of Constants. Algebras of Homomorphisms’.

    Google Scholar 

  • Traczyk, T., (1968) ‘Prime Ideals in Generalized Post Algebras’.

    Google Scholar 

  • Traczyk, T., (1969) ‘Generalized Lukasiewicz Algebras’ (with W. Marek).

    Google Scholar 

Troelstra, Anne Sjerp

  • Troelstra, A. S., (1965) ‘On Intermediate Propositional Logics’.

    Google Scholar 

Tsichritzis, D

  • Tsichritzis, D., (1973) ‘Approximate Logic’.

    Google Scholar 

  • Tsichritzis, D., (1966) ‘Decomposition of Group Functions With Applications to Two Rail Cascades’ (with Michael Yoeli).

    Google Scholar 

Turquette, Atwell Rufus

  • Turquette, A. R., (1943) A Study and Extension of M-valued Logics.

    Google Scholar 

  • Turquette, A. R., (1963a) ‘Modality, Minimality, and Many-valuedness’.

    Google Scholar 

  • Turquette, A. R., (1966) ‘A Method for Constructing Implication Logics’.

    Google Scholar 

  • Turquette, A. R., (1966a) ‘Peirce’s Triadic Logic’ (with Max Fisch).

    Google Scholar 

  • Turquette, A. R., (1967) ‘Peirce’s Phi and Psi Operators for Triadic Logic’.

    Google Scholar 

  • Turquette, A. R., (1968) ‘Dualizable Quasi-strokes for ra-state Automata’.

    Google Scholar 

  • Turquette, A. R., (1969) ‘Generalizable Kleene Logics’.

    Google Scholar 

  • Turquette, A. R., (1969a) ‘Peirce’s Complete System of Triadic Logic’.

    Google Scholar 

  • Turquette, A. R., (1971 abstract) ‘Peirce’s ø and Ψ Operators for Triadic Logic’.

    Google Scholar 

  • Turquette, A. R., (1972) ‘Generalized Modal Sets’.

    Google Scholar 

Ulrich, Dolph Edward

  • Ulrich, D. E., (1967) Matrices for Sentential Calculi.

    Google Scholar 

  • Ulrich, D. E., (1970 abstract) ‘Decidability Results for Some Classes of Propositional Calculi’.

    Google Scholar 

  • Ulrich, D. E., (1972) ‘Some Results Concerning Finite Models for Sentential Calculi’.

    Google Scholar 

  • Ulrich, D. E., (1974 abstract) ‘Subsystems of S6, and a Conjecture of Prior’s’.

    Google Scholar 

  • Ulrich, D. E., (197 +) ‘The Non-existence of Finite Characteristic Matrices for Subsystems of RI’.

    Google Scholar 

Umezawa, Toshio

  • Umezawa, T., (1959a) ‘On Logics Intermediate Between Intuitionistic and Classical Predicate Logic’.

    Google Scholar 

Urquhart, Alasdair Ian Fenton

  • Urquhart, A. I. F., (1971) Temporal Logic (with Nicholas Rescher).

    Google Scholar 

  • Urquhart, A. I. F., (1973) The Semantics of Entailment.

    Google Scholar 

  • Urquhart, A. I. F., (1973a) ‘An Interpretation of Many-valued Logic’.

    Google Scholar 

Ušan, Janez

  • Ušan, J., (1965) ‘Definition of a Constructability in Algebraic Systems With Finite Sets (Partial and Many-valued) of n-operations and Some of Their Properties’ (Serbo-Croatian).

    Google Scholar 

Vakarelov, Dimitǎr I

  • Vakarelov, D. I., (1970) ‘The Concept of Dogma and Some Systems of Many-valued Logic’ (Russian).

    Google Scholar 

  • Vakarelov, D. I., (1972) ‘Note on the Semantics of the Łukasiewiczs 3-valued Logic’ (Russian).

    Google Scholar 

Valentuzzi, M. E

  • Valentuzzi, M. E., (1966) ‘Threshold Implementation of Ternary Systems’ (with H. Arango and M. Pascual and J. Santos).

    Google Scholar 

van Fraassen, Bas C

  • van Fraassen, B. C., (1966) ‘Singular Terms, Truth-value Gaps, and Free Logic’.

    Google Scholar 

  • van Fraassen, B. C., (1968) ‘Presuppositions, Implication, and Self-reference’.

    Google Scholar 

  • van Fraassen, B. C., (1969) ‘Presuppositions, Supervaluations, and Free Logic’.

    Google Scholar 

  • van Fraassen, B. C., (1970) ‘Truth and Paradoxical Consequences’.

    Google Scholar 

  • van Fraassen, B. C., (1970a) ‘Rejoinder: On a Kantian Conception of Language’.

    Google Scholar 

  • van Fraassen, B. C., (1971) Formal Semantics and Logic.

    Google Scholar 

  • van Fraassen, B. C., (1974) ‘The Labyrinth of Quantum Logics’.

    Google Scholar 

Vander Nat, Arnold

  • Vander Nat, A., (1969) ‘The System S9’ (with Storrs McCall).

    Google Scholar 

  • Vander Nat, A., (1972) ‘Axiomatic, Sequenzen-Kalkul, and Subordinate Proof Versions of S9’.

    Google Scholar 

Varlet, J. C

  • Varlet, J. C., (1968) ‘Algèbres de Lukasiewicz trivalentes’.

    Google Scholar 

  • Varlet, J. C., (1969) ‘Considerations sur les algebres de Lukasiewicz trivalentes’.

    Google Scholar 

Varśavskiĭ, V. I

  • Varśavskiĭ, V. I., (1965) ‘Functional Divisibility in Three-valued Logic’ (Russian).

    Google Scholar 

  • Varśavskiĭ, V. I., (1969) ‘A Majority Operation in Many-valued Logic’ (Russian).

    Google Scholar 

Verigin, V. V

  • Verigin, V. V., (1962) ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with N. P. Brusentzov and Y. A. Zhogolev and S. P. Maslov and A. M. Tishulina).

    Google Scholar 

Villa, Giovanni

  • Villa, G., (1970) ‘Calcola proposizionale trivalente dia lettico’.

    Google Scholar 

Višin, V. V

  • Višin, V. V., (1963) ‘Toždésvénnyé préobrazovaniá v četyréhznaćnoj logiké’ (Identical Transformations in Four-place Logic).

    Google Scholar 

Vraciu, Constantin

  • Vraciu, C., (1969) W-valued Centered Lukasiewicz Algebras’ (with George Georgescu).

    Google Scholar 

  • Vraciu, C., (1969a) ‘Le spectre maximal d’une algebre de Lukasiewicz’ (with George Georgescu).

    Google Scholar 

  • Vraciu, C., (1969b) ‘Sur les algebres de Lukasiewicz centrees’ (with George Georgescu).

    Google Scholar 

  • Vraciu, C., (1969c) ‘Sur le spectre maximal dune algebre de Lukasiewicz’ (with George Georgescu).

    Google Scholar 

  • Vraciu, C., (1969d) ‘Sur les epimorphismes centrees des algebres de Lukasiewicz’ (with George Georgescu).

    Google Scholar 

  • Vraciu, C., (1970) ‘On the Characterization of Centered Lukasiewicz Algebras’ (with George Georgescu).

    Google Scholar 

  • Vraciu, C., (1971) ‘Algebre Lukasiewicz monadice’ (with George Georgescu).

    Google Scholar 

  • Vraciu, C., (197 +) ‘La dualite des algebres de Post 0-valentes’ (with George Georgescu).

    Google Scholar 

  • Vranesic, Z. G., (1970) ‘A Many-valued Algebra for Switching Systems’ (with E. S. Lee and Kenneth C. Smith).

    Google Scholar 

  • Vranesic, Z. G., (1971) ‘Multivalued versus Binary High Speed Multipliers’ (with H. C. Hamacher).

    Google Scholar 

  • Vranesic, Z. G., (1971a) ‘Application of Multi-valued Cyclic Codes’ (with K. A. El Ayat).

    Google Scholar 

  • Vranesic, Z. G., (1971b) ‘Circuit Implementations of Multivalued Logic’ (with Kenneth C. Smith and L. Janczewski).

    Google Scholar 

  • Vranesic, Z. G., (1972) ‘Ternary Logic in Arithmetic Units’ (with P. Sebastian).

    Google Scholar 

  • Vranesic, Z. G., (1972a) ‘Ternary Logic in Parallel Multipliers’ (with H. C. Hamacher).

    Google Scholar 

  • Vranesic, Z. G., (1974) ‘Engineering Aspects of Multi-valued Logic Systems’ (with Kenneth C. Smith).

    Google Scholar 

  • Vranesic, Z. G., (1974a) ‘Multiple-valued Pseudorandom Number Generators’ (with C. I. Lam).

    Google Scholar 

  • Vranesic, Z. G., (1974b) ‘Electronic Implementation of Multi-valued Logic Networks’ (with Kenneth C. Smith and A. Druzeta).

    Google Scholar 

  • Vranesic, Z. G., (197+) ‘Application of Multi-threshold Elements in the Realization of Many-valued Logic Networks’ (with A. Druzeta and A. S. Sedra).

    Google Scholar 

Vučković, Vladeta

  • Vučković, V., (1967) Recursive Models for Three-valued Propositional Calculi With Classical Implication.

    Google Scholar 

  • Vučković, V., (1967a) ‘A Recursive Model for the Extended System A of B. Sobociński’.

    Google Scholar 

Walliuzzaman, K. M

  • Walliuzzaman, K. M., (1969) Multi-stage Implementation of Multi-valued Switching Functions.

    Google Scholar 

Watanabe, Syozo

  • Watanabe, S., (1974 abstract) ‘Many-valued Prosthetics’.

    Google Scholar 

Weaver, George

  • Weaver, G., (1974) ‘A Strong Completeness Theorem for 3-valued Logic’ (with H. Goldberg and Hugues Leblanc).

    Google Scholar 

Webb, Donald L

  • Webb, D. L., (1936c) Many-valued Logic.

    Google Scholar 

  • Webb, D. L., (1938 abstract) ‘A Set of Postulates for an Algebra of n-valued Logic’.

    Google Scholar 

Wee, William G

  • Wee, W. G., (1969) ‘A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems’ (with K. S. Fu).

    Google Scholar 

Węglorz, B

  • Węglorz, B., (1970) ‘A Representation Theorem for Post-like Algebras’.

    Google Scholar 

Wenver, J. L

  • Wenver, J. L., (1964) ‘Nonlinear Hall-effects Ternary Logic Element’ (with C. F. Kooi).

    Google Scholar 

Wesselkamper, T. C

  • Wesselkamper, T. C., (1974) ‘A Note on UDEs in an n-valued Logic’.

    Google Scholar 

  • Wesselkamper, T. C., (1974a) ‘Some Completeness Results for Abelian Semigroups and Groups’.

    Google Scholar 

  • Wesselkamper, T. C., (1975) ‘A Sole Sufficient Operator’.

    Google Scholar 

Wheeler, Roger F

  • Wheeler, R. F., (1966) ‘Complete Connectives for the 3-valued Propositional Calculus’.

    Google Scholar 

  • Wheeler, R. F., (1966 abstract) ‘Complete Connectives for the 3-valued Propositional Calculus’.

    Google Scholar 

White, Bruce

  • White, B., (1974) ‘A Note on Natural Deduction in Many-valued Logic’.

    Google Scholar 

Wijngaarden, A. V

  • Wijngaarden, A. V., (1969) (ed.) ‘Report on the Algorithmic Language ALGOL 68’.

    Google Scholar 

Wilcox, William C

  • Wilcox, W. C., (1970) ‘On Infinite Matrices and the Paradoxes of Material Implication’.

    Google Scholar 

Wilde, Alan C

  • Wilde, A. C., (197 +) ‘Generalizations of the Distributive and Associative Laws’.

    Google Scholar 

  • Wilde, A. C., (197 +a) ‘A Substitution Property’.

    Google Scholar 

Wiredu, J. E

  • Wiredu, J. E., (1974) ‘A Remark on a Certain Consequence of Connexive Logic for Zermelo’s Set Theory’.

    Google Scholar 

Wirth, N

Włodarska, E

  • Włodarska, E., (1970) ‘On Representation of Post Algebras Preserving Some Infinite Joins and Meets’.

    Google Scholar 

Wojcick, Anthony S

  • Wojcick, A. S., (1971) ‘Some Relationships Between Post and Boolean Algebras’ (with Gemot A. Metze).

    Google Scholar 

  • Wojcick, A. S., (1972) ‘The Minimization of Higher-order Boolean Functions’.

    Google Scholar 

  • Wojcick, A. S., (1973) ‘Multi-valued Asynchronous Circuits’.

    Google Scholar 

  • Wojcick, A. S., (1974) ‘Multi-valued Asynchronous Sequential Circuits’.

    Google Scholar 

Wójcicki, Ryszard

  • Wójcicki, R., (1969) ‘Logical Matrices Strongly Adequate for Structural Sentential Calculi’.

    Google Scholar 

  • Wójcicki, R., (1970) ‘Some Remarks on the Consequence Operation in Sentential Logics’.

    Google Scholar 

  • Wójcicki, R., (1971) ‘The Problem of Reconstructability of Propositional Calculi’ (with Marek Tokarz).

    Google Scholar 

  • Wójcicki, R., (1972) ‘Some Properties of Strongly Finite Propositional Calculi’.

    Google Scholar 

  • Wójcicki, R., (1972a) ‘Some Results Concerning Many Valued Łukasiewicz Calculi’.

    Google Scholar 

  • Wójcicki, R., (1972b) ‘The Degree of Completeness of the Finitely-valued Propositional Calculi’.

    Google Scholar 

  • Wójcicki, R., (1973) ‘On Matrix Representations of Consequence Operations of Łukasiewicz Sentential Calculi’.

    Google Scholar 

  • Wójcicki, R., (1974) ‘Note on Deducibility and Many-valuedness’.

    Google Scholar 

  • Wójcicki, R., (1974a) ‘Matrix Approach in Methodology of Sentential Calculi’.

    Google Scholar 

  • Wójcicki, R., (1974b) ‘The Logics Stronger than Łukasiewiczs Three-valued Sentential Calculus. The Notion of Degree of Maximality Versus the Notion of Degree of Completeness’.

    Google Scholar 

  • Wójcicki, R., (1974c) ‘Degree of Maximality Versus Degree of Completeness’.

    Google Scholar 

Wojtikiewicz, Czesław

  • Wojtikiewicz, C., (1973 abstract) ‘Axiomatization of Finite N-algebras by the Method of T. Hosoi’.

    Google Scholar 

Woodruff, Peter Worthing

  • Woodruff, P. W., (1968 abstract) ‘Arguments in 3-valued Logic’.

    Google Scholar 

  • Woodruff, P. W., (1969) Foundations of Three-valued Logic.

    Google Scholar 

  • Woodruff, P. W., (1970 abstract) ‘Constructive Three-valued Logic’.

    Google Scholar 

  • Woodruff, P. W., (1970a) ‘Logic and Truth Value Gaps’.

    Google Scholar 

  • Woodruff, P. W., (1971 abstract) ‘A New Approach to Possible Objects’.

    Google Scholar 

  • Woodruff, P. W., (1973) ‘On Constructive Nonsense Logic’.

    Google Scholar 

  • Woodruff, P. W., (1973a) ‘On Compactness in Many-valued Logic. I’.

    Google Scholar 

  • Woodruff, P. W., (1974 abstract) ‘A Constructive Łukasiewiczian Logic’.

    Google Scholar 

  • Woodruff, P. W., (1974a) ‘A Modal Interpretation of Three-valued Logic’.

    Google Scholar 

  • Woodruff, P. W., (197 +) ‘Relevance and Many Valued Logic’.

    Google Scholar 

Woods, John

  • Woods, J., (1974) The Logic of Fiction. A Philosophical Sounding of Deviant Logic.

    Google Scholar 

Wroński, Andrzej

  • Wroński, A., (1971) ‘Axiomatization of the Implicational Godel’s Matrices by Kalmar’s Method’.

    Google Scholar 

  • Wroński, A., (1971a) ‘Axiomatization of the Implicational Matrix T(L2)2 of Jaskowski’s Family (L1)Πr.’

    Google Scholar 

  • Wroński, A., (1972) ‘An Algorithm for Finding Finite Axiomatizations of Finite Intermediate Logics’.

    Google Scholar 

  • Wroński, A., (1972a) ‘An Algorithm for Finding Finite Axiomatizations of Finite Intermediate Logics’.

    Google Scholar 

  • Wroński, A., (1973) ‘Axiomatization of the Implicational Gödel’s Matrices by Kalmar’s Method’.

    Google Scholar 

  • Wroński, A., (1973a) ‘Structural Completeness of Gödel’s and Dummett’s Propositional Calculi’ (with Wojciech Dzik).

    Google Scholar 

  • Wroński, A., (1974) ‘On Equivalential Fragments of Some Intermediate .Logics’.

    Google Scholar 

  • Wroński, A., (1974a) ‘On Jaśkowski-type Semantics for the Intuitionistic Propositional Logic’ (with Stanisław J. Surma and S. Zachorowski).

    Google Scholar 

  • Wroński, A., (1974b) ‘On the Construction of Matrices Strongly Adequate for Pre-finite Logics’ (with Ewa Graczynska).

    Google Scholar 

  • Wroński, A., (1974c) ‘A Characterization of Fragments of the Intuitionistic Propositional Logic’ (with M. T. Porębska).

    Google Scholar 

  • Wroński, A., (1974d) ‘On Cardinalities of Matrices Strongly Adequate for the Intuitionistic Pro- positional Logic’.

    Google Scholar 

Yamanaka, Hideki

  • Yamanaka, H., (1971) ‘Multiple Logic Design and Applications in Binary Computers’ (with George Epstein and R. C. Braddock).

    Google Scholar 

  • Yamanaka, H., (1972) ‘Tri-stable State Circuitry for Digital Computers’ (with George Epstein).

    Google Scholar 

Yeh, R. T

  • Yeh, R. T., (1971) ‘On a Theory of Continuously Valued Logic’ (with F. P. Preparata).

    Google Scholar 

  • Yeh, R. T., (1972) ‘Continuously Valued Logic’ (with F. P. Preparata).

    Google Scholar 

Ying, C

  • Ying, C., (1971) ‘Building Blocks and Synthesis Techniques for the Realization of M-ary Combinational Switching Functions’ (with A. K. Susskind).

    Google Scholar 

Yoeli, Michael

  • Yoeli, M., (1964) ‘Application of Ternary Algebra to the Study of Static Hazards’ (with S. Rinon).

    Google Scholar 

  • Yoeli, M., (1965) ‘Logical Design of Ternary Switching Circuits’ (with G. Rosenfeld).

    Google Scholar 

  • Yoeli, M., (1965a) ‘Ternary Transmission Contact Network’.

    Google Scholar 

  • Yoeli, M., (1965b) ‘A Group Theoretical Approach to Two Rail Cascades’.

    Google Scholar 

  • Yoeli, M., (1966) ‘Decomposition of Group Functions With Applications to Two Rail Cascades’ (with J. Turner).

    Google Scholar 

  • Yoeli, M., (1967) ‘The Synthesis of Multi-valued Cellular Cascades’.

    Google Scholar 

  • Yoeli, M., (1967a) ‘Group Functions and Multi-valued Cellular Cascades’ (with Ieka Shinahr).

    Google Scholar 

  • Yoeli, M., (1968) ‘Ternary Cellular Cascades’.

    Google Scholar 

  • Yoeli, M., (1968a) ‘Ternary Arithmetic Unit’ (with Israel Halperu).

    Google Scholar 

Yrjola, P. (1972)

  • Yrjola, P., (1972) ‘Design of A/D Converters for Binary Coded Ternary Systems’ (with L. Ojala).

    Google Scholar 

  • Yrjola, P., (1973) ‘Design of Incremental Signal Processing Devices Using Binary Coded Ternary Logic’ (with L. Ojala).

    Google Scholar 

Zachorowski, S. (1974)

  • Zachorowski, S., (1974) ‘On Jaskowski-type Semantics for the Intuitionistic Propositional Logic’ (with Stanislaw J. Surma and Andrzej Wronski).

    Google Scholar 

Zadeh, Lofti A. (1965)

  • Zadeh, L. A., (1965) ‘Fuzzy Sets’.

    Google Scholar 

  • Zadeh, L. A., (1966) ‘Shadows of Fuzzy Sets’ (Russian).

    Google Scholar 

  • Zadeh, L. A., (1970) ‘Decision-making in a Fuzzy Environment’ (with R. E. Bellman).

    Google Scholar 

  • Zadeh, L. A., (1971) ‘Quantitative Fuzzy Semantics’.

    Google Scholar 

  • Zadeh, L. A., (1971a) ‘Similarity Relations and Fuzzy Orderings’.

    Google Scholar 

Zaharova, É. Ú

  • Zaharova, É. Ú., (1966) ‘Ob odnom dostatočnom uslovii polnoty v Pk’ (On a Sufficient Condition for Completeness in Pk).

    Google Scholar 

  • Zaharova, É. Ú., (1967) ‘Kriterij sistem funkcij iz Pk’ (Criteria of Completeness of Functions from Pk).

    Google Scholar 

  • Zaharova, É. Ú., (1969) ‘Precomplete Classes in k-valued Logics’ (Russian) (with Valeriĭ B. Kudrjavcev and S. V. Jablonskii).

    Google Scholar 

  • Zaharova, É. Ú., (1971) ‘A Remark on the Maximal Order of a Simple Basis in Pk’ (Russian).

    Google Scholar 

  • Zaharova, É. Ú., (1972) ‘Realization of a Function from Pk by Formulae (k ≥ 3)’ (Russian).

    Google Scholar 

  • Zaharova, É. Ú., (1972a) ‘Certain Properties on Nondegenerate Superposition in Pk’ (Russian) (with S. V. Jablonskii).

    Google Scholar 

Zavisca, E

  • Zavisca, E., (1971) ‘An Approach to Multiple-valued Sequential Circuit Synthesis’ (with Charles M. Allen).

    Google Scholar 

  • Zavisca, E., (1972) ‘Multiple-valued Combinational Function Synthesis Using a Single Gate Type’.

    Google Scholar 

Zhogolev, Y. A. (1962)

  • Zhogolev, Y. A., (1962) ‘The Order Code and Interpretive System for the Setun’ Computer’ (Russian).

    Google Scholar 

  • Zhogolev, Y. A., (1962a) ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with N. P. Brusentzov and V. V. Verigin and S. P. Maslov and A. M. Tishulina ).

    Google Scholar 

Žurkin, V. A. (1972)

  • Žurkin, V. A., (1972) ‘Minimization of Functions of Many-valued Logic in a System Which Has Cyclic Negation’ (Russian).

    Google Scholar 

Zinov’ev, Aleksandr Aleksandrovich

  • Zinov’ev, A. A., (1961b) ‘Ob odnam sposobé obzora funkcij istinnosti n-značnogo isčislénià vyskazyvanij’ (A Method of Describing the Truth-functions of the n-valued Propositional Calculus).

    Google Scholar 

  • Zinov’ev, A. A., (1963) Philosophical Problems of Many-valued Logic.

    Google Scholar 

  • Zinov’ev, A. A., (1970) ‘Minimal Tautologies and Contradictions in Finitely Many-valued Logic’ (Russian).

    Google Scholar 

Åqvist Lennart

  • Åqvist, L., (1962) ‘Reflections on the Logic of Nonsense’.

    Google Scholar 

  • Åqvist, L., (1963) “Deontic Logic Based on a Logic of ‘Better’”.

    Google Scholar 

  • Åqvist, L., (1963a) ‘Postulate Sets and Decision Procedures for Some Systems of Deontic Logic’.

    Google Scholar 

I. Basis Theory 1. TEXTS, GENERAL SKETCHES, AND HISTORICAL SURVEYS

  • Robert J. Ackermann (1967). An Introduction to Many-valued Logics.

    Google Scholar 

  • Michel Carvallo (1968). Logique à trois valeurs. Logique à seuil.

    Google Scholar 

  • Anton Dumitriu (1971). Logica polivalentǎ. Second edition (In collaboration with Teodor Stihi).

    Google Scholar 

  • George Epstein (1972). ‘Applications of Post and Generalized Post Algebras to Finite and Infinite Switching Circuits’.

    Google Scholar 

  • George Epstein (1974). ‘The Development of Multiple-valued Logic as Related to Computer Science’ (with Gideon Frieder and David C. Rine).

    Google Scholar 

  • George Epstein (1974c). ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science’ (with Gideon Frieder and David C. Rine).

    Google Scholar 

  • Max Fisch (1966). ‘Peirce’s Triadic Logic’ (with Atwell R. Turquette).

    Google Scholar 

  • Gideon Frieder (1974). ‘The Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and David C. Rine).

    Google Scholar 

  • Gideon Frieder (1974a). ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and David C. Rine).

    Google Scholar 

  • S. G. Gindikin (1972). Algébra logiki v zadačah.

    Google Scholar 

  • Leonard Goddard (1973). The Logic of Significance and Context. Volume I (with Richard Routley).

    Google Scholar 

  • Jean-Blaise Grize (1973). Logique moderne.Fasc. III. Implications-modalités, logiques polyvalentes, logique combinatoire, ontologie et méréologie de Leśniewski.

    Google Scholar 

  • Toshiharu Hasegawa (1972). ‘Many-valued logic and its applications’ (Japanese).

    Google Scholar 

  • Kiyoshi Iséki (1968). Kigô ronrigaku (meidai ronri) (Symbolic logic (propositional logic)).

    Google Scholar 

  • Ju. L. Ivas’kiv (1969). ‘Description of Many-valued Logics’ (Russian) (with D. A. Pospelov and Ž. Tošič).

    Google Scholar 

  • George L. Kline (1965). ‘N. A. Vasil’ev and the Development of Many-valued Logics’.

    Google Scholar 

  • Czesław Lejewski (1967). ‘Łukasiewicz, Jan’.

    Google Scholar 

  • Jan Łukasiewicz (1929). Elementy logiki matematycznej (Elements of Mathematical Logic).

    Google Scholar 

  • Jan Łukasiewicz (1934). ‘Z historji logiki zdań’ (On the History of the Logic of Propositions).

    Google Scholar 

  • Storrs McCall (1967a). ‘MacColl’.

    Google Scholar 

  • Grigor Constantin Moisil (1972). Essais sur les logiques non-chrysippiennes.

    Google Scholar 

  • R. Zane Parks (1971). ‘The Mystery of Phi and Psi.’

    Google Scholar 

  • Günther Patzig (1973). ‘Aristotle, Łukasiewicz and the Origins of Many-valued Logic’.

    Google Scholar 

  • D. A. Pospelov (1969). ‘Description of Many-valued Logics’ (Russian) (with Ju. L. Ivas’kiv and Ž. Tošič).

    Google Scholar 

  • Arthur Norman Prior (1967). ‘Logic, Many-valued’.

    Google Scholar 

  • Helena Rasiowa (1974). An Algebraic Approach to Non-classical Logics.

    Google Scholar 

  • Nicholas Rescher (1968). Topics in Philosophical Logic.

    Google Scholar 

  • Nicholas Rescher (1969). Many-valued Logic.

    Google Scholar 

  • Nicholas Rescher (1971). Temporal Logic (with Alasdair Urquhart).

    Google Scholar 

  • David C. Rine (1974a). ‘The Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and Gideon Frieder).

    Google Scholar 

  • David C. Rine (1974c). ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and Gideon Frieder).

    Google Scholar 

  • Richard Routley (1973). The Logic of Significance and Context. Volume 1 (with Leonard Goddard).

    Google Scholar 

  • Ž. Tošič (1969). ‘Description of Many-valued Logics’ (Russian) (with Ju. L. Ivas’kiv and D. A. Pospelov).

    Google Scholar 

  • Atwell R. Turquette (1966a). ‘Peirce’s Triadic Logic’ (with Max Fisch).

    Google Scholar 

  • Atwell R. Turquette (1967). ‘Peirce’s Phi and Psi Operators for Triadic Logic’.

    Google Scholar 

  • Atwell R. Turquette (1969a). ‘Peirce’s Complete System of Triadic Logic’.

    Google Scholar 

  • Atwell R. Turquette (1971 abstract). ‘Peirce’s ø and Ψ Operators for Triadic Logic’.

    Google Scholar 

  • Alasdair Urquhart (1971). Temporal Logic (with Nicholas Rescher).

    Google Scholar 

  • Bas C. van Fraassen (1971). Formal Semantics and Logic.

    Google Scholar 

  • Peter Worthing Woodruff (1969). Foundations of Many-valued Logic.

    Google Scholar 

  • Aleksandr Aleksandrovich Zinov’ev (1963). Philosophical Problems of Many-valued Logic.

    Google Scholar 

2. Tha 3-Valued Systems

  • Denise Becchio (1972). ‘Nouvelle démonstration de la complétude du système de Wajsberg axiomatisant la logique trivalente de Lukasiewicz’.

    Google Scholar 

  • G. Bryll (1967). ‘Some Remarks on Three-valued Logic of Łukasiewicz’ (with Jerzy Słupecki and Tadeusz Prucnal).

    Google Scholar 

  • N. M. Ermolaeva (1973). ‘On Logics Which are Similar to Hao Wang’s Calculus’ (Russian).

    Google Scholar 

  • John Evenden (1974). ‘Generalised Logic’.

    Google Scholar 

  • John Evenden (197 +). ‘Generalised Logic. IF.’

    Google Scholar 

  • Victor K. Finn (1969). ‘The Precompleteness of a Class of Functions that Corresponds to the Three-valued Logic of J. Łukasiewicz’ (Russian).

    Google Scholar 

  • Victor K. Finn (1970). ‘Certain Characteristic Truth-tables of Classical Logic and of the Three-valued Logic of J. Łukasiewicz’ (Russian).

    Google Scholar 

  • Victor K. Finn (1971). ‘On the axiomatisation of a Three-valued Logic’ (Russian).

    Google Scholar 

  • Victor K. Finn (1971a). Axiomatization of Some 3-valued Propositional Calculi and of Their Algebras (Russian).

    Google Scholar 

  • Marc Fort (1973a). ‘Deduction en logique trivalente’.

    Google Scholar 

  • V. M. Gnidenko (1963). ‘Determinarea ordinelor claselor aproape logica trivalentǎ’.

    Google Scholar 

  • Goldberg (1974). ‘A Strong Completeness Theorem for 3-valued Logic’ (with Hugues Leblanc and George Weaver).

    Google Scholar 

  • Henryk Greniewski (1958). ‘Refleksie marginesie wikladow z driejow logik Tadeusza Kotarbinskiego’.

    Google Scholar 

  • Kiyoshi Iseki (1966a). ‘Some Three-valued Logics and Its Algebraic Representations’.

    Google Scholar 

  • Hugues Leblanc (1974) ‘A Strong Completeness Theorem for 3-valued Logic’ (with H. Goldberg and George Weaver).

    Google Scholar 

  • Hugues Leblanc (197 +). ‘A Strong Completeness Theorem for 3-valued Logic. II’.

    Google Scholar 

  • Jan Łukasiewicz (1920). ‘O logice trojwartościowej’ (On Three-valued Logic).

    Google Scholar 

  • Jan Łukasiewicz (1921). ‘Logika dwuwartościowa’ (Two-valued Logic).

    Google Scholar 

  • Jan Łukasiewicz (1930a). ‘Philosophische Bemerkungen zu mehrwertigen Systemen des Aussagenkalkiils’.

    Google Scholar 

  • Jan Łukasiewicz (1930b). Untersuchungen über den Aussagenkalkül’ (with Alfred Tarski).

    Google Scholar 

  • Jan Łukasiewicz (1938). ‘Die Logik und das Grundlagenproblem’.

    Google Scholar 

  • Storrs McCall (1966a). ‘Pure Three-valued Łukasiewiczian Implication’ (with Robert K. Meyer).

    Google Scholar 

  • Robert K. Meyer (1966a). ‘Pure Three-valued Lukasiewiczian Implication’ (with Storrs McCall).

    Google Scholar 

  • Robert K. Meyer (1972). ‘Independent Axioms for the Implicational Fragment of Sobociński’s Three-valued Logic’ (with R. Zane Parks).

    Google Scholar 

  • Miroslav Mlëziva (1960). ‘K axiomatisaci trojhodnotové výrokové logiky’ (On the Axiomatization of Three-valued Propositional Logic).

    Google Scholar 

  • Grigor Constantin Moisil (1941d). ‘Remarques sur la logique modale du concept’.

    Google Scholar 

  • Grigor Constantin Moisil (194If). ‘Sur les anneaux de caracteristique 2 ou 3 et leurs applications’.

    Google Scholar 

  • Grigor Constantin Moisil (1962b). ‘Sur la logique à trois valeurs de Łukasiewicz’.

    Google Scholar 

  • R. Zane Parks (1972b). ‘Dependence of Some Axioms of Rose’.

    Google Scholar 

  • R. Zane Parks (1972c). ‘Independent Axioms for the Implicational Fragment of Sobocinski’s Three-valued Logic’ (with Robert K. Meyer).

    Google Scholar 

  • Tadeusz Prucnal (1967). ‘Some Remarks on Three-valued Logic of J. Łukasiewicz’ (with Jerzy Słupecki and G. Bryll).

    Google Scholar 

  • Alan Rose (1963). ‘A Formalisation of the Propositional Calculus Corresponding to Wang’s Calculus of Partial Predicates’.

    Google Scholar 

  • Albert Sade (1969b). ‘Sur le premier systeme de Lukasiewicz’.

    Google Scholar 

  • V. I. Shestakov (1964). ‘On the Relationship Between Certain Three-valued Logical Calculi’.

    Google Scholar 

  • Frederico M. Siosen (1965). ‘A Characterization of the Tautologies in the Three-valued Propositional Calculus’ (Spanish).

    Google Scholar 

  • Jerzy Słupecki (1967). ‘Some Remarks on Three-valued Logic of J. Łukasiewicz’ (with G. Bryll and Tadeusz Prucnal).

    Google Scholar 

  • Bolesław Sobociński (1964). ‘On the Propositional System A of Vučković and Its Extension. I’.

    Google Scholar 

  • Bolesław Sobociński (1964a). ‘On the Propositional System A of Vučković and Its Extension. II’.

    Google Scholar 

  • Alfred Tarski (1930). ‘Untersuchungen über den Aussagenkalkül’ (with Jan Łukasiewicz).

    Google Scholar 

  • Ivo Thomas (1967). ‘Three-valued Propositional Fragments with Classical Implication’.

    Google Scholar 

  • Giovanni Villa (1970). ‘Calcola proposizionale trivalente dia lettico’.

    Google Scholar 

  • Vladeta Vučković (1967). ‘Recursive Models for Three-valued Propositional Calculi with Classical Implication’.

    Google Scholar 

  • Vladeta Vučković (1967a). ‘A Recursive Mode for the Extended System A of B. Sobociński’.

    Google Scholar 

  • George Weaver (1974). ‘A Strong Completeness Theorem for 3-valued Logic’ (with Hugues Leblanc and H. Goldberg).

    Google Scholar 

  • Peter Worthing Woodruff (1968 abstract). ‘Arguments in 3-valued Logic’.

    Google Scholar 

  • Peter Worthing Woodruff (1969). Foundations of Three-valued Logic.

    Google Scholar 

  • Peter Worthing Woodruff (1970 abstract). ‘Constructive Three-valued Logic’.

    Google Scholar 

  • Peter Worthing Woodruff (1974 abstract). ‘A Constructive Łukasiewiczian Logic’.

    Google Scholar 

3. Finitely and Infinitely Many-Valued Systems of Propositional Logic

  • Lawrence P. Belluce (1963). ‘A Weak Completeness Theorem for Infinite-valued First-order Logic’ (with Chen Chung Chang).

    Google Scholar 

  • Lawrence P. Belluce (1964). ‘Further Results on Infinite Valued First-order Logic’.

    Google Scholar 

  • Vlad Boicescu (1971). ‘Sur les systèmes déductifs dans la logique θ-valente’.

    Google Scholar 

  • Eramis Bueno (1970). ‘A Certain Class Many-valued Modal Systems’.

    Google Scholar 

  • Richard L. Call (1968). ‘A Minimal Canonically Complete m-valued Proper Logic for each m.’

    Google Scholar 

  • C. Cazacu (1968). ‘Sur les logiques m-valentes’.

    Google Scholar 

  • Chen Chung Chang (1963a). ‘Logic with Positive and Negative Truth Values’.

    Google Scholar 

  • Chen Chung Chang (1963d). ‘A Weak Completeness Theorem for Infinite-Valued First- order Logic’ (with Lawrence P. Belluce).

    Google Scholar 

  • Ernest Edmonds (1969). ‘Independence of Rose’s Axioms for m-valued Implication’.

    Google Scholar 

  • Kiyoshi Iséki (1966). ‘A Pentavalued Logic and Its Algebraic Theory’ (with Shotaro Tanaka).

    Google Scholar 

  • Jan Łukasiewicz (1930a). ‘Philosophische Bemerkungen zu mehrwertigen Systemen des Aussagenkalkiils’.

    Google Scholar 

  • Jan Łukasiewicz (1930b). ‘Untersuchungen über den Aussagenkalkül’ (with Alfred Tar ski).

    Google Scholar 

  • Grzegorz Malinowski (1972). ‘Dual Counterparts of Łukasiewicz Sentential Calculi’ (with Maciej Spasowski).

    Google Scholar 

  • Grzegorz Malinowski (1974c). ‘Dual Counterparts of Łukasiewicz’s Sentential Calculi’ (with Maciej Spasowski).

    Google Scholar 

  • Gerald J. Massey (1972). ‘The Modal Structure of the Prior Rescher Family of Infinite Product Systems’.

    Google Scholar 

  • Robert K. Meyer (1966a). ‘Pure Denumerable Lukasiewiczian Implication’.

    Google Scholar 

  • Satoshi Miura (1968). ‘Certain Method for Generating a Series of Logics’ (with Shuro Nagata).

    Google Scholar 

  • Grigor Constantin Moisil (1939b). ‘Recherches sur le syllogisme’.

    Google Scholar 

  • Grigor Constantin Moisil (1939c). ‘La logique formelle et son probleme actuel’.

    Google Scholar 

  • Grigor Constantin Moisil (1940). ‘Recherches sur les logique non-chrysippiènnes’.

    Google Scholar 

  • Grigor Constantin Moisil (1941a). ‘Notes sur les logiques non-chrysippiènnes’.

    Google Scholar 

  • Grigor Constantin Moisil (1941f) ‘Sur les théories déductives a logiques non-chrysippiènnes’.

    Google Scholar 

  • Grigor Constantin Moisil (1943). ‘Contributions à l’etude des logiques non-chrysippiennes. I V. Sur la logique de Mr. Becker’.

    Google Scholar 

  • Grigor Constantin Moisil (1960b). ‘Asupra logicii lue Bochvar’ (On the Logic of Bochvar).

    Google Scholar 

  • Grigor Constantin Moisil (1964). ‘Sur les logiques de Łukasiewicz à un nombre fini de valeurs’.

    Google Scholar 

  • Andrzej Mostowski (1961a). ‘Axiomatizability of Some Many-valued Predicate Calculi’.

    Google Scholar 

  • Andrzej Mostowski (1961b). ‘An Example of a Non-axiomatizable Many-valued Logic’.

    Google Scholar 

  • Shûrô Nagata (1968). ‘Certain Method for Generating a Series of Logics’ (with Satoshi Miura).

    Google Scholar 

  • Akira Nakamura (1963c). ‘On a Simple Axiomatic System of the Infinitely Many-valued Logic Based on →.’

    Google Scholar 

  • Eleonora Perkowska (1972a). ‘On Algorithmic m-valued Logics’.

    Google Scholar 

  • Alan Rose (1956b). ‘Formalisations du calcul propositionnel implicatif à ℵo-valeurs de Łukasiewicz’.

    Google Scholar 

  • Alan Rose (1965). ‘A Formalisation of Post’s m-valued Propositional Calculus with Variable Functors’.

    Google Scholar 

  • Alan Rose (1966 abstract). ‘A Formalisation of an Infinite-valued Propositional Calculus in Which the Truth Values are Lattice Ordered’.

    Google Scholar 

  • Alan Rose (1967). ‘A Formalisation of the ℵo -valued Łukasiewicz Propositional Calculus with Variable Functors’.

    Google Scholar 

  • Alan Rose (1967a). ‘A Formalisation of the ℵo -valued Łukasiewicz Implicational Propositional Calculus with Variable Functors’.

    Google Scholar 

  • Alan Rose (1967b). ‘A Formalisation of the m-valued Lukasiewicz Propositional Calculus with Superdesignated Truth-values’.

    Google Scholar 

  • Alan Rose (1967c). ‘Nouveau calcul de non-contradiction’.

    Google Scholar 

  • Alan Rose (1967d). ‘Nouveau calcul de non-contradiction (méthode alternative)’.

    Google Scholar 

  • Alan Rose (1968 abstract). ‘Formalisations of Some ℵo-valued Łukasiewicz Propositional Calculi’.

    Google Scholar 

  • Alan Rose (1968a). ‘Binary Generators for the m-valued and ℵo-valued Łukasiewicz Propositional Calculi’.

    Google Scholar 

  • Alan Rose (1968b). ‘Formalisations of Some ℵo-valued Lukasiewicz Propositional Calculi’.

    Google Scholar 

  • Alan Rose (1969a). ‘Nouvelle formalisation du calcul propositionnel à ℵo valeurs de Łukasiewicz dans le cas où il y à des foncteurs variables’.

    Google Scholar 

  • George Rousseau (1969). ‘Logical Systems with Finitely Many Truth-values’.

    Google Scholar 

  • T. Ryoichi (1954). ‘On Nine-valued Propositional Calculus’.

    Google Scholar 

  • Rolf Schock (1964a). ‘On Finitely Many-valued Logics’.

    Google Scholar 

  • Rolf Schock (1964b). ‘On Denumerably Many-valued Logics’.

    Google Scholar 

  • Rolf Schock (1965). ‘Some Theorems on the Relative Strengths of Many-valued Logics’.

    Google Scholar 

  • A. M. Sette (1971). ‘On the Propositional Calculus P1’.

    Google Scholar 

  • Maciej Spasowski (1972). ‘Dual Counterparts of Łukasiewicz Sentential Calculi’ (with Grzegorz Malinowski).

    Google Scholar 

  • Maciej Spasowski (1974). ‘Dual Counterparts of Łukasiewicz’s Sentential Calculi’ (with Grzegorz Malinowski).

    Google Scholar 

  • Shotaro Tanaka (1966). ‘A Pentavalued Logic and Its Algebraic Theory’ (with Kiyoshi Iséki).

    Google Scholar 

  • Alfred Tarski (1930). ‘Untersuchungen uber den Aussagenkalkul’ (with Jan Łukasiewicz).

    Google Scholar 

  • A. Tauts (1967). ‘The Definition of Truth Values as Formulae’ (Russian).

    Google Scholar 

  • Atwell Rufus Turquette (1943). A Study and Extension of m-valued Logics..

    Google Scholar 

  • Atwell Rufus Turquette (1966). ‘A Method for Constructing Implication Logics’.

    Google Scholar 

  • Syozo Watanabe (1974 abstract). ‘Many-valued Prosthetics’.

    Google Scholar 

  • Peter Worthing Woodruff (1969). Foundations of Three-valued Logic.

    Google Scholar 

Special Connectives in Many-Valued Logic (Functional Completeness, Special Modes of Negation, Sheffer Stroke Functions, Structural Completeness)

  • V. A. Abdugaliev (1967). ‘Normal Forms of k-valued Logic’ (Russian).

    Google Scholar 

  • V. A. Abdugaliev (1969). ‘On the Question of the Representation of Functions of a k-valued Logic by a Normal Form. I’ (Russian).

    Google Scholar 

  • V. A. Abdugaliev (1970). ‘On the Question of the Representation of Functions of a k-valued Logic by a Normal Form. II. Selection of the Simple Parts of a Pair (A, B) when p(LA, LB) = 0 and LA ≠ LB. Construction of the Reduced Disjunctive Normal Form’ (Russian).

    Google Scholar 

  • Alexander Abian (1967). ‘Some Generalized Sheffer Functions’ (with Samuel La Macchia).

    Google Scholar 

  • Alexander Abian (1967a). ‘Examples of Generalized Sheffer Functions’ (with Samuel La Macchia).

    Google Scholar 

  • Ja. H. Adźi-Veli (1966). ‘An Application of the Blake-Poreckii Method to the Minimization of the Functions of a Many-valued Logic’ (Russian).

    Google Scholar 

  • N. N. Aĭzenberg (1965). ‘Representation of a Sum mod m in a Class of Normal Forms of Functions of m-valued Logic’ (Russian).

    Google Scholar 

  • N. N. Aĭzenberg (1968). ‘Polinomialnye predstauleià functsii amp;-značnoi logiki polinomam nad kolstsam klassov vyčetov po mod k’ (The Representations of Functions of k-valued Logic by Polynomials mod k).

    Google Scholar 

  • Panteleo Aloisio (1971). ‘Alcune osservazione sulla definibilità di operatori finiti e sulla decibilità algoritmica della completezza funzionale e deduttiva delle logiche a più valori’.

    Google Scholar 

  • V. B. Alekseev (1971). ‘Simple Bases and Simple Functions in k-valued Logic’ (Russian).

    Google Scholar 

  • V. B. Alekseev (1971a). ‘On the Number of Simple Bases in a k-valued Logic’ (Russian).

    Google Scholar 

  • R. A. Baĭramov (1967). ‘K voprosu o funktsionalnoi polnosti v mnogoznachinykh logikakh’ (On the Question of Functional Completeness in Many-valued Logic).

    Google Scholar 

  • R. A. Baĭramov (1967a). ‘O funktsiiakh Sefferi v mnogoznačhinoi logike’ (Sheffer Functions in Many-valued Logic).

    Google Scholar 

  • R. A. Baĭramov (1967b). ‘Ob odnoi serii predpolnykh klassov v k-znachinoi logike’.

    Google Scholar 

  • R. A. Baĭramov (1968). ‘Stabilizatory predikatov i funktsii Sheffera v konecinoznacinoi logike’.

    Google Scholar 

  • R. A. Baĭramov (1968a). ‘Letter to the Editors’ (Russian).

    Google Scholar 

  • R. A. Baĭramov (1969a). ‘Fundamentally Criteria for Permutation Groups and Transformation Semigroups’ (Russian).

    Google Scholar 

  • R. A. Baĭramov (1971). ‘The Classes of Multiplane Functions in Finite Sets’ (Russian).

    Google Scholar 

  • Nuel D. Belnap, Jr. (1970). ‘Every Functionally Complete m-valued Logic Has a Post- complete Axiomatization’ (with Storrs McCall).

    Google Scholar 

  • G. N. Blochina (1972). ‘Über gewisse Eigenschaften des Systems P’ (with Valeriĭ B. Kudrjavcev and G. Burosch).

    Google Scholar 

  • A. E. Bobrov (1972). ‘Minimization of Functions of a Many-valued Logic Which are Defined Through the Maximum, the Minimum and all One-place Functions’ (Russian) (with V. S. Koc).

    Google Scholar 

  • Rainer Bodendiek (1974). ‘Über das Repräsentantenproblem in der k-wertigen Logik’.

    Google Scholar 

  • Walter Borner (1969). ‘Eine Klasse von Darstellungen der Funktionen der k-wertigen Logik’.

    Google Scholar 

  • G. A. Burle (1967). ‘Classes of k-valued Logic Which Contain all Functions of a Single Variable’ (Russian).

    Google Scholar 

  • G. Burosch (1972). ‘Das Problem der Vollstandigkeit für Boolesche Funktionen uber zwei Dualmengen’ (with Valeriĭ B. Kudrjavcev).

    Google Scholar 

  • G. Burosch (1972a). ‘Über gewisse Eigenschaften des Systems P’ (with G. N. Blochina and Valeriĭ B. Kudrjavcev.

    Google Scholar 

  • Alfonson Caracciolo di Forino (1966). ‘m-valued Logics and m-ary Selection Functions’.

    Google Scholar 

  • Kiril N. Čimev (1967). ‘A Certain Kind of Dependence of Certain Functions of Pk on Their Arguments’ (Bulgarian).

    Google Scholar 

  • Kiril N. Cimev (1968-69). ‘The Various Kinds of Dependence of the Functions of Many- valued Logic on Their Argument’ (Bulgarian).

    Google Scholar 

  • Kiril N. Cimev (1968-69a). ‘The First-order Variables of the Functions of Many-valued Logic’ (Bulgarian) (with Georgi A. Kutirkov).

    Google Scholar 

  • Kenneth W. Collier (1974). ‘A Result of Extending Bochvar’s 3-valued Logic’.

    Google Scholar 

  • Bruno D’Amore (1972). ‘Sulla definizione di una implicazione nelle logiche polivalentiche soddisfi alia transitivita e che rispetti la struttura di reticolo di Boole’ (with Maurizio L. M. Matteuzzi).

    Google Scholar 

  • H. El Lozy (1973). ‘On the Number of Types of Systems of k-valued Logical Functions’ (Russian) (with V. A. Popov and N. G. Mokljak ).

    Google Scholar 

  • R. V. Freĭvald (1966). ‘A Completeness Criterion for Partial Functions of Logic and Many-valued Logic Algebras’ (Russian).

    Google Scholar 

  • R. V. Freĭvald (1970). ‘Coding of Finite Sets and a Criterion of Completeness up to Coding in Three-valued Logic’ (Russian).

    Google Scholar 

  • G. P. Gavrilov (1965). ‘On Functional Completeness in Countably-valued Logic’.

    Google Scholar 

  • Yu. V. Golunkov (1964). ‘On the Equivalence of Formulae Realizing Transformations of Functors of a k-valued Logic’ (Russian).

    Google Scholar 

  • R. L. Graham (1967). ‘On n-valued Functionally Complete Truth Functions’.

    Google Scholar 

  • Georges Hansel (1969). ‘Construction d’un schéma functionnel en logique à plusieurs valeurs’ (with Gérard Lévy).

    Google Scholar 

  • Herbert E. Hendry (1969). ‘On the Concepts of Sheffer Functions’ (with Gerald J. Massey).

    Google Scholar 

  • Yu. L. Ivas’kiv (1963). ‘A Class of Canonical Forms for the Representation of 3-valued Functions’ (with Z. L. Rabinowicz).

    Google Scholar 

  • S. V. Jablonskiĭ (1969). ‘Precomplete Classes in k-valued Logics’ (Russian) (with E. Ju. Zaharova and Valerff B. Kudrjavcev).

    Google Scholar 

  • Chr. Klixbull Jørgensen (1967). ‘The Extensional Classification of Categorical Propositions and Trivalent Logic’.

    Google Scholar 

  • Tadahiro Kitahashi (1971a). ‘An Orthogonal Expansion of Multiple-valued Logical Functions’ (with K. Tanaka).

    Google Scholar 

  • V. I. Klevačev (1970). ‘Certain Systems that are Complete in Pk’ (Russian).

    Google Scholar 

  • V. S. Koc (1973). ‘Minimization of Functions of Many-valued Logic Which are Defined Through the Maximum, the Minimum and All One Place Functions’ (Russian) (with A. E. Bobrob).

    Google Scholar 

  • Yoshira Koga (1966). ‘A Property of Three-valued Functions of One Variable’ (with Hisashi Mine).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1969). ‘Precomplete Classes in k-valued Logics’ (Russian) (with E. Ju. Zaharova and S. V. Jablonskii).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1970). ‘The Coverings of Precomplete Classes of k-valued Logic’ (Russian).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1971). ‘The Properties of S-systems of Functions of k-valued Logic’ (Russian).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1971a). ‘Concerning S-systems of Functions of a k-valued Logic’ (Russian).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1972). ‘Das Problem der Vollstandigkeit für Boolesche Funktionen über Boolesche Funktionen über zwei Dualmengen’ (with G. Burosch).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1972a). ‘Über gewisse Eigenschaften des Systems P’ (with G. N. Blochina and G. Burosch).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1973b). ‘On Properties of S-systems of k-valued Logic’ (Russian).

    Google Scholar 

  • Georgi A. Kutirkov (1968-69). ‘The First Order Variables of the Functions of Many-valued Logic’ (Bulgarian).

    Google Scholar 

  • Samuel La Macchia (1967). ‘Some Generalized Sheffer Functions’ (with Alexander Abian).

    Google Scholar 

  • Samuel La Macchia (1967a). ‘Examples of Generalized Sheffer Functions’ (with Alexander Abian).

    Google Scholar 

  • E. T. Lee (1971). ‘Multivalued Symmetric Functions’ (with S. C. Lee).

    Google Scholar 

  • S. C. Lee (1971). ‘Multivalued Symmetric Functions’ (with E. T. Lee).

    Google Scholar 

  • Vivien Leigh (1972). ‘Self-dual Sets of Unary and Binary Connectives for the 3-valued Propositional Calculus’.

    Google Scholar 

  • Gérard Lévy (1969). ‘Formes disjonctives minimales dans une logique à plusieurs valeurs’.

    Google Scholar 

  • Gérard Lévy (1969a). ‘Construction d’un schema functionnel en logique a plusieurs valeurs’ (with Georges Hansel).

    Google Scholar 

  • Marian Maduch (1972). ‘A Definability Criterion for the Operations in Finite Łukasiewicz’s Implicational Matrices’.

    Google Scholar 

  • Gerald J. Massey (1969). ‘On the Concepts of Sheffer Functions’ (with Herbert E. Hendry).

    Google Scholar 

  • Gerald J. Massey (1971 abstract). ‘Functional Completeness in m-valued Truth Tabular Logic’.

    Google Scholar 

  • Maurizio L. M. Matteuzzi (1972). ‘Sulla definizione di una implicazione nelle logiche polivalenti che soddisfi alia transitività e che rispetti la struttura di reticola di Boole’ (with Bruno D’Amore).

    Google Scholar 

  • Storrs McCall (1970). ‘Every Functionally Complete m-valued Logic has a Post-complete Axiomatization’ (with Nuel D. Belnap, Jr.).

    Google Scholar 

  • Hisashi Mine (1966). ‘A Property of Three-valued Functions of One Variable’ (with Yoshira Koga).

    Google Scholar 

  • Grigor Constantin Moisil (1960b). ‘Asupra logicii lue Bochvar’ (On the Logic of Bochvar).

    Google Scholar 

  • N. G. Mokljak (1973). ‘On the Number of Types of Systems of n-valued Logical Functions’ (Russian) (with V. A. Popov and I. T. Skibenko ).

    Google Scholar 

  • J. C. Muzio (1970). ‘A Decision Process for 3-valued Sheffer Functions. I’.

    Google Scholar 

  • J. C. Muzio (1971). ‘A Decision Process for 3-valued Sheffer Functions. II’.

    Google Scholar 

  • J. C. Muzio (1972). ‘On the t-closure Condition of Martin’.

    Google Scholar 

  • J. C. Muzio (1972a). ‘The Cosubstitution Condition’.

    Google Scholar 

  • J. C. Muzio (1973a). ‘Some Large Classes of n-valued Sheffer Functions’.

    Google Scholar 

  • E. I. Neciporok (1969). ‘The Topological Principles of Autocorrection’ (Russian).

    Google Scholar 

  • Katuzi Ono (1968). ‘A Remark on Peirce’s Rule in Many-valued Logic’.

    Google Scholar 

  • B. L. Ovsievic (1965). ‘Some Properties of Symmetric Functions of the Three-valued Logic’ (Russian).

    Google Scholar 

  • V. A. Popov (1973). ‘On the Number of Types of Systems of k-valued Logical Functions’ (Russian) (with I. T. Skibenko and N. G. Mokljak ).

    Google Scholar 

  • V. N. Porus (1973). ‘On an Analytic Manner of Presentation of Many-valued Matrices’ (Russian).

    Google Scholar 

  • Z. L. Rabinowicz (1963). ‘A Class of Canonical Forms of the Representation of 3-valued Functions’ (with Yu. L. Ivas’kiv).

    Google Scholar 

  • M. F. Raca (1965). ‘Class of Logic Functions Corresponding to the First Matrix of Jaśkowski’ (Russian).

    Google Scholar 

  • M. F. Raca, (1966). ‘A Criterion of Functional Completeness in Logic Corresponding to the First Jaśkowski Matrix’.

    Google Scholar 

  • M. F. Raca (1969), ‘The Class of Functions of Three-valued Logic That Corresponds to the First Matrix of Jaśkowski’ (Russian).

    Google Scholar 

  • M. F. Raca (1970). ‘Functional Completeness in Certain Logics That are Intermediate Between the Classical and Intuitionistic Ones’ (Russian).

    Google Scholar 

  • Alan Rose (1969c). ‘Sur les éléments universels trivalents de décision’.

    Google Scholar 

  • Alan Rose (1969d). ‘The Degree of Completeness of the m-valued Łukasiewicz Propositional Calculus, Correction and Addendum’.

    Google Scholar 

  • Alan Rose (1971a). ‘Sur certains functeurs à m arguments des calculs propositionnels à m valeurs’.

    Google Scholar 

  • Alan Rose (1972). ‘Locally Full ℵo-valued Propositional Calculi’.

    Google Scholar 

  • Ivo G. Rosenberg (1965). ‘La structure des fonctions de plusieurs variables sur un ensemble fini’.

    Google Scholar 

  • Ivo G. Rosenberg (1974). ‘Completeness, Closed Classes and Relations in Multiple-valued Logics’.

    Google Scholar 

  • James Rosenberg (1969). ‘The Application of Ternary Semigroups to the Study of n- valued Sheffer Functions’.

    Google Scholar 

  • V. L. Rvacov (1967). ‘Some Functionally Closed Classes of Functions in /c-valued Logic’ (Russian) (with L. I. Skljarov).

    Google Scholar 

  • V. L. Rvačov (1971). ‘A Certain Extension of the Concept of R-function’ (Russian).

    Google Scholar 

  • Albert Sade (1969). ‘Fonctions propositionnelles monadiques dans la logique trivalente’.

    Google Scholar 

  • Arto Salomaa (1960). ‘A Theorem Concerning the Composition of Several Variables Ranging Over a Finite Set’.

    Google Scholar 

  • Arto Salomaa (1960a). ‘On the Composition of Functions of Several Variables Ranging Over a Finite Set’.

    Google Scholar 

  • Arto Salomaa (1962). ‘Some Completeness Criteria for Sets of Functions Over a Finite Domain, I’.

    Google Scholar 

  • Arto Salomaa (1963). ‘Some Analogues of Sheffer Functions in Infinite Valued Logics’.

    Google Scholar 

  • Arto Salomaa (1963b). On Basic Groups for the Set of Functions Over a Finite Domain.

    Google Scholar 

  • Arto Salomaa (1963c). ‘Some Completeness Criteria for Sets of Functions Over a Finite Domain, II’.

    Google Scholar 

  • Arto Salomaa (1974). ‘Some Remarks Concerning Many-valued Propositional Logics’.

    Google Scholar 

  • Peter Schofield (1966). ‘Complete Subsets of Mappings Over a Finite Domain’.

    Google Scholar 

  • Rangasamy V. Setlur (1971). ‘Duality in Finite Many-valued Logic’.

    Google Scholar 

  • I. M. Šeinberger (1970). ‘Simple Bases and the Number of Functions in Certain Post Classes’ (Russian).

    Google Scholar 

  • Kajetan Šeper (1971). ‘A Decision Problem Concerning Autoduality in k-valued Logic’.

    Google Scholar 

  • F. Richard Singer (1967). ‘Some Sheffer Functions for m-valued Logics’.

    Google Scholar 

  • L. Sintonen (1972). ‘On the Realization of Functions in n-valued Logic’.

    Google Scholar 

  • I. T. Skibenko (1973). ‘On the Numbers of Types of Systems of k-valued Logical Functions’ (Russian) (with V. A. Popov and N. G. Mokljak ).

    Google Scholar 

  • L. T. Skljarov (1967). ‘Some Functionally Closed Classes of Functions in k-valued Logic’ (Russian) (with V. L. Rvacov).

    Google Scholar 

  • Jerzy Słupecki (1972). ‘A Criterion of Fullness of Many-valued Systems of Propositional Logic’.

    Google Scholar 

  • William R. Smith III (1974). ‘Minimizations of Multivalued Functions’.

    Google Scholar 

  • V. A. Sokolov (1971). ‘Remarks on the Class of Partial Functions of Countably-valued Logic’ (Russian).

    Google Scholar 

  • Ju. N. Solodukin (1970). ‘A Concept of Function-analogue and a Criterion for Functional Incompleteness of Systems of Many-valued Logic’ (Russian).

    Google Scholar 

  • L. M. Sosinskii (1964). ‘On the Representation of Functions by Irreversible Superpositions in Three-valued Logic’ (Russian).

    Google Scholar 

  • M. Stojaković (1972). ‘On the Exponential Properties of the Implication’.

    Google Scholar 

  • Wojciech Suchoń (1974a). ‘Définition des foncteurs modaux de Moisil dans le calculi n-valent des propositions de Lukasiewicz avec implication et negation’.

    Google Scholar 

  • K. Tanaka (1971a). ‘An Orthogonal Expansion of Multiple-valued Logical Functions’ (with Tadahiro Kitahashi).

    Google Scholar 

  • V. V. Tarasov (1972). ‘Certain Properties of the Essential Function of k-valued Logic’ (Russian).

    Google Scholar 

  • Marek Tokarz (1972). ‘On Invariant Systems and Structural Completeness of Łukasiewicz’s Logics’.

    Google Scholar 

  • Marek Tokarz (1972a). ‘Invariant Systems of Łukasiewicz Calculi’.

    Google Scholar 

  • Marek Tokarz (1972b). ‘On Structural Completeness of Łukasiewicz’s Logics’.

    Google Scholar 

  • Marek Tokarz (1974a). ‘A New Proof of “Topographic” Theorem on Łukasiewicz’s Logics’.

    Google Scholar 

  • Marek Tokarz (1974c). ‘Invariant Systems of Łukasiewicz Calculi’.

    Google Scholar 

  • Marek Tokarz (197 +). ‘Invariant Systems of Łukasiewicz’s Logics’.

    Google Scholar 

  • Yu. M. Tolstova (1967). ‘Modelling I-valued Logic in k-valued Logic (k > 1)’ (Russian).

    Google Scholar 

  • Živko Tošić (1972). ‘Analytical Representations of m-valued Logical Functions Over the Ring of Integers modulo m’.

    Google Scholar 

  • Atwell R. Turquette (1969). ‘Generalizable Kleene Logics’.

    Google Scholar 

  • Atwell R. Turquette (1972). ‘Generalized Modal Sets’.

    Google Scholar 

  • V. I. Varsavskiĭ (1965). ‘Functional Divisibility in Three-valued Logic’ (Russian).

    Google Scholar 

  • V. I. Varsavskiĭ (1969). ‘A Majority Operation in Many-valued Logic’ (Russian).

    Google Scholar 

  • Donald C. Webb (1936c). Many-valued Logics.

    Google Scholar 

  • T. C. Wesselkamper (1975). ‘A Sole Sufficient Operator’.

    Google Scholar 

  • Roger F. Wheeler (1966). ‘Complete Connectives for the 3-valued Propositional Calculus’.

    Google Scholar 

  • Roger F. Wheeler (1966 abstract). ‘Complete Connectives for the 3-valued Propositional Calculus’.

    Google Scholar 

  • Alan C. Wilde (197 +a). ‘A Substitution Property’.

    Google Scholar 

  • William C. Wilcox (1970). ‘On Infinite Matrices and the Paradoxes of Material Implication’.

    Google Scholar 

  • Ryszard Wójcicki (1972). ‘Some Properties of Strongly Finite Propositional Calculi’.

    Google Scholar 

  • Ryszard Wójcicki (1972a). ‘Some Results Concerning Many-valued Lukasiewicz Calculi’.

    Google Scholar 

  • Ryszard Wójcicki (1972b). ‘The Degree of Completeness of the Finitely-valued Propositional Calculi’.

    Google Scholar 

  • Ryszard Wójcicki (1973). ‘On Matrix Representation of Consequence Operations of Łukasiewicz Sentential Calculi’.

    Google Scholar 

  • Ryszard Wójcicki (1974b). ‘The Logics Stronger than Łukasiewicz’s Three-valued Sentential Calculus. The Notion of Degree of Maximality Versus the Notion of Degree of Completeness’.

    Google Scholar 

  • Ryszard Wójcicki (1974c). ‘Degree of Maximality Versus Degree of Completeness’.

    Google Scholar 

  • É. Ú. Zaharova (1966). ‘Ob odnum dostatočnom uslovii polnoty v Pk’ (On a Sufficient Condition for Completeness in P k ).

    Google Scholar 

  • ÉÚ. U. Zaharova (1967). Kritérij sistém funkcij iz P h (Criteria of Completeness of Functions from P k ).

    Google Scholar 

  • É. Ú. Zaharova (1969). ‘Precomplete Classes in fc-valued Logics’ (Russian) (with ValeriTB. Kudrjavcev and S. V. Jablonskil).

    Google Scholar 

  • É. Ú. Zaharova (1971). A Remark on the Maximal Order of a Simple Basis in P k (Russian).

    Google Scholar 

  • É. Ú. Zaharova (1972). ‘Realization of a Function from P k by formulae (k ≥ 3)’ (Russian).

    Google Scholar 

  • Aleksandr Aleksandrovich Zinov’ev (1961b). ‘Ob odnom sposobé obzora funckij istinnosti rc-značnogo isčislénia vyskazyvanij’ (A Method of Describing the Truth-functions of the fl-valued Propositional Calculus).

    Google Scholar 

  • V. A. Žurkin (1972). ‘Minimization of Functions of a Many-valued Logic in a System Which has Cyclic Negation’ (Russian) (with A. E. Bobrov).

    Google Scholar 

5. Quantification Theory in Many-Valued Logic

  • Lawrence Peter Belluce (1964). The Theory of Infinite-valued Predicate Logic.

    Google Scholar 

  • A. Luiz Darzins (1967 abstract). ‘“The Unambiguous Characterization Problem” for Many-valued and Aristotelian and—and or—Propositional and Functional Calculi’.

    Google Scholar 

  • Burton Dreben (1960). ‘Relation of m-valued Quantificational Logic to 2-valued Quantificational Logic’.

    Google Scholar 

  • Marc Fort (1973). ‘Calcul des prédicats trivalent’.

    Google Scholar 

  • Grigor Constantin Moisil (1961b). ‘The Predicate Calculus in Three-valued Logic’.

    Google Scholar 

  • Grigor Constantin Moisil (1972g). ‘Sur le calcul des prédicats dans la logique a trois valeurs’.

    Google Scholar 

  • Andrzej Mostowski (1961a). ‘Axiomatizability of Some Many-valued Predicate Calculi’.

    Google Scholar 

  • Helena Rasiowa (1972). ‘The Craig Interpolation Theorem for m-valued Predicate Calculi’.

    Google Scholar 

  • Helena Rasiowa (1973). ‘On Generalized Post Algebras of Order ω+ and ω+-valued Predicate Calculi’.

    Google Scholar 

  • Alan Rose (1973). ‘Sur certain “Erweiterter Aussagenkalkiil” dont le seul quantificateur primitif constitue son dual’.

    Google Scholar 

  • Alan Rose (1973a). ‘Note sur 1’ “Erweiterter Aussagenkalkiil” ayant un seul quantificateur primitif.

    Google Scholar 

  • Brian T. Skyrms (1970a). ‘Notes on Quantification and Self-reference’.

    Google Scholar 

  • A. Tauts (1969). ‘Nonregular First Order Predicate Calculus’.

    Google Scholar 

6. Axiomatization of Many-Valued Logic (Formal Results; Metalogical Theory)

  • Robert J. Ackermann (1971). ‘Matrix Satisfiability and Axiomatization’.

    Google Scholar 

  • M. C. Badillo (1961). ‘Many-valued Logics of Systems’.

    Google Scholar 

  • Victor K. Finn (1974). ‘A Criterion of Functional Completeness for B3’.

    Google Scholar 

  • R. R. Rockingham Gill (1970). ‘The Craig-Lyndon Interpolation Theorem in 3-valued Logic’.

    Google Scholar 

  • H. Goldberg (1974). ‘A Strong Completeness Theorem for 3-valued Logic’ (with Hugues Leblanc and George Weaver).

    Google Scholar 

  • Tsutomu Hosoi (1966c). ‘The Axiomatization of the Intermediate Propositional Systems Sn of Gödel’.

    Google Scholar 

  • Tsutomu Hosoi (1967a). ‘On the Axiomatic Method and the Algebraic Method for Dealing with Propositional Logics’.

    Google Scholar 

  • Tsutomu Hosoi (1967b). ‘A Criterion for the Separable Axiomatization of Gödel’s Sn.

    Google Scholar 

  • A. A. Ivin (1970). ‘Definitions of Alethic and Deontic Modal Functors in Terms of Material Implication and Constants’ (Russian).

    Google Scholar 

  • Vladimir G. Kirin (1966). ‘Gentzen’s Method for the Many-valued Propositional Calculi’.

    Google Scholar 

  • Hugues Leblanc (1974). ‘A Strong Completeness Theorem for 3-valued Logic’ (with H. Goldberg and George Weaver).

    Google Scholar 

  • Hugues Leblanc (197 +). ‘A Strong Completeness Theorem for 3-valued Logic. II.’

    Google Scholar 

  • John Loader (1974). ‘A Method for Finding Formulae Corresponding to First Order Universal Decision Elements in m-valued Logic’.

    Google Scholar 

  • Angelo Margaris (1956). A Problem of Rosser and Turquette in Many-valued Logic.

    Google Scholar 

  • Angelo Margaris (1958). ‘A Problem of Rosser and Turquette’.

    Google Scholar 

  • Robert Kenneth Meyer (1966). Topics in Modal and Many-valued Logic.

    Google Scholar 

  • Torn Miyama (1973). ‘Another Proof and Extension of Gill’s Interpolation Theorem’.

    Google Scholar 

  • Grigor Constantin Moisil (1967b). ‘Sur le calcul des propositions de type supérieur dans la logique de Lukasiewicz à plusieurs’.

    Google Scholar 

  • Nobuyoshi Motohashi (1972). ‘Some Investigations on Many-Valued Logic’.

    Google Scholar 

  • Shuro Nagata (1966). ‘A Series of Successive Modifications of Peirce’s Rule’.

    Google Scholar 

  • Akira Nakamura (1962c). ‘Tati ronri to sono korikei ni tuite’ (On the Many-valued Logics and an Axiomatic System for Them).

    Google Scholar 

  • Takemasa Ohya (1968). ‘Many-valued Logic Extended to Simple Type Theory’.

    Google Scholar 

  • E. Ortowski (1967). ‘Mechanical Proof Procedure for the n-valued Propositional Calculus’.

    Google Scholar 

  • Eleonora Perkowska (1970). ‘Herbrand Theorem for Theories Based on m-valued Logics’.

    Google Scholar 

  • Tadeusz Prucnal (1967). ‘A Proof of Completeness of the Three-valued C-N Sentential Calculus of Łukasiewicz’.

    Google Scholar 

  • Tadeusz Prucnal (1967a). ‘A Proof of the Axiomatizability of Łukasiewicz’s Three-valued Implicational Propositional Calculus’ (Polish).

    Google Scholar 

  • Tadeusz Prucnal (1974). ‘Interpretations of Classical Sentential Calculus in Nonclassical Implicational Calculi’.

    Google Scholar 

  • Helena Rasiowa (1972). ‘The Craig Interpolation Theorem for m-valued Predicate Calculi’.

    Google Scholar 

  • Juliusz Reichbach (1963). ‘About Connection of the First-order Functional Calculus with Many-valued Propositional Calculi’.

    Google Scholar 

  • Alan Rose (1960a). ‘An Extension of a Theorem of Margaris’.

    Google Scholar 

  • Alan Rose (1964a). ‘Formalisations de calculus propositionnels polyvalents à foncteurs variables’.

    Google Scholar 

  • Alan Rose (1966a). ‘A Formalisations of the m-valued Łukasiewicz Implicational Propositional Calculus with Variable Functors’.

    Google Scholar 

  • Alan Rose (1966b). ‘Formalisation d’un calcul propositionnel a un nombre infini de valeurs, lesquelles forment un treillis’.

    Google Scholar 

  • Alan Rose (1966c). ‘Formalisation de certains calculus propositionnels polyvalents à foncteurs variables au cas ou certaines valeurs sont surdésignes’.

    Google Scholar 

  • Alan Rose (1969). ‘Single Generators for Henkenian Fragments of the 2-valued Propositional Calculus’.

    Google Scholar 

  • Alan Rose (1969b). ‘Some Many-valued Propositional Calculi Without Single Generators’.

    Google Scholar 

  • Alan Rose (1971). ‘Note sur la formalisation des calculus propositionnels polyvalents’.

    Google Scholar 

  • George Rousseau (1967). ‘Sequents in Many-valued Logic I’.

    Google Scholar 

  • George Rousseau (1970). ‘Sequents in Many-valued Logic II’.

    Google Scholar 

  • Wacław Sadowski (1964). ‘Proof of Axiomatizability of Certain n-valued Propositional Calculi’.

    Google Scholar 

  • Zygmunt Saloni (1972). ‘Gentzen Rules for the m-valued Logic’.

    Google Scholar 

  • Thomas W. Scharle (1971 abstract). ‘Completeness of Many-valued Protothetic’.

    Google Scholar 

  • Peter Schofield (1964). ‘On a Correspondence Between Many-valued and Two-valued Logics’.

    Google Scholar 

  • Hermann F. Scholt (1970). ‘Generalizability of the Propositional and Predicate Calculi to Infinite-valued Calculi’.

    Google Scholar 

  • Karl Schröter (1955). ‘Methoden zur Axiomatisierung beliebiger Aussagen- und Prädi- katenkalkiile’.

    Google Scholar 

  • Dana Scott (197 +). ‘Completeness and Axiomatizability in Many-valued Logic’.

    Google Scholar 

  • D. J. Shoesmith (1973 abstract). ‘Proofs with Multiple Conclusions’ (with Timothy J. Smiley).

    Google Scholar 

  • Jerzy Słupecki (1971). ‘Proof of Axiomatizability of Full Many-valued Systems of Calculus of Propositions’.

    Google Scholar 

  • Timothy J. Smiley (1973 abstract). ‘Proofs with Multiple Conclusions’ (with D. J. Shoe- smith).

    Google Scholar 

  • Stanisław J. Surma (1973 abstract). ‘A Method of the Construction of Łukasiewiczian Algebras and Its Application to Gentzen-style Characterization of Łukasiewiczian Logics’.

    Google Scholar 

  • Stanisław J. Surma (1973b). ‘Nota w sprawie twierdzeń o dedukcji nie wprost waznych w skończenie weilwartoś ciowych rachunkach zdań Łukasjewicza’ (A Note on Indirect Deduction Theorems Valid in Łukasiewicz’s Finitely-valued Propositional Calculi).

    Google Scholar 

  • Stanisław J. Surma (1974). ‘A Method of the Construction of Finite Łukasiewiczian Algebras and Its Application to a Gentzen-stile Characterization of Finite Logics’.

    Google Scholar 

  • Stanisław J. Surma (1974b). ‘An Algorithm for Axiomatizing Every Finite Logic’.

    Google Scholar 

  • Stanisław J. Surma (1974c). ‘An Algorithm for Axiomatizing Every Finite Logic’.

    Google Scholar 

  • Władysław Szczech (1973). ‘Axiomatizability of Finite Matrices’.

    Google Scholar 

  • Michio Tahara (1970). ‘Functional Completeness and Polyphecks in 3-valued Logic’ (Japanese) (with Sueo Tanaka).

    Google Scholar 

  • Jorge Tallet (1970). ‘On the Symmetry of Many-valued Logical Systems’.

    Google Scholar 

  • Saburo Tamura (197 +). ‘A Sequential Formulation for Sobocinski’s Three-valued Logic’.

    Google Scholar 

  • Sueo Tanaka (1970). ‘Functional Completeness and Polyphecks in 3-valued Logic’ (Japanese) (with Michio Tahara).

    Google Scholar 

  • Marek Tokarz (1971). ‘The Problem of Reconstructability of Propositional Calculi’ (with Ryszard Wojcicki).

    Google Scholar 

  • Marek Tokarz (1974a). ‘A Method of Axiomatization of Łukasiewiczian Logics’.

    Google Scholar 

  • George Weaver (1974). ‘A Strong Completeness Theorem for 3-valued Logic’ (with H. Goldberg and Hugues Leblanc).

    Google Scholar 

  • T. C. Wesselkamper (1974). ‘A Note on UDE’s in an n-valued Logic’.

    Google Scholar 

  • Bruce White (1974). ‘A Note on Natural Deduction in Many-valued Logic’.

    Google Scholar 

  • Alan C. Wilde (197 +). ‘Generalizations of the Distributive and Associative Laws’.

    Google Scholar 

  • Ryszard Wójcicki (1971). ‘The Problem of Reconstructability of Propositional Calculi’ (with Marek Tokarz).

    Google Scholar 

  • Czesław Wojtkiewicz (1973 abstract). ‘Axiomatization of Finite algebras by the Method of T. Hosoi’.

    Google Scholar 

  • Peter Worthing Woodruff (1969). Foundations of Three-valued Logic.

    Google Scholar 

  • Peter Worthing Woodruff (1973a). ‘On Compactness in Many-valued Logic. I’.

    Google Scholar 

  • Andrzej Wrónski (1973). ‘Axiomatization of the Implicational Godel’s Matrices by Kalmar’s Method’.

    Google Scholar 

  • Aleksandr Aleksandrovich Zinov’ev (1970). ‘Minimal Tautologies and Contradictions in Finitely Many-valued Logic’ (Russian).

    Google Scholar 

7. Semantic Interpretations of Many-Valued Logic

  • D. I. Bakarelov (1972). ‘Notes on the Semantics of Three-valued Łukasiewicz Logic’ (Russian).

    Google Scholar 

  • Fernando Bertolini (1970). ‘Kripke Models and Many-valued Logics’.

    Google Scholar 

  • Fernando Bertolini (1970a). ‘Kripke Models and Many-valued Logics. II’.

    Google Scholar 

  • B. Dahn (1974). ‘Kripke-style Semantics for Some Many-valued Propositional Calculi’.

    Google Scholar 

  • Leonard Goddard (1973). The Logic of Significance and Context. Volume I (with Richard Routley).

    Google Scholar 

  • Vladimir G. Kirin (1968). ‘Post Algebras as Semantic Bases of Some Many-valued Logics’.

    Google Scholar 

  • Pavel Materna (1972). ‘Intensional Semantics of Vague Constants. An Application of Tichy’s Concept of Semantics’.

    Google Scholar 

  • Charles G. Morgan (1974 abstract). ‘Resolution in Many-valued Logics’.

    Google Scholar 

  • Hiroakira Ono (1971). ‘Kripke Models and Intermediate Logics’.

    Google Scholar 

  • Helena Rasiowa (1970). ‘Ultraproducts of m-valued Models and a Generalization of the Löwenheim-Skolem-Gödel-Malcev Theorem for Theories Based on m-valued Logics’.

    Google Scholar 

  • Helena Rasiowa (197 +). ‘Post Algebras as a Semantic Foundation of Many-valued Logics’.

    Google Scholar 

  • Richard Routley (1971). ‘Domainless Semantics for Free, Quantification and Significance Logics’.

    Google Scholar 

  • Richard Routley (1973). The Logic of Significance and Context .Volume 1 (with Leonard Goddard).

    Google Scholar 

  • Richard Routley (197 +). ‘Universal Semantics?’.

    Google Scholar 

  • Rolf Schock (1964a). ‘On Finitely Many-valued Logics’.

    Google Scholar 

  • Rolf Schock (1964b). ‘On Denumerably Many-valued Logics’.

    Google Scholar 

  • Dana Scott (1973). ‘Background to Formalization’.

    Google Scholar 

  • Dana Scott (197 +). ‘Completeness and Axiomatizability in Many-valued Logic’.

    Google Scholar 

  • Wojciech Suchoń (1974). ‘La méthode de Smullyan de construire le calcul n-valent de Łukasiewicz avec implication et negation’.

    Google Scholar 

  • Roman Suzko (1957). ‘A Formal Theory of the Logical Values.’ F (Polish).

    Google Scholar 

  • Alasdair Ian Fenton Urquhart (1973). The Semantics of Entailment.

    Google Scholar 

  • Alasdair Ian Fenton Urquhart (1973a). ‘An Interpretation of Many-valued Logic’.

    Google Scholar 

  • Dimităr I. Vakarelov (1970). ‘The Concept of Dogma and Some Systems of Many-valued Logic’ (Russian).

    Google Scholar 

  • Dimităr I. Vakarelov (1972). ‘Notes on the Semantics of the Łukasiewicz’s 3-valued Logic’ (Russian).

    Google Scholar 

  • Peter Worthing Woodruff (1969).Foundations of Three-valued Logic.

    Google Scholar 

  • Peter Worthing Woodruff (1973). ‘On Constructive Nonsense Logic’.

    Google Scholar 

II. Logical Ramifications 8. Uses of Many-Valued Logics in the Study of Modal and Relevant Logics

  • Alan Rose Anderson (1954). ‘On the Interpretation of a Modal System of Łukasiewicz’.

    Google Scholar 

  • Alan Rose Anderson (1975). Entailment. The Logic of Relevance and Necessity. Volume 1 (with Nuel D. Belnap, Jr.).

    Google Scholar 

  • Alan Rose Anderson (197 +). Entailment. The Logic of Relevance and Necessity. Volume 2 (with Nuel D. Belnap, Jr. and Robert K. Meyer).

    Google Scholar 

  • Richard Bradshaw Angell (1971 abstract). ‘Connexive Implication, Modal Logic and Subjunctive Conditionals’.

    Google Scholar 

  • Ralph C. Applebee (1971). ‘Some Results on Generalized Truth Tables’ (with Biswambhar Pahi).

    Google Scholar 

  • Nuel D. Belnap, Jr. (1975). Entailment. The Logic of Relevance and Necessity. Volume 1 (with Alan Ross Anderson).

    Google Scholar 

  • Nuel D. Belnap, Jr. (197 +). Entailment. The Logic of Relevance and Necessity. Volume 2 (with Alan Ross Anderson and Robert K. Meyer).

    Google Scholar 

  • Eramis Bueno (1969). ‘Polyvalent Modal Logics’ (Spanish).

    Google Scholar 

  • R. A. Bull (1964). ‘An Axiomatisation of Prior’s Modal Calculus Q’.

    Google Scholar 

  • Hector-Neri Castañeda (1964). ‘A Note on S5’.

    Google Scholar 

  • Charles E. Caton (1962). ‘A Stipulation of Logical Truth in a Modal Propositional Calculus’.

    Google Scholar 

  • John R. Chidgey (1972). ‘Necessity and Ticket Entailment’ (with R. Zane Parks).

    Google Scholar 

  • John R. Chidgey (1974). On Entailment. A Consideration of Some of the Formal Properties of the Anderson and Belnap System E of Entailment and of Related Systems.

    Google Scholar 

  • Michael Dummett (1973). Frege: Philosophy of Language.

    Google Scholar 

  • J. Michael Dunn (1968 abstract). ‘Representation Theory of Normal R-mingle Matrices’.

    Google Scholar 

  • J. Michael Dunn (1969). ‘E, R and y’ (with Robert K. Meyer).

    Google Scholar 

  • J. Michael Dunn (1970). ‘Algebraic Completeness Results for R-mingle and Its Extensions’.

    Google Scholar 

  • J. Michael Dunn (1970a abstract). Extensions of RM and LC.

    Google Scholar 

  • Ian Hacking (1963). ‘What is Strict Implication?’.

    Google Scholar 

  • Jerzy Łos (1949). O matrycach logicznych (On Logical Matrices).

    Google Scholar 

  • Jan Lukasiewicz (1953b). ‘A System of Modal Logic’.

    Google Scholar 

  • Gerald J. Massey (1969a). ‘Sheffer Functions for Many-valued S5 Modal Logics’.

    Google Scholar 

  • Robert P. McArthur (197 +). ‘Three-valued Free Tense Logic’.

    Google Scholar 

  • Storrs McCall (1967b). ‘Connexive Implication and the Syllogism’.

    Google Scholar 

  • Storrs McCall (1969). ‘The System S9’ (with Arnold Vander Nat).

    Google Scholar 

  • Robert K. Meyer (1969). E, R and y (with J. Michael Dunn).

    Google Scholar 

  • Robert K. Meyer (1971 abstract). ‘R-mingle and Relevant Disjunction’.

    Google Scholar 

  • Robert K. Meyer (197 +). Coherence Revisited.

    Google Scholar 

  • Robert K. Meyer (197 +a). Entailment. The Logic of Relevance and Necessity.Volume 2 (with A. R. Anderson and N. D. Belnap, Jr.).

    Google Scholar 

  • Grigor Constantin Moisil (1938). ‘Sur la théorie classique de la modalité des jugements’.

    Google Scholar 

  • Grigor Constantin Moisil (1939b). ‘Recherches sur le syllogisme’.

    Google Scholar 

  • Grigor Constantin Moisil (1939c). ‘La logique formelle et son problème actuel’.

    Google Scholar 

  • Grigor Constantin Moisil (1941d). ‘Remarques sur la logique modale du concept’.

    Google Scholar 

  • Grigor Constantin Moisil (1942a). ‘Logique modale’.

    Google Scholar 

  • Charles G. Morgan (197 +). ‘Local and Global Operators and Many-valued Modal Logics’.

    Google Scholar 

  • Akira Nakamura (1962-64). ‘Yôsô ronri to tati ronri no kankei ni tuite’ (On the Relation

    Google Scholar 

  • Between Modal Logic and Many-valued Logic). Akira Nakamura (1965). ‘On the Infinitely Many-valued Double-threshold Logic’. Biswambhar Pahi (1966 abstract). ‘On the Non-existence of Finite Characteristic Matrices’

    Google Scholar 

  • for Some Implicational Calculi’. Biswambhar Pahi (1966a). Studies in Implicational Calculi.

    Google Scholar 

  • Biswambhar Pahi (1971). ‘Some Results on Generalized Truth-tables’ (with Ralph C. Applebee).

    Google Scholar 

  • Biswambhar Pahi (1972). ‘Maximal Full Matrices’.

    Google Scholar 

  • Biswambhar Pahi (1972a). ‘A Method for Proving the Non-existence of Finite Characteristic Models for Implicational Calculi’.

    Google Scholar 

  • Biswambhar Pahi (1973). ‘Necessity and Some Non-modal Propositional Calculi’.

    Google Scholar 

  • Biswambhar Pahi (1974). ‘On the Non-existence of Finite Characteristic Models for Some Classes of Implicational Calculi’.

    Google Scholar 

  • R. Zane Parks (1972). ‘A Note on R-mingle and Sobociński’s Three-valued Logic’.

    Google Scholar 

  • R. Zane Parks (1972a). ‘Necessity and Ticket Entailment’ (with John R. Chidgey). Arthur Norman Prior (1959). ‘Notes on a Group of New Modal Systems’.

    Google Scholar 

  • Arthur Norman Prior (1963a). ‘The Theory of Implication’.

    Google Scholar 

  • Arthur Norman Prior (1964). ‘Axiomatisation of the Modal Calculus Q’.

    Google Scholar 

  • Richard Purtill (1970). ‘Fout-valued Tables and Modal Logic’.

    Google Scholar 

  • Malcolm K. Rennie (1971). ‘Semantics for RK1’.

    Google Scholar 

  • Nicholas Rescher (1971). Temporal Logic (with Alasdair Urquhart).

    Google Scholar 

  • Imre Ruzsa(1973). ‘Prior-type Modal Logic. I’.

    Google Scholar 

  • Imre Ruzsa (1973a). ‘Prior-type Modal Logic. IF.’

    Google Scholar 

  • George F. Schumm (1969). ‘On Some Open Questions of B. Sobociński’.

    Google Scholar 

  • Schiller Joe Scroggs (1951). ‘Extensions of the Lewis System S5’.

    Google Scholar 

  • Krister Segerberg (1967). ‘Some Modal Logics Based on a Three-valued Logic’.

    Google Scholar 

  • D. J. Shoesmith (1971). ‘Deducibility and Many-valuedness’ (with Timothy J. Smiley).

    Google Scholar 

  • Anjan Shukla (1969). ‘A Note on Independence’.

    Google Scholar 

  • Timothy J. Smiley (1961). ‘On Łukasiewicz’s L-modal System’.

    Google Scholar 

  • Timothy J. Smiley (1971). Deducibility and Many-valuedness (with D. J. Shoesmith).

    Google Scholar 

  • Wojciech Suchon (1973).. ‘Application of the Theory of Logical Matrices in the Independence Proofs’.

    Google Scholar 

  • Takeo Sugihara (1964). Yôsô ronrigaku kenkyii (A Study on Modal Logic).

    Google Scholar 

  • Takeo Sugihara (1964a). ‘Sequential Truth-functions’.

    Google Scholar 

  • Atwell R. Turquette (1963a). ‘Modality, Minimality, and Many-valuedness’.

    Google Scholar 

  • Dolph Edward Ulrich (1967). Matrices for Sentential Calculi.

    Google Scholar 

  • Dolph Edward Ulrich (1970 abstract). ‘Decidability Results for Some Classes of Propositional Calculi’.

    Google Scholar 

  • Dolph Edward Ulrich (1972). ‘Some Results Concerning Finite Models for Sentential Calculi’.

    Google Scholar 

  • Dolph Edward Ulrich (1974 abstract). ‘Subsystems of S6, and a Conjecture of Prior’s’.

    Google Scholar 

  • Dolph Edward Ulrich (197 +). ‘The Nonexistence of Finite Characteristic Matrices for Subsystems of Ri’.

    Google Scholar 

  • Alasdair Urquhart (1971). Temporal Logic (with Nicholas Rescher).

    Google Scholar 

  • Arnold Vander Nat (1969). ‘The System S9’ (with Storrs McCall).

    Google Scholar 

  • Arnold Vander Nat (1972). ‘Axiomatic, Sequenzen-kalkul, and Subordinate Proof Versions of S9’.

    Google Scholar 

  • Ryszard Wójcicki (1969). ‘Logical Matrices Strongly Adequate for Structural Sentential Calculi’.

    Google Scholar 

  • Ryszard Wójcicki (1970). ‘Some Remarks on the Consequence Operation in Sentential Logics’.

    Google Scholar 

  • Ryszard Wójcicki (1974). ‘Note on Deducibility and Many-valuedness’.

    Google Scholar 

  • Ryszard Wójcicki (1974a). ‘Matrix Approach in Methodology of Sentential Calculi’.

    Google Scholar 

  • Peter Worthing Woodruff (1969). Foundations of Three-valued Logic.

    Google Scholar 

  • Peter Worthing Woodruff (1974a). ‘A Modal Interpretation of Three-valued Logic’.

    Google Scholar 

9. Uses of Many-Valued Logic in the Study of Intuitionistic Logic and Proof Theory (Intermediate Logics)

  • John G. Anderson (1971). ‘The Degree of Completeness of Dummett’s LC and Thomas’ LCn’

    Google Scholar 

  • John G. Anderson (1974). ‘A Note on Intermediate Logics’.

    Google Scholar 

  • R. A. Bull (1962). ‘The Implicational Fragment of Dummett’s LC’.

    Google Scholar 

  • R. A. Bull (1964a). ‘Some Results for Implicational Calculi’.

    Google Scholar 

  • K. J. Cohen (1953). ‘A Remark on Łukasiewicz’s ‘On the Intuitionistic Theory of Deduction’.

    Google Scholar 

  • Michael Dummett (1959). ‘A Propositional Calculus with Denumerable Matrix’.

    Google Scholar 

  • J. Michael Dunn (1970a abstract). ‘Extensions of RM and LC’.

    Google Scholar 

  • J. Michael Dunn (1971). ‘Algebraic Completeness Results for Dummett’s LC and Its Extensions’ (with Robert K. Meyer).

    Google Scholar 

  • Wojciech Dzik (1973). ‘Structural Completeness of Gödel’s and Dummett’s Propositional Calculus’ (with Andrzej Wroński).

    Google Scholar 

  • Dov M. Gabbay (1970). ‘The Decidability of the Kreisel-Putnam System’.

    Google Scholar 

  • Dov M. Gabbay (1971 abstract). ‘The Decidability of the Kreisel-Putnam System’.

    Google Scholar 

  • Ewa Graczynska (1974). ‘On the Construction of Matrices Strongly Adequate for Pre- finite Logics’ (with Andrzej Wroński).

    Google Scholar 

  • Masazumi Hanazawa (1966). ‘A Characterization of Axiom Schema Playing the Role of Tertium Non Datur in Intuitionistic Logic’.

    Google Scholar 

  • Arend Heyting (1956). Intuitionism: An Introduction.

    Google Scholar 

  • Tsutomu Hosoi (1966). ‘Algebraic Proof of the Separation Theorem on Dummett’s LC’.

    Google Scholar 

  • Tsutomu Hosoi (1967). ‘On Intermediate Logics. I’.

    Google Scholar 

  • Tsutomu Hosoi (1969). ‘On Intermediate Logics. II’.

    Google Scholar 

  • Tsutomu Hosoi (1970). ‘The Intermediate Logics on the Second Slice’ (with Hiroakira Ono).

    Google Scholar 

  • Tsutomu Hosoi (197 +). ‘Intermediate Propositional Logics (A Summary)’ (with Hiroakira Ono).

    Google Scholar 

  • Hung Chen Van (1970). ‘Remarks on Intermediate Logics’.

    Google Scholar 

  • V. A. Jankov (1963). ‘O nekotoryh supérkonstruktivnyh isčisléniah vyskazyvanij’ (Some Superconstructive Propositional Calculi).

    Google Scholar 

  • V. A. Jankov (1963a). ‘O realizuémyh formulah logiki vyskazyvanij’ (Realizable Formulas of Propositional Logic).

    Google Scholar 

  • V. A. Jankov (1963b). ‘O svázi mézdu vyvodimost’u v intuitcioniskom isčislenii vyskazyvanij i konéčnymi implikativnymi strukturami’ (The Relationship Between Deducibility in the Intuitionist Propositional Calculus and Finite Implicational Structures).

    Google Scholar 

  • V. A. Jankov (1968). ‘Postroénie poslédovatél’nosti sil’no nezavismyh supérintuicionistskih propozicional’nyh isčislénij’ (Constructing a Sequence of Strongly Independent Super- intuitionistic Propositional Calculi).

    Google Scholar 

  • V. A. Jankov (1968a). ‘Ob isčislenia slabogo zakona isklúčennogo trét’ego’ (The Calculus of the Weak “Law of Excluded Middle”).

    Google Scholar 

  • V. A. Jankov (1968b). ‘On the Extension of the Intuitionist Propositional Calculus to the Classical Calculus, and the Minimal Calculus to the Intuitionist Calculus’ (Russian).

    Google Scholar 

  • V. A. Jankov (1969). ‘Konunktivno nérazložimye formuly v propozicional’nyh isčisléniah’ (Conjunctively Indecomposable Formulas in Propositional Calculi).

    Google Scholar 

  • Robert Elefter Kirk (1972). Intermediate Logics and Equational Classes of Brouwerian Algebras.

    Google Scholar 

  • George Kreisel (1957). ‘Eine Unableitbarkeitsbeweismethode für den intuitionistischen Aussagenkalkül’ (with Hilary Putnam).

    Google Scholar 

  • Jan Łukasiewicz (1937). ‘Wobronie logistyk’ (In Defense of Logistic).

    Google Scholar 

  • Jan Łukasiewicz (1938). ‘Die Logik und das Grundlagenproblem’.

    Google Scholar 

  • Jan Łukasiewicz (1952). ‘On the Intuitionistic Theory of Deduction’.

    Google Scholar 

  • Jan Łukasiewicz (1953c). ‘Comment on K. J. Cohen’s Remark’.

    Google Scholar 

  • A. I. Malcev (1967). ‘Ob odnom usilenii teorem Słupeckogo i Jablonskogo’.

    Google Scholar 

  • C. G. McKay (1967). ‘On Finite Logics’.

    Google Scholar 

  • C. G. McKay (1967a). ‘A Note on the Jaśkowski Sequence’.

    Google Scholar 

  • C. G. McKay (1968). ‘The Decidability of Certain Intermediate Propositional Logics’.

    Google Scholar 

  • C. G. McKay (1968a). ‘The Non-separability of a Certain Finite Extension of Heyting’s Propositional Logic’.

    Google Scholar 

  • C. G. McKay (1971). ‘A Class of Decidable Intermediate Propositional Logics’.

    Google Scholar 

  • C. A. Meredith (1966). ‘Postulates for Implicational Calculi’.

    Google Scholar 

  • Robert K. Meyer (1971a). ‘Algebraic Completeness Results for Dummett’s LC and Its Extensions’ (with J. Michael Dunn).

    Google Scholar 

  • Hiroakira Ono (1970). ‘The Intermediate Logics on the Second Slice’ (with Tsutomu Hosoi).

    Google Scholar 

  • Hiroakira Ono (1971-72). ‘On the Finite Model Property for Kripke Models’.

    Google Scholar 

  • Hiroakira Ono (1972). ‘Some Results on the Intermediate Logics’.

    Google Scholar 

  • Hiroakira Ono (197 +). ‘Intermediate Propositional Logics (A Survey)’ (with Tsutomu Hosoi).

    Google Scholar 

  • M. T. Porębska (1974). ‘A Characterization of Fragments of the Intuitionistic Propositional Logic’ (with Andrzej Wroński).

    Google Scholar 

  • Hilary Putnam (1957). ‘Eine Unableitbarkeitsbeweismethode fur den intuitionistischen Aussagenkalkül’ (with George Kreisel).

    Google Scholar 

  • M. F. Raca (1969). ‘The Class of Functions of Three-valued Logic that Corresponds to the First Matrix of Jaśkowski’ (Russian).

    Google Scholar 

  • M. F. Raca (1970). ‘Functional Completeness in Certain Logics that are Intermediate Between the Classical and Intuitionistic Ones’ (Russian).

    Google Scholar 

  • George Rousseau (1968). ‘Note on a Problem of Porte’.

    Google Scholar 

  • Thoralf Skolem (1929). ‘Über einige Grundlagenfragen der Mathematik’.

    Google Scholar 

  • Stanisław J. Surma (1971). ‘Jaśkowski’s Matrix Criterion for the Intuitionistic Propositional Calculus’.

    Google Scholar 

  • Stanisław J. Surma (1973). ‘Jaśkowski’s Matrix Criterion for the Intuitionistic Propositional Calculus’.

    Google Scholar 

  • Stanisław J. Surma (1974a). ‘On Jaśkowski-style Semantics for the Intuitionistic Pro- positional Logic’ (with Andrzej Wroński and S. Zachorowski).

    Google Scholar 

  • Ivo Thomas (1962). ‘On the Infinity of Positive Logic’.

    Google Scholar 

  • Ivo Thomas (1962a). ‘Finite Limitations on Dummett’s LC’.

    Google Scholar 

  • A. S. Troelstra (1965). ‘On Intermediate Propositional Logics’.

    Google Scholar 

  • Toshio Umezawa (1954a). ‘On Logics Intermediate Between Intuitionistic and Classical Predicate Logic’.

    Google Scholar 

  • Peter W. Woodruff (1973). ‘On Constructive Nonsense Logic’.

    Google Scholar 

  • Andrzej Wroński (1971). ‘Axiomatization of the Implicational Gödel’s Matrices by Kalmar’s Method’.

    Google Scholar 

  • Andrzej Wroński (1971a). ‘Axiomatization of the Implicational Matrix Γ(L2)2 of Jaśkowski’s Family (L1)nr’-

    Google Scholar 

  • Andrzej Wroński (1972). ‘An Algorithm for Finding Finite Axiomatizations of Finite Intermediate Logics’.

    Google Scholar 

  • Andrzej Wroński (1972a). ‘An Algorithm for Finding Finite Axiomatizations of Finite Intermediate Logics’.

    Google Scholar 

  • Andrzej Wroński (1973a). ‘Structural Completeness of Gödel’s and Dummett’s Propositional Calculus’ (with Wojciech Dzik).

    Google Scholar 

  • Andrzej Wroński (1974). ‘On Equivalential Fragments of Some Intermediate Logics’.

    Google Scholar 

  • Andrzej Wroński (1974a). ‘On Jaśkowski-type Semantics for the Intuitionistic Propositional Logic’ (with Stanisław J. Surma and S. Zachorowski).

    Google Scholar 

  • Andrzej Wronski (1974b). ‘On the Construction of Matrices Strongly Adequate for Pre-finite Logics’ (with Ewa Graczyńska).

    Google Scholar 

  • Andrzej Wroński (1974c). ‘A Characterization of Fragments of the Intuitionistic Propositional Logic’ (with M. T. Porębska).

    Google Scholar 

  • Andrzej Wroński (1974d). ‘On Cardinalities of Matrices Strongly Adequate for the Intuitionistic Propositional Logic’.

    Google Scholar 

  • S. Zachorowski (1974). ‘On Jaśkowski-type Semantics for the Intuitionistic Propositional Logic’ (with Staisław J. Surma and Andrzej Wroński).

    Google Scholar 

10. Many-Valued Logic and the Logical Paradoxes

  • G. Asenjo (1966). ‘A Calculus of Antinomies’.

    Google Scholar 

  • Englebretsen (1973). ‘Suggested Truth-tables for a Three-valued Sentential Logic’.

    Google Scholar 

  • Hans Herzberger (1970). ‘Truth and Modality in Semantically Closed Languages’.

    Google Scholar 

  • Jan Łukasiewicz (1910). ‘Über den Satz des Widersprachs bei Aristoteles’.

    Google Scholar 

  • Jan Łukasiewicz (1923). ‘O determinizmie’ (On Determinism).

    Google Scholar 

  • M. J. O’Carroll (1967). ‘A Three-valued Non-levelled Logic Constructed for All Self- reference’.

    Google Scholar 

  • Edward Schuh (1973). ‘Many-valued Logics and the Lewis Paradoxes’.

    Google Scholar 

  • Brian Skyrms (1970). ‘Return of the Liar’: Three-valued Logics and the Concept of Truth’.

    Google Scholar 

  • Brian Skyrms (1970a). ‘Notes on Quantification and Self-reference’.

    Google Scholar 

  • Paul Vincent Spade (197 +). ‘An Alternative to Brian Skyrms Approach to the Liar’.

    Google Scholar 

  • Bas C. van Fraassen (1968). ‘Presupposition, Implication and Self-reference’.

    Google Scholar 

  • Bas C. van Fraassen (1970). ‘Truth and Paradoxical Consequences’.

    Google Scholar 

  • Bas C. van Fraassen (1970a). ‘Rejoinder: On a Kantian Conception of Language’.

    Google Scholar 

  • Bas C. van Fraassen (1971). Formal Semantics and Logic.

    Google Scholar 

III. Philosophical Ramifications 11. Future Contingency and a Neutral Truth-Value

  • Zbigniew Jordan (1963). ‘Logical Determinism’.

    Google Scholar 

  • John King-Farlow (1958). ‘Sea-fights Without Tears’.

    Google Scholar 

  • Tadeusz Kotarbinski (1913). ‘Zagadniewie istnienia pryszłości’ (On the Problem of Existence of Future Events).

    Google Scholar 

  • William Ockham (1969). Predestination, God’s Foreknowledge and Future Contingents.

    Google Scholar 

  • Kenneth A. Seeskin (1971). ‘Many-valued Logic and Future Contingencies’.

    Google Scholar 

  • Kenneth A. Seeskin (1974). ‘Some Remarks on Truth and Bivalence’.

    Google Scholar 

  • Richmond H. Thomason (1970). ‘Indeterminist Time and Truth-value Gaps’.

    Google Scholar 

12. Philosophical Controversies Over ‘Alternative’ Logics

  • Petre Bieltz (1970). ‘Some Remarks Concerning the Principle of Excluded Middle’ (with Mihai Dan Birliba).

    Google Scholar 

  • Mihai Dan Birliba (1970). ‘Some Remarks Concerning the Principle of Excluded Middle’ (with Petre Bieltz).

    Google Scholar 

  • Robert Blanche (1972). ‘Sur la trivalence’.

    Google Scholar 

  • Leonard Goddard (1973). The Logic of Significance and Context. Volume 1 (with Richard Routley).

    Google Scholar 

  • Susan Haack (1975). Deviant Logic.

    Google Scholar 

  • Jan Łukasiewicz (1918). ‘Treść wykładu poz egnalnego prof. Jana Łukasiewicza, wgłos-zonego w auli Uniwersytetu Warszawskiego dnia 7-go Marca 1918’ (Farewell Lecture by Professor Jan Łukasiewicz, Delivered in the Warsaw University Lecture Hall on March 7, 1918 ).

    Google Scholar 

  • Robert A. Pannier (1970 abstract). ‘Axiomatic Systems and m-valued Calculi’.

    Google Scholar 

  • Willard Van Ormand Quine (1970). Philosophy of Logic.

    Google Scholar 

  • Nicholas Rescher (1969). Many-valued Logic.

    Google Scholar 

  • Nicholas Rescher (1969a abstract). ‘Autodescriptive Systems of Many-valued Logic’.

    Google Scholar 

  • Richard Routley (1973). The Logic of Significance and Context. Volume 1 (with Leonard Goddard).

    Google Scholar 

  • John Woods (1974). The Logic of Fiction. A Philosophical Sounding of Deviant Logic.

    Google Scholar 

13. Application of Many-Valued Logic to Philosophical Problems

  • J. M. Bell (197 +). ‘Two Systems of Presupposition Logic’ (with I. L. Humberstone).

    Google Scholar 

  • Nuel D. Belnap, Jr. (1973). ‘Restricted Quantification and Conditional Assertion’.

    Google Scholar 

  • Ross T. Brady (1973). ‘Don’t Care Was Made to Care’ (with Richard Routley).

    Google Scholar 

  • Ross T. Brady (197 +). ‘Significance Logics’.

    Google Scholar 

  • Ross T. Brady (197 +a). ‘Significance Range Theory’.

    Google Scholar 

  • John P. Cleave (1974). ‘The Notion of Logical Consequence in the Logic of Inexact Predicates’.

    Google Scholar 

  • T. Drange (1966). Type Crossings.

    Google Scholar 

  • John Evenden (1972). ‘Generalised Logic’.

    Google Scholar 

  • Mark Fisher (1961). ‘A Three-valued Calculus for Deontic Logic’.

    Google Scholar 

  • Leonard Goddard (1964). ‘Sense and Nonsense’.

    Google Scholar 

  • Leonard Goddard (1966). ‘Predicates, Relations and Categories’.

    Google Scholar 

  • Leonard Goddard (1968). ‘Towards a Logic of Significance’.

    Google Scholar 

  • Leonard Goddard (1969). The Existence of Universals’.

    Google Scholar 

  • Leonard Goddard (1970). ‘Nonsignificance’.

    Google Scholar 

  • Leonard Goddard (1973). The Logic of Significance and Context .Volume 1 (with Richard Routley).

    Google Scholar 

  • R. J. Haack (1971). ‘No Need for Nonsense’.

    Google Scholar 

  • Sören Halldén (1957). On the Logic of ‘Better’.

    Google Scholar 

  • Hans G. Herzberger (1973). ‘Dimensions of Truth’.

    Google Scholar 

  • Hans G. Herzberger (197 +). ‘Setting Russell Free’.

    Google Scholar 

  • I. L. Humberstone (197+). Two Systems of Presupposition Logic’ (with J. M. Bell).

    Google Scholar 

  • Stephan Korner (1966). Experience and Theory. An Essay in the Philosophy of Science.

    Google Scholar 

  • Stephan Korner (1968). ‘Reply to Mr. Kumar’.

    Google Scholar 

  • Stephan Korner (1970). Categorial Frameworks.

    Google Scholar 

  • Dharmendra Kumar (1967). ‘Logic and Inexact Predicates’.

    Google Scholar 

  • Dharmendra Kumar (1969). ‘Neutrality, Contingency and Undecidability’.

    Google Scholar 

  • Dharmendra Kumar (1971). ‘Vagueness and Subjunctivity’.

    Google Scholar 

  • Karel Lambert (1968). ‘On a No Type Theory of Significance’.

    Google Scholar 

  • Storrs McCall (1966). ‘Connexive Implication’.

    Google Scholar 

  • Storrs McCall (1967b). ‘Connexive Implication and the Syllogism’.

    Google Scholar 

  • Hugh Montgomery (1968). ‘On Systems Containing Aristotle’s Thesis’ (with Richard Routley).

    Google Scholar 

  • Edgar Morscher (1971). ‘A Matrix Method for Deontic Logic’.

    Google Scholar 

  • Richard Routley (1966). ‘On a Significance Theory’.

    Google Scholar 

  • Richard Routley (1968). ‘On Systems Containing Aristotle’s Thesis’ (with Hugh Montgomery).

    Google Scholar 

  • Richard Routley (1969). The Need for Nonsense’.

    Google Scholar 

  • Richard Routley (1969a). ‘Categories—Expressions or Things?’ (with Valerie Routley).

    Google Scholar 

  • Richard Routley (1971). ‘Domainless Semantics for Free, Quantification and Significance Logics’.

    Google Scholar 

  • Richard Routley (1973). The Logic of Significance and Context Volume 1 (with Leonard Goddard).

    Google Scholar 

  • Richard Routley (1973a). ‘Don’t Care Was Made to Care’ (with Ross T. Brady).

    Google Scholar 

  • Valerie Routley (1969). ‘Categories—Expressions or Things?’ (with Richard Routley). James LeRoy Stiver (1972). Presupposition, Implication and Necessitation: A Critique of and Alternative to van Fraassen’s Presuppositional Logic.

    Google Scholar 

  • Bas C. van Fraassen (1966). ‘Singular Terms, Truth-value Gaps, and Free Logic’.

    Google Scholar 

  • Bas C. van Fraassen (1968). ‘Presupposition, Implication and Self-reference’.

    Google Scholar 

  • Bas C. van Fraassen (1969). ‘Presuppositions, Supervaluations, and Free Logic’.

    Google Scholar 

  • Bas C. van Fraassen (1970a). ‘Rejoinder: On a Kantian Conception of Language’.

    Google Scholar 

  • Peter W. Woodruff (1970 abstract). ‘A New Approach to Possible Objects’.

    Google Scholar 

  • Peter W. Woodruff (1970a). ‘Logic and Truth Value Gaps’.

    Google Scholar 

  • Lennart Åqvist (1962). ‘Reflections on the Logic of Nonsense’.

    Google Scholar 

  • Lennart Åqvist (1963). ‘Deontic Logic Based on a Logic of “Better”’.

    Google Scholar 

  • Lennart Åqvist (1963a). ‘Postulate Sets and Decision Procedures for Some Systems of Deontic Logic’.

    Google Scholar 

  • Applications of Many-Valued Logic to Linguistics

    Google Scholar 

  • Lauri Karttunen (1973). ‘Presuppositions of Compond Sentences’.

    Google Scholar 

  • Edward Keenan (1972). ‘On Semantically Based Grammar’.

    Google Scholar 

  • George Lakoff (1973). ‘Hedges: A Study in Meaning Criteria and the Logic of Fuzzy Concepts’.

    Google Scholar 

IV. Ramifications in Mathematics, Physics, Computer Science 15. Applications of Many-Valued Logic in Set Theory

  • Ross Thomas Brady (1971). A 4-valued Theory of Classes and Individuals.

    Google Scholar 

  • Ross Thomas Brady (1971a). ‘The Consistency of the Axioms of Abstraction and Extensionality in a Three-valued Logic’.

    Google Scholar 

  • Ross Thomas Brady (1972). ‘The Relative Consistency of the Class Axioms of Abstraction and Extensionality and the Axioms of NBG in a Three-valued Logic’.

    Google Scholar 

  • E. William Chapin, Jr. (197 +). ‘Set-valued Set Theory. I’.

    Google Scholar 

  • E. William Chapin, Jr. (197 +a). ‘Set-valued Set Theory. II’.

    Google Scholar 

  • Bruno D’Amore (1973). ‘Considerazioni strutturali sugli insiemi indecidibili’ (with Maurizio L. M. Matteuzzi).

    Google Scholar 

  • Siegfried Gottwald (1973). ‘Über Einbettungen in Zahlenbereiche einer Mehrwertigen Mengenlehre’.

    Google Scholar 

  • Dieter Klaua (1965). ‘Über einen Ansatz zur mehrwertigen Mengenlehre’.

    Google Scholar 

  • Dieter Klaua (1966). ‘Über einen zweiten Ansatz zur mehrwertigen Mengenlehre’.

    Google Scholar 

  • Dieter Klaua (1967). ‘Ein Ansatz zur mehrwertigen Mengenlehre’.

    Google Scholar 

  • Dieter Klaua (1967a). ‘Einbettung der klassischen Mengenlehre in die Mehrwertige’.

    Google Scholar 

  • Dieter Klaua (197 +). ‘Zur Arithmetik mehrwertiger Zahlen’.

    Google Scholar 

  • Maurizio L. M. Mateuzzi (1973). ‘Considerazioni strutturali sugli insiemi indecidibili’ (with Bruno D.Amore).

    Google Scholar 

  • Robert Edwin Maydole (1973). Many-valued Logic as a Basis for Set Theory.

    Google Scholar 

  • Storrs McCall (1967c). ‘Connexive Class Logic’.

    Google Scholar 

  • Thoralf Skolem (1957a). Mengenlehre gegriindet auf einer Logik mit unendlich vielen

    Google Scholar 

  • Wahrheitswerten’. Thoralf Skolem (1957b). ‘Bemerkungen zum Komprehensionsaxiom’.

    Google Scholar 

  • Thoralf Skolem (1960). ‘A Set Theory Based on a Certain 3-valued Logic’.

    Google Scholar 

  • J. E. Wiredu (1974). ‘A Remark on a Certain Consequence of Connexive Logic for Zermelo’s Set Theory’.

    Google Scholar 

16. Algebraic, Algorithmic, and Topological Models of and Applications in Many-Valued Logics

  • I. Bădele (1969). ‘Sur les extensions des algebres de Lukasiewicz’ (with Vlad Boicescu).

    Google Scholar 

  • R. V. Baĭramov (1969). ‘The Predicate Characterizability of Subalgebras of Many-valued Logic’ (Russian).

    Google Scholar 

  • Edward Bałuka (1965). ‘On Verification of the Expressions of Many-valued Sentential Calculi. I’.

    Google Scholar 

  • Giulano Barton (1971). ‘Algebre di Post monadiche’.

    Google Scholar 

  • R. Beazer (197 +). ‘Post-like Algebras and Injective Stone Algebras’.

    Google Scholar 

  • Leon Birnbaum (197 +). ‘Tripolar Algebra and Logic’.

    Google Scholar 

  • G. N. Blochina (1971). ‘On Basic Groups in k-valued Logic’ (Russian) (with Valeriĭ B. Kudrjavcev).

    Google Scholar 

  • G. N. Blochina (1973). ‘Ein Vollständigkeitskriterium bis auf eine gewisse Äquivalenz-relation für eine verallgemeinerte Postsche Algebra’ (with Valerii B. Kudrjavcev and G. Burosch).

    Google Scholar 

  • G. N. Blochina (1973a). ‘Über verallgemeinerte Postsche Algebren’ (with Valeriĭ B. Kudrjavcev and G. Burosch).

    Google Scholar 

  • V. G. Bodnarčuk (1969). ‘Galois Theory for Post Algebras. I, IF’ (Russian) (with L. A. Kaluznin and V. N. Kotov and B. A. Romov ).

    Google Scholar 

  • Vlad Boicescu (1969). ‘Sur les extensions des algèbres de Lukasiewicz’ (with I. Bădele).

    Google Scholar 

  • Vlad Boicescu (1970). ‘Sur la représentation des algèbres de Lukasiewicz n-valentes’.

    Google Scholar 

  • Vlad Boicescu (1970a). ‘Les algèbres de Lukasiewicz centrées et axées’ (with George Georgescu).

    Google Scholar 

  • Vlad Boicescu (1971). ‘Sur les algèbres de Lukasiewicz’.

    Google Scholar 

  • G. Burosch (1973). ‘Ein Vollständigkeitskriterium bis auf eine gewisse Äquivalenzrelation für eine verallgemeinerte Postsche Algebra’ (with G. N. Blochina and Valeriĭ B. Kudrjavcev).

    Google Scholar 

  • G. Burosch (1973a). ‘Über verallgemeinerte Postsche Algebren’ (with G. N. Blochina and Valeriĭ B. Kudrjavcev).

    Google Scholar 

  • Michel Carvallo (1967). ‘Sur la résolution des équations de Post’.

    Google Scholar 

  • Michel Carvallo (1968a). ‘Sur la resolution des équations de Post a y valeurs’.

    Google Scholar 

  • D. M. Casenoves (1964). ‘L-algebres, multivalent logice’.

    Google Scholar 

  • G. E. Ceĭtlin (1970). ‘The Structure of a Modified Post Algebra and Its Properties’ (Russian).

    Google Scholar 

  • E. Ceiĭtlin (1971). ‘The Infinitely Generated Subalgebras of a Modified Post Algebra’ (Russian).

    Google Scholar 

  • Chen Chung Chang (1957). ‘Algebraization of Infinitely Many-valued Logic’.

    Google Scholar 

  • Chen Chung Chang (1958b). ‘Algebraic Analysis of Many-valued Logics’.

    Google Scholar 

  • Chen Chung Chang (1959). ‘A New Proof of the Completeness of the Łukasiewicz Axioms’.

    Google Scholar 

  • Chen Chung Chang (1961). ‘Prime Ideal Characterization of Generalized Post Algebras’ (with Alfred Horn).

    Google Scholar 

  • Mihail Cherciu (1971). ‘Filtres de Stone dans les treillis distributifs’.

    Google Scholar 

  • Peter T. Cheung (1971). ‘Algebraic Properties of Multi-valued Symmetric Switching Functions’.

    Google Scholar 

  • E. Chresterson (1955). ‘A Class of Generalized Walsh Functions’.

    Google Scholar 

  • Roberto Cignoli (1965). ‘Boolean Elements in Łukasiewicz Algebras. I’.

    Google Scholar 

  • Roberto Cignoli (1965a). ‘Boolean Elements in ukasiewicz Algebras. II’ (with Antonio Monteiro).

    Google Scholar 

  • Roberto Cignoli (1969). Estudio algebraico de logicas polivalentes. Algebras de Moisil de orden N.

    Google Scholar 

  • Roberto Cignoli (1970). Moisil Algebras.

    Google Scholar 

  • Roberto Cignoli (1972). ‘Representation of Lukasiewicz and Post Algebras by Continuous Functions’.

    Google Scholar 

  • A. de Luca (1972). ‘Algebraic Properties of Fuzzy Sets’ (with S. Termini).

    Google Scholar 

  • Jean Drabbe (1973). ‘Sur la représentation des algèbres de Post’.

    Google Scholar 

  • Jean Drabbe (1973a). ‘Étude algèbrique des logiques à plusieurs valeurs’.

    Google Scholar 

  • Edgar G. DuCasse (1972). ‘A Generalized Equivalence Relation for Post Algebras’ (with Gemot A. Metze).

    Google Scholar 

  • Edgar G. DuCasse (1974). ‘Synthesizing Operators Defined on a Class of Decision Algebras from Post Functions’.

    Google Scholar 

  • Philip Dwinger (1966). ‘Notes on Post Algebras. I, II’.

    Google Scholar 

  • Philip Dwinger (1968). ‘Generalized Post Algebras’.

    Google Scholar 

  • Philip Dwinger (1969). ‘Ideals in Generalized Post Algebras’.

    Google Scholar 

  • George Epstein (1960). ‘The Lattice Theory of Post Algebras’.

    Google Scholar 

  • George Epstein (1971 abstract). ‘On Unary Operators in Post Algebras’.

    Google Scholar 

  • George Epstein (1971a abstract). ‘Aspects of Post Algebras’.

    Google Scholar 

  • George Epstein (1971c). ‘Decision Algebras’.

    Google Scholar 

  • George Epstein (1973). ‘An Equational Axiomatization for the Disjoint System of Post Algebras’.

    Google Scholar 

  • George Epstein (1973a). ‘Comments on “The Relationship Between Multivalued Switching Algebra and Boolean Algebra under Different Definitions of Complement”’.

    Google Scholar 

  • George Epstein (1974a). ‘Propositional Calculi Based on Subresiduation’ (with Alfred Horn).

    Google Scholar 

  • George Epstein (1974b). ‘Finite Limitations on a Propositional Calculus for Affirmation and Negation’ (with Alfred Horn).

    Google Scholar 

  • George Epstein (197+a). ‘P-algebras, an Abstraction from Post Algebras’ (with Alfred Horn).

    Google Scholar 

  • George Epstein (197 +b). ‘Chain Based Lattices’ (with Alfred Horn).

    Google Scholar 

  • George Epstein (197 +c). ‘Logics Which are Characterized by Subresiduated Lattices’ (with Alfred Horn).

    Google Scholar 

  • George Epstein (197 +d). Decisive Implication.

    Google Scholar 

  • Angelo Fadini (1962). ‘II calcolo della classe in una logica a tre valori di verita’.

    Google Scholar 

  • G. P. Gavrilov (1964). ‘On Quasi-Peano Functions’ (Russian).

    Google Scholar 

  • George Georgescu (1969). ‘Algèbres de Lukasiewicz completes’.

    Google Scholar 

  • George Georgescu (1969a). ‘N-valued Centered Lukasiewicz Algebras’ (with Constant in Vraciu).

    Google Scholar 

  • George Georgescu (1969b). ‘Le spectre maximal d’une algèbre de Lukasiewicz’ (with Constant in Vraciu).

    Google Scholar 

  • George Georgescu (1969c). ‘Sur les algèbres de Lukasiewicz centrées’ (with Constant in Vraciu).

    Google Scholar 

  • George Georgescu (1969d). ‘Sur le spectre maximal d’une algèbre de Lukasiewicz’ (with Constantin Vraciu).

    Google Scholar 

  • George Georgescu (1969e). ‘Sur les épimorphismes centrées de algèbres de Lukasiewicz’ (with Constant in Vraciu).

    Google Scholar 

  • George Georgescu (1970). ‘Caractérisation des épimorphismes des algèbres de Lukasiewicz θ-valentes’.

    Google Scholar 

  • George Georgescu (1970a). ‘La dualité des algèbres de Post θ-valentes’.

    Google Scholar 

  • George Georgescu (1970b). ‘Les algèbres de Lukasiewicz centrées et axées’ (with Vlad Boicescu).

    Google Scholar 

  • George Georgescu (1970c). ‘On the Characterization of Centered Lukasiewicz Algebras’ (with Constant in Vraciu).

    Google Scholar 

  • George Georgescu (1970d). ‘The Centered Epimorphisms and the Construction of the Tensor Product in Lukn’.

    Google Scholar 

  • George Georgescu (1971). ‘Les algèbres de Lukasiewiz θ-valentes’.

    Google Scholar 

  • George Georgescu (1971a). ‘Algèbres de Lukasiewicz monadiques et polyadiques’.

    Google Scholar 

  • George Georgescu (1971b). ‘Théorème de complétitude en logique θ-valente’.

    Google Scholar 

  • George Georgescu (1971c). ‘The θ-valued Lukasiewicz Algebras. I’.

    Google Scholar 

  • George Georgescu (197Id). ‘Algebras de Lukasiewicz de orden θ. II’.

    Google Scholar 

  • George Georgescu (1971e). ‘N-valued Complete Lukasiewicz Algebras’.

    Google Scholar 

  • George Georgescu (197If)- ‘Algebre Lukasiewicz monadice’ (with Constantin Vraciu).

    Google Scholar 

  • George Georgescu (1971g). ‘The θ-valued Lukasiewicz Algebras. III’.

    Google Scholar 

  • George Georgescu (1971h). ‘Les θ-ultrafiltres validants d’algèbre de Lindenbaum-Tarski d’un calcul des prédicats a θ-valeurs’.

    Google Scholar 

  • George Georgescu (1971i). The θ-valued Lukasiewicz Algebras. IV’.

    Google Scholar 

  • George Georgescu (1972). ‘Représentation des algèbres de Lukasiewicz θ-valentes polyadiques’.

    Google Scholar 

  • George Georgescu (1972a). ‘Representations of Locally Finite and of Infinite Degree Polyadic Lukasiewicz Algebras’ (Roumanian).

    Google Scholar 

  • George Georgescu (197 +a). ‘Monadic and Polyadic Lukasiewicz Algebras’.

    Google Scholar 

  • George Georgescu (197 +c). ‘La dualité des algèbres de Post θ-valentes’ (with Constantin Vraciu).

    Google Scholar 

  • A. G. Gorelik (1967). ‘Geometric Interpretation of a Three-valued Algebra’ (Russian).

    Google Scholar 

  • R. S. Grigolia (1973). ‘Algebraiczeskij analiz n-znacznych logiczeskich sistem Lukasie- wicza-Tarskogo’.

    Google Scholar 

  • Alfred Horn (1961). ‘Prime Ideal Characterization of Generalized Post Algebras’.

    Google Scholar 

  • Alfred Horn (1969). ‘Logic with Truth-values in a Linearly Ordered Heyting Algebra’.

    Google Scholar 

  • Alfred Horn (1969a). ‘Free L-algebras’.

    Google Scholar 

  • Alfred Horn (1974). ‘Propositional Calculi Based on Subresiduation’ (with George Epstein).

    Google Scholar 

  • Alfred Horn (1974a). ‘Finite Limitations on a Propositional Calculus for Affirmation and Negation’ (with George Epstein).

    Google Scholar 

  • Alfred Horn (197+). ‘P-algebras, an Abstraction from Post Algebras’ (with George Epstein).

    Google Scholar 

  • Alfred Horn (197 +a). ‘Chain Based Lattices’ (with George Epstein).

    Google Scholar 

  • Alfred Horn (197+b). ‘Logics Which are Characterized by Subresiduated Lattices’ (with George Epstein).

    Google Scholar 

  • Tsutomu Hosoi (1966a). ‘On the Separation Theorem of Intermediate Propositional Calculi’.

    Google Scholar 

  • Tsutomu Hosoi (1966b). ‘The Separable Axiomatization of the Intermediate Propositional Systems Sn’.

    Google Scholar 

  • Seppo Ilkka (1966). A New Arithmetization of Finitely Many-valued Propositional Calculi.

    Google Scholar 

  • Kiyoshi Iséki (1966). ‘A Pentavalued Logic and Its Algebraic Theory’ (with Shotaro Tanaka).

    Google Scholar 

  • Kiyoshi Iséki (1966a). ‘Some Three Valued Logics and Its Algebraic Representation’.

    Google Scholar 

  • Luisa Iturrioz (1969). ‘Erratum: Sur une classe particulière d’algèbres de Moisil’.

    Google Scholar 

  • S. V. Jablonskiĭ (1972). ‘Decidable Equivalents of Regular Superpositions in P k (Russian) (with E. Ju. Zaharova).

    Google Scholar 

  • P. Janin (1969). ‘Bases de l’algebrisation de la logique trivalente’.

    Google Scholar 

  • Milutin M. Jorgović (1969). ‘A Remark Concerning a Base for Many-valued Propositional Algebra’ (Serbo-Croatian).

    Google Scholar 

  • L. A. Kalužnin (1969). ‘Galois Theory for Post Algebras. I, II’ (Russian) (with V. G.

    Google Scholar 

  • Bodnarcuk and V. N. Kotov and B. A. Romov).

    Google Scholar 

  • Andy N. C. Kang (1974). ‘On the Boolean Functions Over 4-element Boolean Algebra’ (with Stewart N. T. Chen).

    Google Scholar 

  • Vladimir G. Kirin (1963). ‘On the Polynomial Representation of Operators in the n-valued Propositional Calculus’.

    Google Scholar 

  • Vladimir G. Kirin (1968). ‘Post Algebras as Semantic Bases of Some Many-valued Logics’.

    Google Scholar 

  • Robert Elefter Kirk (1972). Intermediate Logics and Equational Classes of Brouwerian Algebras.

    Google Scholar 

  • K. L. Kodandapani (1974). ‘Multi-valued Algebraic Generalizations of Reed-Muller Canonical Forms’ (with Rangaswamy V. Setlur).

    Google Scholar 

  • V. N. Kotov (1969). ‘Galois Theory for Post Algebras. I, II’ (Russian) (with V. G. Bodnarcuk and L. A. Kaluznin and B. A. Romov ).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev(197lb). ‘On Basic Groups in k-valued Logics’ (with G. N. Blochina).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1973). ‘Ein Vollstandigkeitskriterium bis auf eine gewisse Äquivalenzrelation für eine verallgemeinerte Postsche Algebra’ (with G. N. Blochina and G. Burosch).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1973a). ‘Über verallgemeinerte Postsche Algebren’ (with G. N. Blochina).

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1974). ‘On the Functional PΣ’ (Russian).

    Google Scholar 

  • A. I. Mal’cev (1966). ‘Iterativnye algebry i mnogobrazia Posta’ (Post’s Iterative Algebras and Varieties).

    Google Scholar 

  • A. I. Mal’cev (1973a). ‘Some Properties of Cellular Subalgebras of a Post Algebra and their Basic Cells’ (Russian).

    Google Scholar 

  • Grzegorz Malinowski (1973). ‘MVk Algebras’.

    Google Scholar 

  • Grzegorz Malinowski (1974). ‘S-algebras for n-valued Sentential Calculi of Łukasiewicz’.

    Google Scholar 

  • Grzegorz Malinowski (1974a). ‘S-algebras and the Degrees of Maximality for Three- and Four-Valued Logics of Łukasiewicz’.

    Google Scholar 

  • Grzegorz Malinowski (1974b). ‘Degrees of Maximality of Some ukasiewicz Logics’.

    Google Scholar 

  • W. Marek (1969). ‘Generalized Łukasiewicz Algebras’ (with Tadeusz Traczyk).

    Google Scholar 

  • Antoine Marquetty (1974 abstract). ‘Generalized Many-valued Logics’.

    Google Scholar 

  • Gemot A. Metze (1971). ‘Some Relationships Between Post and Boolean Algebras’ (with A. S. Wojcik).

    Google Scholar 

  • Gemot A. Metze (1972). ‘A Generalized Equivalence Relation for Post Algebras’ (with Edgar G. DuCasse).

    Google Scholar 

  • Grigor Constantin Moisil (1936). ‘Recherches sur l’algèbre de la logique’.

    Google Scholar 

  • Grigor Constantin Moisil (1940-41). ‘Sur la structure algèbrique de la logique de M. Bochvar’.

    Google Scholar 

  • Grigor Constantin Moisil (1941c). ‘Contributions a l’ètude des logiques non-chrysippiennes. I. Un nouveau système d’axiomes pour les algèbres Łukasiewicziennes tetra-valentes’.

    Google Scholar 

  • Grigor Constantin Moisil (1942b). ‘Contributions a l’ètude des logiques non-chrysippiènnes. II. Anneaux engendrés par les algebrés Łukasiewicziennes tetravalentes centrées’.

    Google Scholar 

  • Grigor Constantin Moisil (1942c). ‘Contributions a l’étude des logiques non-chrysippiènnes. III. Anneaux engendrés par les algèbres Łukasiewicziennes tetravalentes axées’.

    Google Scholar 

  • Grigor Constantin Moisil (1960a). ‘Sur les idéaux des algèbres Łukasiewicziennes tri-valentes’.

    Google Scholar 

  • Grigor Constantin Moisil (1963a). ‘Le algebre di Lukasiewicz’.

    Google Scholar 

  • Grigor Constantin Moisil (1972a). ‘Les ensembles flous et la logique à trois valeurs’.

    Google Scholar 

  • Grigor Constantin Moisil (1972e). ‘Les axiomes de algèbres de Lukasiewicz n-valentes.’

    Google Scholar 

  • Grigor Constantin Moisil (1972f). ‘Sur les algèbres de Lukasiewicz θ-valentes’.

    Google Scholar 

  • António Monteiro (1963). ‘Sur la définition des algèbres de Łukasiewicz trivalentes’.

    Google Scholar 

  • António Monteiro (1965). ‘Boolean Elements in Łukasiewicz Algebras. II’ (with Roberto Cignoli).

    Google Scholar 

  • António Monteiro (1967). ‘Construction des algèbres de Lukasiewicz trivalentes dans les algèbres de Boole monadiques. I’.

    Google Scholar 

  • Luiz F. T. Monteiro (1963). ‘Axiomes independent pour les algebres de Łukasiewicz trivalentes’.

    Google Scholar 

  • Luiz F. T. Monteiro (1965a). ‘Sur les algèbres de Łukasiewicz injectives’.

    Google Scholar 

  • Luiz F. T. Monteiro (1970). ‘Les algèbres de Heyting et de Łukasiewicz trivalentes’.

    Google Scholar 

  • Luiz F. T. Monteiro (1970a). ‘Extension d’homomorphismes dans les algèbres de Lukasiewicz trivalentes’.

    Google Scholar 

  • Luiz F. T. Monteiro (1972). ‘Algèbre du calcul propositionnel trivalent de Heyting’.

    Google Scholar 

  • V. L. Murskij (1965). ‘Suśćéstvovanie v trehznačnoj logiké zamknutogo klassa s konéčnymbazisom, né imme’úščego konéčnoj polnoj sistémy toždéstv’ (The Existence in Three- valued Logic of a Closed Class with Finite Basis, Not Having a Finite, Complete System of Identities).

    Google Scholar 

  • Gh. S. Nadiu (1967). ‘On a Method of Construction of Trivalent Lukasiewicz Algebras’ (Roumanian).

    Google Scholar 

  • Nguen Cat-Ho (1972). ‘Generalized Algebras of Post and Their Applications to Infinitely Many-valued Logics with Infinitely Long Formulas’.

    Google Scholar 

  • Nguen Cat-Ho (1973). ‘Generalized Post Algebras and Their Application to Some In- finitary Many-valued Logics’.

    Google Scholar 

  • Alexandru Petcu (1968). ‘The Definition of the Trivalent Lukasiewicz Algebras in Three Equations’.

    Google Scholar 

  • Nicolae Popovici (1968). ‘On the Consensus Theory for the Trivalent Argument Functions’.

    Google Scholar 

  • R. Pöschel (1973). ‘Postsche Algebren von Funktionen über einer Familie endlicher Mengen’.

    Google Scholar 

  • R. Pöschel (1973a). ‘Postsche Algebren von Funktionen über einer Familie endlicher Mengen’.

    Google Scholar 

  • Dhiraj K. Pradhan (1974). ‘A Multi-valued Switching Algebra Based on Finite Fields’.

    Google Scholar 

  • F. P. Preparata (1972). ‘Continuously Valued Logic’ (with R. T. Yeh).

    Google Scholar 

  • Helena Rasiowa (1969). ‘A Theorem on the Existence of Prime Filters in Post Algebras and the Completeness Theorem for Some Many-valued Predicate Calculi’.

    Google Scholar 

  • Helena Rasiowa (1972a). ‘On Logical Structure of Programs’.

    Google Scholar 

  • Helena Rasiowa (1973). ‘On Generalized Post Algebras of Order ω+ and ω+valued Predicate Calculi’.

    Google Scholar 

  • Helena Rasiowa (1973a). ‘On a Logical Structure of Mixed-valued Programs and the ω+ -valued Algorithmic Logic’.

    Google Scholar 

  • Helena Rasiowa (1974). An Algebraic Approach to Non-classical Logics.

    Google Scholar 

  • Helena Rasiowa (197 +). ‘Post Algebras as a Semantic Foundation of Many-valued Logics’.

    Google Scholar 

  • Juliusz Reichbach (1967). Boolean Many Valued Calculi With Quantifiers and a Homogeny Proof of Gödel-Skolem-Löwenheim-Herbrand’s Theorems.

    Google Scholar 

  • David C. Rine (1973a). ‘Conditional and Post Algebra Expressions’.

    Google Scholar 

  • David C. Rine (1974). ‘There is More to Boolean Algebra Then You Would Have Thought’.

    Google Scholar 

  • B. A. Romov (1971). ‘On Unimprimitive Bases of Maximal Post Subalgebras’ (Russian).

    Google Scholar 

  • B. A. Romov (1969). ‘Galois Theory for Post Algebras. I, II’ (Russian) (with V. G. Bodnarcuk and L. A. Kaluznin and V. N. Kotov ).

    Google Scholar 

  • Alan Rose (1966-68). ‘An Algebraic Model of the m-valued Propositional Calculus with Variable Functors’.

    Google Scholar 

  • Ivo G. Rosenberg (1969). ‘Über die Verschiedenheit maximaler Klassen in Pk’.

    Google Scholar 

  • Ivo G. Rosenberg (1970). ‘Complete Sets for Finite Algebras’.

    Google Scholar 

  • George H. Rousseau (1969). ‘Logical Systems with Finitely Many Truth-values’.

    Google Scholar 

  • George H. Rousseau (1970a). ‘Post Algebras and Pseudo-Post Algebras’.

    Google Scholar 

  • V. L. Rvačov (1968). ‘Rk-functions’ (Ukrainian) (with L. Ī. Škljarov).

    Google Scholar 

  • Albert Sade (1969a). ‘Algèbre de Łukasiewicz dans la logique trivalente’.

    Google Scholar 

  • Arto Salomaa (1963a). On Essential Variables of Functions, Especially in the Algebra of Logic.

    Google Scholar 

  • Achilles A. Sarris (1972). ‘The Relationship Between Multi-valued Switching Algebra and Boolean Algebra Under Different Definitions of Complement’ (with Stephan Y. H. Su).

    Google Scholar 

  • Halina Savicka (1971). ‘On Some Properties of Generalized Post Algebras’.

    Google Scholar 

  • Halina Savicka (1972). ‘On Some Properties of Post Algebras with Countable Chain of Constants’.

    Google Scholar 

  • Peter Schofield (1969). ‘Independent Conditions for Completeness of Finite Algebras With a Single Generator’.

    Google Scholar 

  • Michel Serfati (1973). ‘Sur les polynômes postiens’.

    Google Scholar 

  • Rangaswamy V. Setlur (1974). ‘Multi-valued Algebraic Generalizations of Reed-Muller Canonical Forms’ (with K. L. Kodandapani).

    Google Scholar 

  • Stewart N. T. Shen (1974). ‘On the Boolean Functions Over 4-element Boolean Algebra’ (with Andy N. C. Kang).

    Google Scholar 

  • V. I. Shestakov (1941). ‘Algèbra dvuhpolusnyh shém, postroénnyh isklúčitel’no iz dvuh- polusnikov (algèbra A-shém).

    Google Scholar 

  • Corneliu O. Sicoe (1966). ‘Elemente strict chrysippience în algebre lukasiewiczien poly- valente’ (Strict Chrysippian Elements in Polyvalent Lukasiewicz Algebras).

    Google Scholar 

  • Corneliu O. Sicoe (1967). ‘Sur les idéaux des algèbres lukasiewicziennes polyvalentes’.

    Google Scholar 

  • Corneliu O. Sicoe (1967a). ‘On Many-valued Łukasiewicz Algebras’.

    Google Scholar 

  • Corneliu O. Sicoe (1967b). ‘A Characterization of Lukasiewiczian Algebras. I’.

    Google Scholar 

  • Corneliu O. Sicoe (1967c). ‘A Characterization of Lukasiewiczian Algebras. II’.

    Google Scholar 

  • Corneliu O. Sicoe (1967d). ‘Note asupra algebrelor lukasiewiczienne polivalente’.

    Google Scholar 

  • Corneliu O. Sicoe (1968). ‘Sur le définition des algèbres lukasiewicziennes polyvalentes’.

    Google Scholar 

  • L. Ī. Škljarov (1968). ‘Rk-functions’ (Ukrainian) (with V. L. Rvačov).

    Google Scholar 

  • M. Stojakovic (1966). ‘Matrizeninversion in der algebraischen Theorie der Wahrheits- funktionen der mehrwertigen Logik’.

    Google Scholar 

  • Stephan Y. H. Su (1971). ‘Algebraic Properties of Multi-valued Symmetric Switching Functions’ (with Peter T. Cheung).

    Google Scholar 

  • Stephan Y. H. Su (1972). ‘The Relationship Between Multi-valued Switching Algebras and Boolean Algebra under Definitions of Complement’ (with Achilles A. Sarris).

    Google Scholar 

  • Wojciech Suchon (1972). ‘On Non-equivalence of Two Definitions of the Algebras of Łukasiewicz’.

    Google Scholar 

  • Wojciech Suchon (1972a). ‘Non-equivalence of Certain Definitions of Infinite Łukasiewicz Algebras’.

    Google Scholar 

  • Wojciech Suchon (1972b). ‘Inequivalence des deux definitions des algebres de Łukasiewicz’.

    Google Scholar 

  • Wojciech Suchon (1974b). ‘Matrix Lukasiewicz Algebras’.

    Google Scholar 

  • Wojciech Suchon (197 +). ‘Matrix Lukasiewicz Algebras’.

    Google Scholar 

  • Stanisław J. Surma (1973 abstract). ‘A Method of the Construction of Łukasiewiczian Algebras and Its Application to Gentzen-style Characterization of Lukasiewiczian Logics’.

    Google Scholar 

  • Stanisfaw J. Surma (1974). ‘A Method of the Construction of Finite Lukasiewiczian Algebras and Its Application to Gentzen-stile Characterization of Finite Logics’.

    Google Scholar 

  • Moto-o Takahashi (1967). ‘Many-valued Logics of Extended Gentzen Style I’.

    Google Scholar 

  • Moto-o Takahashi (1970). ‘Continuous λ-Є Logics’.

    Google Scholar 

  • Moto-o Takahashi (1970a). ‘Many-valued Logics of Extended Gentzen Style II’.

    Google Scholar 

  • Moto-o Takahashi (1971 abstract). ‘On the Consistency of the Comprehension Axiom in Continuous Logic’.

    Google Scholar 

  • Shotaro Tanaka (1966). ‘A Pentavalued Logic and Its Algebraic Theory’ (with Kiyoshi Iseki).

    Google Scholar 

  • S. Termini (1972). ‘Algebraic Properties of Fuzzy Sets’ (with A. de Luca).

    Google Scholar 

  • Marek Tokarz (1974). ‘Binary Functions Definable in Implicational Godel Algebras’.

    Google Scholar 

  • Tadeusz Traczyk (1962). ‘On Axioms and Some Properties of Post Algebras’.

    Google Scholar 

  • Tadeusz Traczyk (1963). ‘Some Theorems on Independence in Post Algebras’.

    Google Scholar 

  • Tadeusz Traczyk (1963a). ‘Axioms and Some Properties of Post Algebras’.

    Google Scholar 

  • Tadeusz Traczyk (1964). ‘A Generalization of Loomis-Sikorski’s Theorem’.

    Google Scholar 

  • Tadeusz Traczyk (1964a). ‘An Equational Definition of a Class of Post Algebras’.

    Google Scholar 

  • Tadeusz Traczyk (1965). ‘Weak Isomorphism of Boolean and Post Algebras’.

    Google Scholar 

  • Tadeusz Traczyk (1967). ‘On Post Algebras With Uncountable Chain of Constants. Algebras of Homomorphisms’.

    Google Scholar 

  • Tadeusz Traczyk (1968). ‘Prime Ideals in Generalized Post Algebras’.

    Google Scholar 

  • Tadeusz Traczyk (1969). ‘Generalized Łukasiewicz Algebras’ (with W. Marek).

    Google Scholar 

  • Janez Usan (1965). ‘Definition of a Constructability in Algebraic Systems with Finite Sets (Partial and Many-valued) of N-operations and Some of Their Properties’ (Serbo- Croatian).

    Google Scholar 

  • J. C. Varlet (1968). ‘Algebres de Lukasiewicz trivalentes’.

    Google Scholar 

  • J. C. Varlet (1969). ‘Considérations sur les algèbres de Lukasiewicz trivalentes’.

    Google Scholar 

  • V. V. Visin (1963). ‘Toždésvénnyé préobrazovaniá v čétyréhznačnoj logiké’ (Identical Transformations in Four-place Logic).

    Google Scholar 

  • Constantin Vraciu (1969). ‘N-valued Centered Lukasiewicz Algebras’ (with George Georgescu).

    Google Scholar 

  • Constantin Vraciu (1969a). ‘Le spectre maximal d’une algèbre de Lukasiewicz’ (with George Georgescu).

    Google Scholar 

  • Constantin Vraciu (1969b). ‘Sur les algèbres de Lukasiewicz centrées’ (with George Georgescu).

    Google Scholar 

  • Constantin Vraciu (1969c). ‘Sur le spectre maximal d’une algèbre de Lukasiewicz’ (with George Georgescu).

    Google Scholar 

  • Constantin Vraciu (1969d). ‘Sur les épimorphismes centrées des algèbres de Lukasiewicz’ (with George Georgescu).

    Google Scholar 

  • Constantin Vraciu (1970). ‘On the Characterization of Centered Lukasiewicz Algebras’ (with George Georgescu).

    Google Scholar 

  • Constantin Vraciu (197+). ‘La dualité des algèbres de Post θ-valentes’ (with George Georgescu).

    Google Scholar 

  • Constantin Vraciu (197+a). ‘Algebre Lukasiewicz monadice’ (with George Georgescu).

    Google Scholar 

  • Donald L. Webb (1938 abstract). ‘A Set of Postulates for an Algebra of n-valued Logic’.

    Google Scholar 

  • B. Weglorz (1970). ‘A Representation Theorem for Post-like Algebras’.

    Google Scholar 

  • T. C. Wesselkamper (1974a). ‘Some Completeness Results for Abelian Semigroups and Groups’.

    Google Scholar 

  • E. Wfodarska (1970). ‘On Representation of Post Algebras Preserving Some Infinite Joins and Meets’.

    Google Scholar 

  • A. S. Wojcik (1971). ‘Some Relationships Between Post and Boolean Algebras’ (with Gemot A. Metze).

    Google Scholar 

  • Peter Worthing Woodruff (1969). Foundations of Three-valued Logic.

    Google Scholar 

  • É. Jú. Zaharova (1972a). ‘Decidable Equivalents of Regular Superpositions in P k ( Russian) (with S. V. Jablonskiĭ).

    Google Scholar 

17. Probabilistic Variants of Many-Valued Logic

  • Peter Holger Krauss (1966). Probability Logic.

    Google Scholar 

  • R. S. Michalski (1974). ‘Variable-valued Logic’.

    Google Scholar 

  • Grigor Constantin Moisil (1972c). ‘La logique des concepts nuancées’.

    Google Scholar 

  • Nicholas Rescher (1963). ‘A Probabilistic Approach to Modal Logic’.

    Google Scholar 

  • Imre Ruzsa (1969). ‘Random Models of Logical Systems. I: Models of Valuing Logics’.

    Google Scholar 

  • Imre Ruzsa (1970). ‘Random Models of Logical Systems. II: Models of Some Modal Logics’.

    Google Scholar 

18. Applications of Many-Valued Logic in Physics

  • Patrick A. Heelan (1970). ‘Quantum Logic and Classical Logic: Their Respective Roles’.

    Google Scholar 

  • Karel Lambert (1969). ‘Logic and Microphysics’.

    Google Scholar 

  • Hilary Putnam (1969). ‘Is Logic Empirical?’.

    Google Scholar 

  • Bas C. van Fraassen (1974). ‘The Labyrinth of Quantum Logics’.

    Google Scholar 

Circuitry, Switching-Theory and Computer Applications of Many-Valued Logic

  • K. Abe (1972). ‘A Problem in the Many-valued Threshold Logic and Its Solution’ (with T. Haga and T. Fukumura).

    Google Scholar 

  • George Abraham (1974). ‘Variable Radix Multistable Integrated Circuits’.

    Google Scholar 

  • J. Again (1960). Setun (Russian).

    Google Scholar 

  • T. Aibara (1973). ‘Multiple-valued Variable-threshold Logic and Its Application to the Realization of the Set of Boolean Functions’ (with Y. Takamatsu and K. Murakami).

    Google Scholar 

  • T. Aibara (1974). ‘Isobaricity for a Set of Multiple-valued Logical Functions and Its Application to the Synthesis of Multi-threshold Elements’ (with Y. Takamatsu and K. Murakami).

    Google Scholar 

  • W. Alexander (1960). ‘An Introduction to the Ternary Number System’ (with D. J. Morris).

    Google Scholar 

  • Charles M. Allen (1968). ‘A Minimization Technique for Multiple-valued Logic Systems’ (with Donald D. Givone).

    Google Scholar 

  • Charles M. Allen (1971). ‘An Approach to Multiple-valued Sequential Circuit Synthesis’ (with E. Zavisca).

    Google Scholar 

  • Charles M. Allen (1973). ‘Applying Multiple-valued Algebra Concepts to Neural Modeling’ (with R. F. Mattrey and Donald D. Givone).

    Google Scholar 

  • Charles M. Allen (1973a). ‘Coordinate Representation and Structural Invariants for Many-valued Switching Functions’.

    Google Scholar 

  • D. J. Anderson (1963). ‘A Magnetic Ternary Device’ (with D. L. Dietmeyer).

    Google Scholar 

  • H. Arango (1964). ‘On the Analysis and Synthesis of 3-valued Digital Systems’ (with J. Santos).

    Google Scholar 

  • H. Arango (1965). ‘A Ternary Storage Element Using a Conventional Ferrite Core’ (with J. Santos and M. Pascual).

    Google Scholar 

  • H. Arango (1970). ‘A Cyclic Algebra for the Synthesis of Ternary Digital Systems’ (with J. Santos and M. Pascual and G. Roing).

    Google Scholar 

  • T. Asabe (1972). ‘Multilevel Balanced Code with Redundant Digits’ (with Yoshikazu Tezuka).

    Google Scholar 

  • T. Asabe (1972a). ‘On Cyclic Multilevel Codes’ (with H. Nakanishi and Yoshikazu Tezuka).

    Google Scholar 

  • T. Asabe (1972b). ‘Spectral Density of Cyclic Multilevel Code’ (with H. Nakanishi and Yoshikazu Tezuka).

    Google Scholar 

  • H. Ataka (1972). ‘On the Definition of Ternary Threshold Functions’.

    Google Scholar 

  • H. Ataka (1972a). ‘On the Unateness of Ternary Functions’.

    Google Scholar 

  • J. W. Backus (1958). ‘The Syntax and Semantics of the Proposed International Algebraic Language of the Zurich ALM-GAMM Conference’.

    Google Scholar 

  • J. S. Bailey (1962). ‘Single Function Shifting Counters’ (with George Epstein).

    Google Scholar 

  • J. S. Bailey (1966). ‘Generalized Single-ended Counters’.

    Google Scholar 

  • N. Bell (1972). ‘Extension of the Boolean Difference Concept to Multi-valued Logic Systems’ (with E. W. Page and M. G. Thomason).

    Google Scholar 

  • Richard E. Bellman (1970). ‘Decision-making in a Fuzzy Environment’ (with Lufti A. Zadeh).

    Google Scholar 

  • Richard E. Bellman (1973). ‘On the Analytic Formalism of the Theory of Fuzzy Sets’ (with Magnus Giertz).

    Google Scholar 

  • J. E. Birk (1974). ‘Design of Multi-valued Combinational Switching Circuits Using Principally Binary Components’ (with D. E. Farmer).

    Google Scholar 

  • A. Bittner (1973). ‘A Ternary Positional Automatic Control System’ (with Claudio Moraga).

    Google Scholar 

  • W. Bitts (1943). ‘A Logical Analysis of the Ideas Immanent in Nervous Activity’ (with W. S. McCulloch).

    Google Scholar 

  • C. Bohm (1966). ‘Flow Diagrams, Turing Machines, and Languages with Only Two Formation Rules’ (with G. Jacopini).

    Google Scholar 

  • R. C. Braddock (1971). ‘Multiple-valued Logic Design and Applications in Binary Computers’ (with George Epstein and M. Yamanaka).

    Google Scholar 

  • M. A. Breuer (1973). ‘The Smallest Many-valued Logic for Treatment of Complemented and Uncomplemented Error Signals’ (with George Epstein).

    Google Scholar 

  • N. P. Brusentzov (1960). The Computer Setun of Moscow State University (Russian).

    Google Scholar 

  • N. P. Brusentzov (1962). ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with Y. A. Zhugolev and V. V. Verigin and S. P. Maslov and A. M. Tishulina ).

    Google Scholar 

  • N. P. Brusentzov (1965). ‘A Ternary Arithmetic Machine’ (Russian).

    Google Scholar 

  • A. Cabanes (1973). ‘Minimal Representation of a Function of Several Finite Variables - Applications to Data Bank’ (with E. Pichet).

    Google Scholar 

  • Robert G. Cain (1974). ‘A Practical Approach to Two-level Minimization of Multivalued Logic’ (with Daniel L. Ostapko and Se June Hong).

    Google Scholar 

  • J. W. Carr III (1959). ‘A Visit to Computation Centers in the Soviet Union’ (with A. J. Perlis and J. E. Robertson and N. R. Scott).

    Google Scholar 

  • Chin-liang Chang (1971). ‘Some Properties of Fuzzy Logic’ (with Richard C. T. Lee).

    Google Scholar 

  • Y. Chao (1973). ‘A Balanced Ternary Computer’ (with Gideon Frieder and A. Fong).

    Google Scholar 

  • Peter T. Cheung (1971a). Computer-oriented Algorithm for Minimizing Multi-valued

    Google Scholar 

  • Switching Functions’ (with Stephan Y. H. Su).

    Google Scholar 

  • Peter T. Cheung (1972). ‘Computer Minimization of Multi-valued Switching Functions’ (with Stephan Y. H. Su).

    Google Scholar 

  • Henry Y. H. Chuang (1974). ‘On the Design of Reliable and Fail-safe Digital Systems Using Multiple-valued Logic’ (with Santanu Das).

    Google Scholar 

  • M. Cohn (1961). ‘Canonical Forms of Functions in p-valued Logics’.

    Google Scholar 

  • G. A. Cooper (1972). ‘Toward a Characterization of Logically Complete Switching Functions in k-valued Logic’.

    Google Scholar 

  • P. F. Curran (1973). ‘Obtaining Self-testing Logic Through the Application of Threshold Logic and an A. C. Logic Code’.

    Google Scholar 

  • Santanu Das (1974). ‘On the Design of Reliable and Fail-safe Digital Systems Using Multiple-valued Logic’ (with Henry Y. H. Chuang).

    Google Scholar 

  • Robert L. Davis (1974). ‘Uniform Shift Networks’.

    Google Scholar 

  • L. Dietmeyer (1963). ‘A Magnetic Ternary Device’ (with D. J. Anderson).

    Google Scholar 

  • J. W. Dijkstra (1968). ‘GO TO Statements Considered Harmful’.

    Google Scholar 

  • J. R. Donaldson (1973). ‘Structured Programming’.

    Google Scholar 

  • A. Druzeta (1973). ‘Multi-threshold Circuits in the Design of Multi-state Storage Elements’ (with A. S. Sedra).

    Google Scholar 

  • A. Druzeta (1974). ‘Electronic Implementation of Multi-valued Logic Networks’ (with Zvonko G. Vranesic and Kenneth C. Smith).

    Google Scholar 

  • A. Druzeta (197 +). ‘Application of Multi-threshold Elements in the Realization of Many- valued Logic Networks’ (with Zvonko G. Vranesic and Kenneth C. Smith).

    Google Scholar 

  • Edgar G. DuCasse (1973). ‘Hazard-free Realizations of Boolean Functions Using Post Functions’ (with Gemot A. Metze).

    Google Scholar 

  • Edgar G. DuCasse (1974a). ‘Application of a Multi-valued Gate to the Design of Fault- tolerant Digital Systems’ (with Stephan Y. H. Su).

    Google Scholar 

  • Edgar G. DuCasse (1975). ‘Comments on “The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement’” (with Gemot A. Metze).

    Google Scholar 

  • H. Dunderdale (1969). ‘Current-mode Circuits for Ternary-logic Realization’.

    Google Scholar 

  • H. Dunderdale (1970). ‘Current-mode Circuits for the Unary Functions of a Ternary Variable’.

    Google Scholar 

  • E. Eichelberger (1965). ‘Hazard Detection in Combinational and Sequential Circuits’.

    Google Scholar 

  • K. A. El Ayat (1971). ‘Application of Multi-valued Cyclic Codes’ (with Zvonko G. Vranesic).

    Google Scholar 

  • Engineering Research Associates (1950). High-speed Computing Devices.

    Google Scholar 

  • George Epstein (1959). ‘A General Design Theory for Digital Computers’.

    Google Scholar 

  • George Epstein (1962). ‘Single Function Shifting Counters’ (with J. S. Bailey).

    Google Scholar 

  • George Epstein (1971b). ‘Multiple-valued Logic Design and Applications in Binary Computers’ (with R. C. Braddock and Hideki Yamanaka).

    Google Scholar 

  • George Epstein (1972a). ‘Multiple-valued Signal Process with Limiting’.

    Google Scholar 

  • George Epstein (1972b). ‘Tri-stable State Circuitry for Digital Computers’ (with Hideki Yamanaka).

    Google Scholar 

  • George Epstein (1973b). ‘The Smallest Many-valued Logic for Treatment of Complemented and Uncomplemented Error Signals’ (with M. A. Breuer).

    Google Scholar 

  • George Epstein (1974). ‘The Development of Multiple-valued Logic as Related to Computer Science’ (with Gideon Frieder and David C. Rine).

    Google Scholar 

  • George Epstein (1974c). ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science’ (with Gideon Frieder and David C. Rine).

    Google Scholar 

  • George Epstein (197 +). ‘The Extension of FSR’s to FSCR’s for p ≥ 2’.

    Google Scholar 

  • George Epstein (197 +e). From Fixed to Mixed Radix.

    Google Scholar 

  • Daniel Etiemble (1974). ‘A New Concept for Ternary Logic Elements’ (with Michael Israel).

    Google Scholar 

  • D. E. Farmer (1974). ‘Design of Multi-valued Combinational Switching Circuits Using Principally Binary Components’ (with J. E. Birk).

    Google Scholar 

  • A. Fong (1973). ‘A Balanced Ternary Computer’ (with Gideon Frieder and C. Y. Chao).

    Google Scholar 

  • C. Foulk (1972). ‘Smooth Programs and Languages’ (with O. Juelich).

    Google Scholar 

  • R. V. Freĭvald (1968). ‘The Completeness to Within Coding of Systems of Functions of a k-valued Logic and the Complexity of Its Recognition’ (Russian).

    Google Scholar 

  • Gideon Frieder (1972). ‘Ternary Computers—Why and How’.

    Google Scholar 

  • Gideon Frieder (1973). ‘A Balanced Ternary Computer’ (with A. Fong and C. Y. Chao).

    Google Scholar 

  • Gideon Frieder (1974). ‘The Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and David C. Rine).

    Google Scholar 

  • Gideon Frieder (1974a). ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and David C. Rine).

    Google Scholar 

  • K. S. Fu (1969). ‘A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems’ (with William G. Wee).

    Google Scholar 

  • Y. Fujita (1971). ‘Homomorphisms of Logical Functions and Their Applications’ (with Tadahiro Kitahashi and Kokichi Tanaka).

    Google Scholar 

  • Y. Fujita (1972). ‘A Consideration of Compositions of Many-valued Logical Functions’ (with Tadahiro Kitahashi and Kokichi Tanaka).

    Google Scholar 

  • Y. Fujita (1972a). ‘An Extension of the Theorem of Isomorphism Concerning the Compositions of Many-valued Switching Functions’ (with Tadahiro Kitahashi and Kokichi Tanaka).

    Google Scholar 

  • Y. Fujita (1973). ‘Decomposition of Multi-valued Switching Functions and Its Application to Threshold Networks’ (with Hisashi Mine).

    Google Scholar 

  • T. Fukumura (1972). ‘A Problem in the Many-valued Threshold Logic and Its Solution’ (with T. Haga and K. Abe).

    Google Scholar 

  • P. Gavrilov (1966). Funkcii algebry logiki i klassy Posta (with S. V. Jablonskiĭ and Valeriĭ B. Kudrjavcev ).

    Google Scholar 

  • Magnus Giertz (1973). ‘On the Analytic Formalism of the Theory of Fuzzy Sets’ (with Richard Bellman).

    Google Scholar 

  • Donald D. Givone (1968). ‘A Minimization Technique for Multiple-valued Logic Systems’ (with Charles M. Allen).

    Google Scholar 

  • Donald D. Givone (1968a). Final Report on the Design of Multiple-valued Logic Systems (with R. W. Snelsire).

    Google Scholar 

  • Donald D. Givone (1973). ‘Applying Multiple-valued Algebra Concepts to Neural Modeling’ (with R. F. Mattrey and Charles M. Allen).

    Google Scholar 

  • J. A. Goguen (1969). ‘The Logic of Inexact Concepts’.

    Google Scholar 

  • S. W. Golomb (1967). Shift Register Sequences.

    Google Scholar 

  • D. H. Green (1973). ‘Nonlinear Ternary Feedback Shift Registers’ (with R. G. Kelsch).

    Google Scholar 

  • J. R. Grosch (1952). ‘Signed Ternary Arithmetic’.

    Google Scholar 

  • Jorge Gutierrez (1974). ‘Critical Races in Fundamental Mode Ternary Sequential Machines’ (with Claudio Moraga).

    Google Scholar 

  • Jorge Gutierrez (1974a). ‘Multi-threshold Periodic Ternary Threshold Logic’ (with Claudio Moraga).

    Google Scholar 

  • H. Haberlin (1970). ‘Arithmetische Operationen mit binar codierten Ternarzahlen’ (with H. Muller).

    Google Scholar 

  • T. Haga (1972). ‘A Problem in the Many-valued Threshold Logic and Its Solution’ (with K. Abe and T. Fukumura).

    Google Scholar 

  • R. P. Hallworth (1962). ‘Semiconductor Circuits for Ternary Logic’ (with F. G. Heath).

    Google Scholar 

  • Israel Halpern (1968). ‘Ternary Arithmetic Unit’ (with Michael Yoeli).

    Google Scholar 

  • H. C. Hamacher (1971). ‘Multi-valued versus Binaiy High Speed Multipliers’ (with Zvonko G. Vranesic).

    Google Scholar 

  • H. C. Hamacher (1972). ‘Ternary Logic in Parallel Multipliers’ (with Zvonko G. Vranesic).

    Google Scholar 

  • D. Hampel (1973). ‘Multifunction Threshold Gates’.

    Google Scholar 

  • D. Hampel (1973a). ‘Threshold Logic Multiplier’ (with L. Micheel and K. Prost).

    Google Scholar 

  • M. Hanzawa (1938). ‘The Theory of Equivalent Transformation of Simple Partial Paths in the Relay Circuit’ (with A. Nakasima).

    Google Scholar 

  • Toshiharu Hasegawa (1964). ‘Tunnel Diode Circuits for Ternaiy Logic’ (with Y. Nagaoka and Yoshikazu Tezuka and Yoshiro Kashara).

    Google Scholar 

  • Toshiharu Hasegawa (1969). ‘Construction and Analysis of a Tri-stable Circuits and Its Application to Ternary Feedback Register’ (with Hisashi Mine and Yoshiahi Koga and M. Ideda and T. Shintani).

    Google Scholar 

  • Toshiharu Hasegawa (1971). ‘Four Ternary Arithmetic Operations’ (with Hisashi Mine and Ryosaku Shimada).

    Google Scholar 

  • F. G. Heath (1962). ‘Semiconductor Circuits for Ternary Logic’ (with R. P. Hallworth).

    Google Scholar 

  • Se June Hong (1974). ‘A Practical Approach to Two-level Minimization of Multi-valued Logic’ (with Daniel L. Ostapko and Robert G. Cain).

    Google Scholar 

  • S. L. Hurst (1968). ‘An Extension of Binary Minimisation Techniques to Ternary Equations’.

    Google Scholar 

  • S. L. Hurst (1968a). ‘Semiconductor Circuits for 3-state Logic Applications’.

    Google Scholar 

  • M. Ideda (1969). ‘Construction and Analysis of a Tri-stable Circuit and Its Application to Ternary Feedback Register’ (with Hisashi Mine and Toshiharu Hasegawa and Yoshiahi Koga and T. Shintani).

    Google Scholar 

  • A. Imamiya (1973). ‘Ternary Threshold Logic Networks Realizing Three-valued Multi- threshold Functions’ (with S. Noguchi and J. Oizumi).

    Google Scholar 

  • T. A. Irving (1973). ‘An Approach to Multi-valued Sequential Logic’ (with H. T. Nagle, Jr.).

    Google Scholar 

  • Michael Israel (1974). ‘A New Concept for Ternary Logic Elements’ (with Daniel Etiemble).

    Google Scholar 

  • Y. L. Ivas’kiv (1971). Principles of Multi-valued Implementation Schemes (Russian).

    Google Scholar 

  • S. V. Jablonskiĭ (1966). Funkcii algebry logiki i klassy Posta (with G. P. Gavrilov and Valeriĭ

    Google Scholar 

  • Kudrjavcev).

    Google Scholar 

  • G. Jacopini (1966). ‘Flow Diagrams, Turing Machines and Languages With Only Two Formation Rules’ (with C. Böhm).

    Google Scholar 

  • L. Janczewski (1970). Practical Realization of Multi-valued Logic Circuits.

    Google Scholar 

  • L. Janczewski (1971). ‘Circuit Implementations of Multi-valued Logic’ (with Kenneth

    Google Scholar 

  • Smith and Zvonko G. Vranesic).

    Google Scholar 

  • L. Janczewski (1973). ‘Geometrical Approach to Multi-valued Logic Function Synthesis’.

    Google Scholar 

  • I. B. Jordan (1974). ‘Integrated Circuits for Ternary Logic’ (with H. T. Mouftah).

    Google Scholar 

  • O. Juelich (1972). ‘Smooth Programs and Languages’ (with C. Foulk).

    Google Scholar 

  • Abraham Kandel (1974). ‘Fuzzy Representation, CNF Minimization and Their Application to Fuzzy Transmission Structures’.

    Google Scholar 

  • A. Kaniel (1973). ‘Trilogic, a Three-level Logic System Provides Greater Memory Density’.

    Google Scholar 

  • Yoshiro Kasahara (1964). ‘Tunnel Diode Circuits for Ternary Logic’ (with Toshiharu Hasegawa and Y. Nagaoka and Yoshikazu Tezuka).

    Google Scholar 

  • Yoshiro Kasahara (1969). ‘The Characterizing Parameters of Ternary Logical Functions and Their Applications to Threshold Logical Functions’ (with Tadahiro Kitahashi and Hirosato Nomura and Yoshikazu Tezuka).

    Google Scholar 

  • Yoshiro Kasahara (1970). ‘Monotonicity of Ternary Logical Functions and Its Applications to the Analysis of Ternary Threshold Functions’ (Japanese) (with Tadahiro Kitahashi and Yoshikazu Tezuka and Hirosato Nomura).

    Google Scholar 

  • Y. A. Keir (1963). ‘The Functional Capability of the Saturable Hall Logic Element’.

    Google Scholar 

  • R. G. Kelsch (1973). ‘Nonlinear Ternary Feedback Registers’ (with D. H. Green).

    Google Scholar 

  • M. Kimura (1972). ‘Testing and Realization of Ternary Threshold Functions’ (with H. Mizuma).

    Google Scholar 

  • Tadahiro Kitahashi (1969). ‘The Characterizing Parameters of Ternary Logical Functions and Their Applications to Threshold Logical Functions’ (with Hirosato Nomura and Yoshikazu Tezuka and Yoshiro Kasahara).

    Google Scholar 

  • Tadahiro Kitahashi (1970). ‘Monotonicity of Ternary Logical Functions and Its Applications to the Analysis of Ternary Threshold Functions’ (Japanese) (with Yoshikazu Tezuka and Yoshiro Kasahara and Hirosato Nomura).

    Google Scholar 

  • Tadahiro Kitahashi (1971). ‘Homomorphisms of Logical Functions and Their Applications’ (with Y. Fujita and Kokichi Tanaka).

    Google Scholar 

  • Tadahiro Kitahashi (1972). ‘A Consideration on Compositions of Many-valued Logical Functions’ (with Y. Fujita and Kokichi Tanaka).

    Google Scholar 

  • Tadahiro Kitahashi (1972a). ‘An Extension of the Theorem of Isomorphism Concerning the Composition of Many-valued Switching Functions’ (with Y. Fujita and Kokichi Tanaka).

    Google Scholar 

  • Stephen Cole Kleene (1956). ‘Representation of Events in Nerve Nets and Finite Automata’.

    Google Scholar 

  • D. E. Knuth (1969). The Art of Computer Programming. Volume 2: Seminumerical Algorithms.

    Google Scholar 

  • Yoshiahi Koga (1969). ‘Construction and Analysis of a Tri-stable Circuit and Its Application to Ternary Feedback Register’ (with Hisashi Mine and Toshiharu Hasegawa and M. Ideda and T. Shintani).

    Google Scholar 

  • Teuvo Kohonen (1974). ‘On the Implementation of Logic and Tables by Linear Networks’.

    Google Scholar 

  • Ladislav Kohout (1974). ‘The Pinkava Many-valued Complete Logic Systems and Their Applications in the Design of Many-valued Switching Circuits’.

    Google Scholar 

  • C. F. Kooi (1964). ‘Nonlinear Hall-effects Ternary Logic Element’ (with J. L. Wenver).

    Google Scholar 

  • H. Koukkunen (1972). ‘Some Applications of Many-valued Threshold Logic in Digital Arithmetic’ (with L. Ojala).

    Google Scholar 

  • E. V. Krishmanurty (1964). ‘An Algebra for (m + p) Switching Circuits’.

    Google Scholar 

  • Valeriĭ B. Kudrjavcev (1966). Funkcii algebry iklassy Posta (with S. V. Jablonskiĭ and G. P. Gavrilov ).

    Google Scholar 

  • I. Lam (1974). ‘Multiple-valued Pseudorandom Number Generators’ (with Zvonko G. Vranesic).

    Google Scholar 

  • E. S. Lee (1970). ‘A Many-valued Algebra for Switching Systems’ (with Zvonko G. Vranesic and Kenneth C. Smith).

    Google Scholar 

  • Richard C. T. Lee (1971). ‘Some Properties of Fuzzy Logic’ (with Chin-liang Chang).

    Google Scholar 

  • Richard C. T. Lee (1972). ‘Fuzzy Logic and the Resolution Principle’.

    Google Scholar 

  • A. Lempicki (1974). ‘A New Look at Optical Logic’.

    Google Scholar 

  • M. Liebler (1971). ‘Multiple-real-valued Walsh Functions’ (with R. Roesser).

    Google Scholar 

  • V. D. Majstrova (1960). ‘Priménénié mnogoznačnoj logiki v teorii réléjnyh shém’ (Application of Many-valued Logics in the Study of Relay Networks).

    Google Scholar 

  • V. D. Majstrova (1961). ‘Réléjnye shémy i mnogoznačinaà loguika’ ( Relay Networks and Many-valued Logics) (with V. I. Roghinski).

    Google Scholar 

  • Peter N. Marinos (1969). ‘Fuzzy Logic and Its Application to Switching Systems’.

    Google Scholar 

  • V. V. Martyniuk (1960). ‘Issledovanie nekotorykh klassov functsij v mnogoznačnykh logikakh, II’.

    Google Scholar 

  • S. P. Maslov (1962). ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with N. P. Brusentzov and Y. A. Zhogolev and V. V. Verigin and A. M. Tishulina ).

    Google Scholar 

  • R. F. Mattrey (1973). ‘Applying Multiple-valued Algebra Concepts to Neural Modeling’ (with Donald D. Givone and Charles M. Allen).

    Google Scholar 

  • N. McCoy (1937). ‘A Representation of Generalized Boolean Rings’ (with D. Montgomery).

    Google Scholar 

  • W. S. McCulloch (1943). ‘A Logical Analysis of the Ideas Immanent in Nervous Activity’ (with W. Pitts).

    Google Scholar 

  • J. F. McDonald (1974). ‘Extensions of the Weiner-Smith Algorithm for m-ary Synchronous Sequential Circuit Design’ (with Inder Singh).

    Google Scholar 

  • Gemot A. Metze (1955). ‘An Application of Multi-valued Logic Systems to Circuits’.

    Google Scholar 

  • Gemot A. Metze (1973). ‘Hazard-free Realizations of Boolean Functions Using Post Functions’ (with Edgar G. DuCasse).

    Google Scholar 

  • Gemot A. Metze (1975). ‘Comments on “The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement’” (with Edgar G. DuCasse).

    Google Scholar 

  • L. Micheel (1973). ‘Threshold Logic Multiplier’ (with D. Hampel and K. Prost).

    Google Scholar 

  • M. Miller (1973). ‘Decompositions of Ternary Switching Functions’ (with J. C. Muzio).

    Google Scholar 

  • D. M. Miller (1974). ‘A Ternary Cellular Array’ (with J. C. Muzio).

    Google Scholar 

  • Hisashi Mine (1969). ‘Construction and Analysis of a Tri-stable Circuit and Its Application to Ternary Feedback Register’ (with Toshiharu Hasegawa and Yoshiahi Koga and M. Ideda and T. Shintani).

    Google Scholar 

  • Hisashi Mine (1970). ‘Permutations and Lattice Operations in Many-valued Logic’ (Japanese) (with Ryoskau Shimada).

    Google Scholar 

  • Hisashi Mine (1971). ‘Four Ternary Arithmetic Operations’ (with Toshiharu Hasegawa and Ryoskau Shimada).

    Google Scholar 

  • Hisashi Mine (1973). ‘Decomposition of Multi-valued Switching Functions and Its Application to Threshold Networks’ (with S. Fujita).

    Google Scholar 

  • MIT Computing Center (1971). LISP 1.5.

    Google Scholar 

  • M. Mizumoto (1972). ‘General Formulation of Formal Grammars’ (with J. Toyoda and Kikochi Tanaka).

    Google Scholar 

  • H. Mizuna (1972). ‘Testing and Realization of Ternary Threshold Functions’ (with M. Kimura).

    Google Scholar 

  • Grigor Constantin Moisil (1957). Teoria algebrica dei meccanismi automatici.

    Google Scholar 

  • Grigor Constantin Moisil (1960c). Logica matematica si teknica moderna: logicile cu mai multe valorisi circuitele cu contacte si relee ( Mathematical Logic and Modern Technology: Many-valued Logic and Relay-contact Networks).

    Google Scholar 

  • Grigor Constantin Moisil (1961a). ‘Les logiques à plusieurs valeurs et l’automatique’.

    Google Scholar 

  • Grigor Constantin Moisil (1966). Zastoswanie algebra Łukasiewicza do teorii układow przekaznikowo-stykowych. Volume 1 (Application of Łukasiewiczian Algebra to the Study of Relay-contact Networks).

    Google Scholar 

  • Grigor Constantin Moisil (1967). Zastoswanie algebra Łukasiewicza do teorii ułiadow przekaznikowo-stykowych. Volume 2 (Application of Łukasiewiczian Algebra to the Study of Relay-contact Networks).

    Google Scholar 

  • Grigor Constantin Moisil (1971). ‘Les états transitoires dans les circuits séquentiels’.

    Google Scholar 

  • Grigor Constantin Moisil (1972b). ‘Exemples de propositions à plusieurs valeurs’.

    Google Scholar 

  • D. Montgomery (1937). ‘A Representation of Generalized Boolean Rings’ (with N. McCoy).

    Google Scholar 

  • Claudio Moraga (1971). ‘A Tri-stable Circuit for Synchronized Sequential Machines’.

    Google Scholar 

  • Claudio Moraga (1972). ‘Non-linear Ternary Threshold Logic’.

    Google Scholar 

  • Claudio Moraga (1973). ‘A Ternary Positional Automatic Control System’ (with A. Bittner).

    Google Scholar 

  • Claudio Moraga (1974). ‘Minimal Realization of Ternary Threshold Functions’ (with Jorge Nazarala).

    Google Scholar 

  • Claudio Moraga (1974a). ‘Critical Races in Fundamental Mode Ternary Sequential Machines’ (with Jorge Gutierrez).

    Google Scholar 

  • Claudio Moraga (1974b). ‘Multi-threshold Periodic Ternary Threshold Logic’ (with Jorge Gutierrez).

    Google Scholar 

  • R. Mori (1972). ‘On an Extended Threshold Logic as a Unit Cell of Array Logics’.

    Google Scholar 

  • J. Morris (1960). ‘An Introduction of the Ternary Code Number System’ (with W. Alexander).

    Google Scholar 

  • John M. Motil (1974). ‘A Multiple-valued Digital ‘Saturation’ System’.

    Google Scholar 

  • H. T. Mouftah (1974). ‘Integrated Circuits for Ternary Logic’ (with I. B. Jordan).

    Google Scholar 

  • I. Muehldorf (1958). ‘Ternary Switching Algebra’.

    Google Scholar 

  • E. I. Muehldorf (1959). ‘Multi-valued Switching Algebras and Their Applications in Digital Systems’.

    Google Scholar 

  • H. Muller (1970). ‘Arithmetische Operationen mit binar codierten Ternarzahlen’ (with H. Haberlin).

    Google Scholar 

  • K. Murakami (1973). ‘Multiple-valued Variable-threshold Logic and Its Application to the Realization of the Set of Boolean Functions’ (with T. Aibara and Y. Takamutsu).

    Google Scholar 

  • K. Murakami (1974). ‘Isobaricity for a Set of Multiple-valued Logical Functions and Its Application to the Synthesis of Multi-threshold Elements’ (with Y. Takamatsu and T. Aibara).

    Google Scholar 

  • J. C. Muzio (1973b). ‘Decomposition of Ternary Switching Functions’ (with D. M. Miller).

    Google Scholar 

  • J. C. Muzio (1974). ‘A Ternary Cellular Array’ (with D. M. Miller).

    Google Scholar 

  • Y. Nagaoka (1964). ‘Tunnel Diode Circuits for Ternary Logic’ (with Toshiharu Hasegawa and Yoshikazu Tezuka and Yoshiro Kasahara).

    Google Scholar 

  • H. T. Nagle, Jr. (1973). ‘An Approach to Multi-valued Sequential Logic’ (with T. A. Irving).

    Google Scholar 

  • H. T. Nagle, Jr. (1974). ‘On Multiple-valued Memory Elements’ (with S. G. Shiva).

    Google Scholar 

  • H. Nakanishi (1972). ‘On Cyclic Multilevel Codes’ (with T. Asabe and Yoshikazu Tezuka).

    Google Scholar 

  • H. Nakanishi (1972a). ‘Spectral Density of Cyclic Multilevel Code’ (with T. Asabe and Yoshikazu Tezuka).

    Google Scholar 

  • A. Nakasima (1938). ‘The Theory of Equivalent Transformation of Simple Partial Paths in the Relay Circuit’ (with M. Hanzawa).

    Google Scholar 

  • Jorge Nazarala (1974). ‘Minimal Realization of Ternary Threshold Functions’ (with Claudio Moraga).

    Google Scholar 

  • Edmond Nicolau (1965). ‘Sinteza unei clase de automate care modelaza in logica «-valenta cu functii de timp date’.

    Google Scholar 

  • S. Noguchi (1973). ‘Ternary Threshold Logic Networks Realizing Three-valued Multi- threshold Function’ (with A. Imamiya and J. Oizumi).

    Google Scholar 

  • Nirosato Nomura (1969). ‘The Characterizing Parameters of Ternary Logical Functions and Their Applications to Threshold Logical Functions’ (with Tadahiro Kitahashi and Yoshikazu Tezuka and Yoshiro Kasahara).

    Google Scholar 

  • Nirosato Nomura (1970). ‘Monotonicity of Ternary Logical Functions and Its Applications to the Analysis of Ternary Threshold Functions’ (Japanese) (with Tadahiro Kitahashi and Yoshikazu Tezuka and Yoshiro Kasahara).

    Google Scholar 

  • Nirosato Nomura (1972). ‘Learning of the Multi-threshold Function and Its Application to the Synthesis of Logical Function’.

    Google Scholar 

  • Nirosato Nomura (1972a). ‘Some Properties of Monotonicity on Many-valued Logic and Their Applications to the Analysis of Many-valued Threshold Functions’.

    Google Scholar 

  • Nirosato Nomura (1973). ‘Characteristic Vectors of Many-valued Logical Functions and Their Applications to the Realization of Many-valued Threshold Functions’.

    Google Scholar 

  • R. S. Nutter (1971). ‘A Ternary Logic Minimization Technique’ (with Richard E. Swartwout).

    Google Scholar 

  • R. S. Nutter (1972). ‘The Algebraic Simplification of a Ternary Full Adder’.

    Google Scholar 

  • R. Ohba (1968). ‘Some Properties of Mutually Connected Threshold Elements’.

    Google Scholar 

  • J. Oizumi (1973). ‘Ternary Threshold Logic Networks Realizing Three-valued Multi- threshold Function’ (with A. Imamiya and S. Noguchi).

    Google Scholar 

  • L. Ojala (1972). ‘Some Applications of Many-valued Threshold Logic in Digital Arithmetic’ (with L. Koukkunen).

    Google Scholar 

  • L. Ojala (1972a). ‘Design of A/D Converters for Binary Coded Ternary Systems’ (with P. Yrjola).

    Google Scholar 

  • L. Ojala (1973). ‘Design of Incremental Signal Processing Devices Using Binary Coded Ternary Logic’ (with P. Yrjola).

    Google Scholar 

  • M. Orsic (1972). ‘Multiple-valued Universal Logic Modules’.

    Google Scholar 

  • M. Orsic (1973). ‘Incremental Curve Generation Using Multiple-valued Logic’.

    Google Scholar 

  • Daniel Ostapko (1974). ‘A Practical Approach to Two-level Minimization of Multi-valued Logic’ (with Robert G. Cain and Se June Hong).

    Google Scholar 

  • E. W. Page (1972). ‘Extension of the Boolean Difference Concept to Multi-valued Logic Systems’ (with N. Bell and M. G. Thomason).

    Google Scholar 

  • M. Pascual (1965). ‘A Ternary Storage Element Using a Conventional Ferrite Core’ (with J. Santos and H. Arango).

    Google Scholar 

  • M. Pascual (1970). ‘A Cyclic Algebra for the Synthesis of Ternary Digital Systems’ (with J. Santos and H. Arango and G. Roing).

    Google Scholar 

  • Y. N. Patt (1972). ‘Toward a Characterization of Logically Complete Switching Functions in k-valued Logic’ (with G. A. Cooper).

    Google Scholar 

  • A. J. Perlis (1959). ‘A Visit to Computation Centers in the Soviet Union’ (with J. W. Carr III, J. E. Robertson and N. R. Scott).

    Google Scholar 

  • Pichat (1973). ‘Minimal Representation of a Function of Several Finite Variables—Applications to Data Bank’ (with A. Cabanese).

    Google Scholar 

  • Piesch (1939). ‘Begriff der allgemeinen Schaltungstechnik’. V. Pinkava (1971). ‘Logical Models of Sexual Deviations’.

    Google Scholar 

  • W. Pitts (1943). ‘A Logical Analysis of the Ideas Immanent in Nervous Activity’ (with W. S. McCulloch).

    Google Scholar 

  • A. Pohm (1960). ‘Some Applications of Magnetic Film Parametrons as Logical Devices’ (with R. Schauer and R. Stewart and A. Reid).

    Google Scholar 

  • D. I. Porat (1969). ‘Three-valued Digital Systems’.

    Google Scholar 

  • P. Preparata (1971). ‘On a Theory of Continuously Valued Logic’ (with R. T. Yeh).

    Google Scholar 

  • Programming Research Group (1954). ‘Preliminary Report, Specifications for the IBM Mathematical FORmula TRANslating System, FORTRAN’.

    Google Scholar 

  • K. Prost (1973). ‘Threshold Logic Multiplier’ (with D. Hampel and L. Micheel).

    Google Scholar 

  • Juliusz Reichbach (1974). ‘Partitions in Decidable and Generalized Models With Many Valued Codes’.

    Google Scholar 

  • A. Reid (1960). ‘Some Applications of Magnetic Film Parametrons as Logical Devices’ (with R. Schauer and R. Stewart and A. Pohm).

    Google Scholar 

  • David C. Rine (1972). ‘A Proposed Multi-valued Extension to ALGOL 68’.

    Google Scholar 

  • David C. Rine (1972a). ‘A Proposed Multi-valued Extension to ALGOL 68’.

    Google Scholar 

  • David C. Rine (1973). ‘Basic Concepts of Multiple-discrete Valued Logic and Decision Theory’.

    Google Scholar 

  • David C. Rine (1974a). ‘The Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and Gideon Frieder).

    Google Scholar 

  • David C. Rine (1974b). ‘Multiple-valued Logic and Computer Science in the 20th Century’.

    Google Scholar 

  • David C. Rine (1974c). ‘A Summary of the Development of Multiple-valued Logic as Related to Computer Science’ (with George Epstein and Gideon Frieder).

    Google Scholar 

  • S. Rinon (1964). ‘Application of Ternary Algebra to the Study of Static Hazards’ (with Michael Yoeli).

    Google Scholar 

  • J. E. Robertson (1959). ‘A Visit to Computation Centers in the Soviet Union’ (with J. W. Carr III and A. J. Perlis and N. R. Scott).

    Google Scholar 

  • R. Roesser (1971). ‘Multiple-real-valued Walsh Functions’ (with M. Liebler).

    Google Scholar 

  • R. Roesser (1972). ‘Multivalued Logic Techniques for Optical Computers’.

    Google Scholar 

  • V. I. Roghinski (1961). ‘Reléjnye shémy i mnogoznačinaà logika’ ( Relay Networks and Many-valued Logics) (with V. D. Majstrova).

    Google Scholar 

  • G. Roing (1970). ‘A Cyclic Algebra for the Synthesis of Ternary Digital Systems’ (with J. Santos and H. Arango and M. Pascual).

    Google Scholar 

  • Alan Rose (1962g). ‘Remarque sur la machine universelle de Turing’.

    Google Scholar 

  • G. Rosenfeld (1965). ‘Logical Design of Ternary Switching Circuits’ (with Michael Yoeli).

    Google Scholar 

  • I. Rowe (1972). ‘The Generation of Gaussian-distributed Pseudorandom Noise Sequences from Multiple-valued Logic’.

    Google Scholar 

  • F. Slater (1964). ‘A Ternary-memory Element Using a Tunnel Diode’.

    Google Scholar 

  • J. Santos (1964). ‘On the Analysis and Synthesis of 3-valued Digital Systems’ (with H. Arango).

    Google Scholar 

  • J. Santos (1965). ‘A Ternary Storage Element Using a Conventional Ferrite Core’ (with H. Arango and M. Pascual).

    Google Scholar 

  • J. Santos (1970). ‘A Cyclic Algebra for the Synthesis of Ternary Digital Systems’ (with H. Arango and M. Pascual and G. Roing).

    Google Scholar 

  • Achilles A. Sarris (1972). ‘The Relationship Between Multi-valued Switching Algebra and Boolean Algebra Under Different Definitions of Complement’ (with Stephan Y. H. Su).

    Google Scholar 

  • Achilles A. Sarris (1975). ‘Authors’ Reply’ (with Stephan Y. H. Su).

    Google Scholar 

  • R. Schauer (1960). ‘Some Applications of Magnetic Film Parametrons as Logical Devices’ (with R. Stewart and A. Pohm and R. Reid).

    Google Scholar 

  • J. T. Schwarts (1972). ‘On Programming: an Interim Report on the SETL Project’.

    Google Scholar 

  • N. R. Scott (1959). ‘A Visit to Computation Centers in the Soviet Union’ (with J. W. Carr III and A. J. Perlis and J. E. Robertson).

    Google Scholar 

  • P. Sebastian (1972). ‘Ternary Logic in Arithmetic Units’ (with Zvonko G. Vranesic).

    Google Scholar 

  • A. S. Sedra (1973). ‘Multi-threshold Circuits in the Design of Multi-state Storage Elements’ (with A. Druzeta).

    Google Scholar 

  • A. S. Sedra (197 +). ‘Application to Multi-threshold Elements in the Realization of Many- valued Logic Networks’ (with A. Druzeta and Zvonko G. Vranesic).

    Google Scholar 

  • D. A. Sheppard (1973). ‘An Application of Many-valued Logic to Fault Detection’.

    Google Scholar 

  • V. I. Shestakov (1960b). ‘O dvojnoj arithmétičeskoj intérprétacii tréhznačnogo isčislénia vyskazyvanij ispol’zvemoj pri modélirovanii etogo isčislénia posrédstvom réléjno- kommutatornyh shém’ (A Dual Arithmetic Interpretation of the 3-valued Propositional Calculus Utilized in the Simulation of This Calculus by Relay-contact Networks).

    Google Scholar 

  • Ryosaku Shimada (1970). ‘Permutations and Lattice Operations in Many-valued Logic’ (Japanese) (with Hisashi Mine).

    Google Scholar 

  • Ryosaku Shimada (1971). ‘Four Ternary Arithmetic Operations’ (with Hisashi Mine and Toshiharu Hasegawa).

    Google Scholar 

  • Ieka Shinahr (1967). ‘Group Functions and Multi-valued Cellular Cascades’ (with Michael Yoeli).

    Google Scholar 

  • T. Shintani (1969). ‘Construction and Analysis of a Tri-stable Circuit and Its Application to Ternary Feedback Register’ (with Hisashi Mine and Toshiharu Hasegawa and Yoshiahi Koga and M. Ideda).

    Google Scholar 

  • S. G. Shiva (1974). ‘On Multiple-valued Memory Elements’ (with H. T. Nagle, Jr.).

    Google Scholar 

  • Inder Singh (1974). ‘Extensions of the Weiner-Smith Algorithm for m-ary Synchronous Sequential Circuit Design’ (with J. F. McDonald).

    Google Scholar 

  • Kenneth C. Smith (1970). ‘A Many-valued Algebra for Switching Systems’ (with Zvonko G. Vranesic and E. S. Lee).

    Google Scholar 

  • Kenneth C. Smith (1971). ‘Circuit Implementations of Multi-valued Logic’ (with Zvonko G. Vranesic and L. Janczewski).

    Google Scholar 

  • Kenneth C. Smith (1974). ‘Engineering Aspects of Multi-valued Logic Systems’ (with Zvonko G. Vranesic).

    Google Scholar 

  • Kenneth C. Smith (1974a). ‘Electronic Implementation of Multi-valued Logic Networks’ (with Zvonko G. Vranesic and A. Druzeta).

    Google Scholar 

  • W. Smith (1972). ‘Some Algebraic Properties and Minimization Techniques for Multivalued Lattice Logics’.

    Google Scholar 

  • R. W. Snelsire (1968). Final Report on the Design of Multiple-valued Logic Systems (with Donald D. Givone).

    Google Scholar 

  • R. Stewart (1960). ‘Some Applications of Magnetic Film Parametrons as Logical Devices’ (with R. Schauer and A. Pohm and A. Reid).

    Google Scholar 

  • Udo J. Strasilla (1974). ‘A Multiple-valued Memory System Using Capacitor Storage’.

    Google Scholar 

  • Stephan Y. H. Su (1971a). ‘Computer-oriented Algorithm for Minimizing Multi-valued Switching Functions’ (with Peter T. Cheung).

    Google Scholar 

  • Stephan Y. H. Su (1972). ‘The Relationship Between Multivalued Algebra and Boolean Algebra Under Different Definitions of Complement’ (with Achilles A. Sarris).

    Google Scholar 

  • Stephan Y. H. Su (1972a). ‘Computer Minimization of Multi-valued Switching Functions’ (with Peter T. Cheung).

    Google Scholar 

  • Stephan Y. H. Su (1974). ‘Application of a Multi-valued Gate to the Design of Fault- toierant Digital Systems’ (with Edgar G. DuCasse).

    Google Scholar 

  • Stephan Y. H. Su (1975). ‘Authors’ Reply’ (with Achilles A. Sarris).

    Google Scholar 

  • A. K. Susskind (1971). ‘Building Blocks and Synthesis Techniques for the Realization of m-ary Combinational Switching Functions’ (with C. Ying).

    Google Scholar 

  • Richard E. Swartwout (1971). ‘A Ternary Logic Minimization Technique’ (with R. S. Nutter).

    Google Scholar 

  • Richard E. Swartwout (1972). ‘The Combination of a Soft and Multi-valued Algebra’.

    Google Scholar 

  • Y. Takamatsu (1973). ‘Multipie-valued Variable Threshold Logic and Its Application to the Realization of the Set Boolean Function’ (with T. Aibara and K. Murakami).

    Google Scholar 

  • Y. Takamatsu (1974). ‘Isobaricity for a Set of Multiple-valued Logical Functions and Its Application to the Synthesis of Multithreshold Elements’ (with K. Murakami and T. Aibara).

    Google Scholar 

  • T. Takaoka (1971). ‘A Construction Method of Fail-safe Systems for Many-valued Logic’.

    Google Scholar 

  • Kokichi Tanaka (1971). ‘Homomorphisms of Logical Functions and Their Applications’ (with Y. Fujita and Tadahiro Kitahashi).

    Google Scholar 

  • Kokichi Tanaka (1972). ‘A Consideration on Compositions of Many-valued Logical Functions’ (with Y. Fujita and Tadahiro Kitahashi).

    Google Scholar 

  • Kokichi Tanaka (1972a). ‘An Extension of the Theorem of Isomorphism Concerning the Composition of Many-valued Switching Functions’ (with Y. Fujita and Tadahiro Kitahashi).

    Google Scholar 

  • Kokichi Tanaka (1972b). ‘General Formulation of Formal Grammars’ (with M. Mizumoto and J. Toyoda).

    Google Scholar 

  • Yoshikazu Tezuka (1964). ‘Tunnel Diode Circuits for Ternary Logic’ (with Toshiharu Hasegawa and Y. Nagaoka and Yoshiro Kasahara).

    Google Scholar 

  • Yoshikazu Tezuka (1969). ‘The Characterizing Parameters of Ternary Logical Functions and Their Applications to Threshold Logical Functions’ (with Tadahiro Kitahashi and Hirosato Nomura and Yoshiro Kasahara).

    Google Scholar 

  • Yoshikazu Tezuka (1970). ‘Monotonicity of Ternary Logical Functions and Its Applications to the Analysis of Ternary Threshold Functions’ (Japanese) (with Tadahiro Kitahashi and Yoshiro Kasahara and Hirosato Nomura).

    Google Scholar 

  • Yoshikazu Tezuka (1972). ‘Multilevel Balanced Code with Reduced Digits’ (with T. Asabe).

    Google Scholar 

  • Yoshikazu Tezuka (1972a). ‘On Cyclic Multilevel Codes’ (with T. Asabe and H. Nakanishi).

    Google Scholar 

  • Yoshikazu Tezuka (1972b). ‘Spectral Density of Cyclic Multilevel Code’ (with T. Asabe and H. Nakanishi).

    Google Scholar 

  • S. F. Thelliez (1966). ‘Simulateur de circuits ternaires’.

    Google Scholar 

  • S. F. Thelliez (1966a). ‘Theorie de la decomposition appliquee a la logique ternaire’.

    Google Scholar 

  • S. F. Thelliez (1971). ‘Problems Related to Ternary Sequential Switching Networks Synthesis’.

    Google Scholar 

  • S. F. Thelliez (1973). Introduction a l’etude des structures ternaires de commutation.

    Google Scholar 

  • M. G. Thomason (1972). ‘Extension of the Boolean Difference Concept to Multi-valued Logic Systems’ (with N. Bell and E. W. Page).

    Google Scholar 

  • P. S. Tien (1971). ‘The Analysis and Synthesis of Fuzzy Switching Circuits’.

    Google Scholar 

  • A. M. Tishulina (1962). ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with N. P. Brusentzov and Y. A. Zhogolev and V. V. Verigin and S. P. Maslov ).

    Google Scholar 

  • D. Tsichritzis (1973). ‘Approximate Logic’.

    Google Scholar 

  • J. Toyoda (1972). ‘General Formulation of Formal Grammars’ (with M. Mizumoto and Kikochi Tanaka).

    Google Scholar 

  • J. Turner (1966). ‘Decomposition of Group Functions With Applications to Two Rail Cascades’ (with Michael Yoeli).

    Google Scholar 

  • Atwell R. Turquette (1968). ‘Dualizable Quasi-states for m-state Automata’.

    Google Scholar 

  • V. V. Verigin (1962). ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with N. P. Brusentzov and Y. A. Zhogolev and A. M. Tishulina).

    Google Scholar 

  • Zvonko G. Vranesic (1970). ‘A Many-valued Algebra for Switching Systems’ (with E. S. Lee and Kenneth C. Smith).

    Google Scholar 

  • Zvonko G. Vranesic (1971). ‘Multivalued versus Binary High Speed Multipliers’ (with V. C. Hamacher).

    Google Scholar 

  • Zvonko G. Vranesic (1971a). ‘Application of Multi-valued Cyclic Codes’ (with K. A. El Ayat).

    Google Scholar 

  • Zvonko G. Vranesic (1971b). ‘Circuit Implementations of Multivalued Logic’ (with Kenneth C. Smith and L. Janczewski).

    Google Scholar 

  • Zvonko G. Vranesic (1972). ‘Ternary Logic in Arithmetic Units’.

    Google Scholar 

  • Zvonko G. Vranesic (1972a). ‘Ternary Logic in Parallel Multipliers’ (with V. C. Hamacher).

    Google Scholar 

  • Zvonko G. Vranesic (1974). ‘Engineering Aspects of Multi-valued Logic Systems’ (with Kenneth C. Smith).

    Google Scholar 

  • Zvonko G. Vranesic (1974a). ‘Multiple-valued Pseudorandom Number Generators’ (with C. I. Lam).

    Google Scholar 

  • Zvonko G. Vranesic (1974b). ‘Electronic Implementation of Multi-valued Logic Networks’ (with Kenneth C. Smith and A. Druzeta).

    Google Scholar 

  • Zvonko G. Vranesic (197 +). ‘Application of Multi-threshold Elements in the Realization of Many-valued Logic Networks’ (with A. Druzeta and A. S. Sedra).

    Google Scholar 

  • K. M. Waliuzzaman (1969). Multi-stage Implementation of Multi-valued Switching Functions.

    Google Scholar 

  • William G. Wee (1969). ‘A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems’ (with K. S. Fu).

    Google Scholar 

  • A. V. Wijngaarden (1960) (ed.). ‘Report on the Algorithmic Language ALGOL 68’.

    Google Scholar 

  • N. Wirth (1971). ‘The Programming Language PASCAL’.

    Google Scholar 

  • Anthony S. Wojcick (1972). ‘The Minimization of Higher-order Boolean Functions’.

    Google Scholar 

  • Anthony S. Wojcick (1973). ‘Multi-valued Asynchronous Circuits’.

    Google Scholar 

  • Anthony S. Wojcick (1974). ‘Multi-valued Asynchronous Sequential Circuits’.

    Google Scholar 

  • Hideki Yamaka (1971). ‘Multiple-valued Logic Design and Applications in Binary Computers’ (with R. C. Braddock and George Epstein).

    Google Scholar 

  • Hideki Yamaka (1972). ‘Tri-stable Circuitry for Digital Computers’ (with George Epstein).

    Google Scholar 

  • R. T. Yeh (1971). ‘On a Theory of Continuously Valued Logic’ (with F. P. Preparata).

    Google Scholar 

  • C. Ying (1971). ‘Building Blocks and Synthesis Techniques for the Realization of m-ary Combinational Switching Functions’ (with A. S. Susskind).

    Google Scholar 

  • Michael Yoeli (1964). ‘Application of Ternary Algebra to the Study of Static Hazards’ (with S. Rinon).

    Google Scholar 

  • Michael Yoeli (1965). ‘Logical Design of Ternary Switching Circuits’ (with G. Rosenfeld).

    Google Scholar 

  • Michael Yoeli (1965a). ‘Ternary Transmission Contact Network’.

    Google Scholar 

  • Michael Yoeli (1965a). ‘A Group Theoretical Approach to Two Rail Cascades’.

    Google Scholar 

  • Michael Yoeli (1966). ‘Decomposition of Group Functions with Applications to Two Rail Cascades’ (with J. Turner).

    Google Scholar 

  • Michael Yoeli (1967). ‘The Synthesis of Multi-valued Cellular Cascades’.

    Google Scholar 

  • Michael Yoeli (1967a). ‘Group Functions and Multi-valued Cellular Cascades’ (with Ieka Shinahr).

    Google Scholar 

  • Michael Yoeli (1968). ‘Ternary Cellular Cascades’.

    Google Scholar 

  • Michael Yoeli (1968a). ‘Ternary Arithmetic Unit’ (with Israel Halpern).

    Google Scholar 

  • P. Yrjola (1972). ‘Design of A/D Converters for Binary Coded Ternary Systems’ (with L. Ojala).

    Google Scholar 

  • P. Yrjola (1973). ‘Design of Incremental Signal Processing Devices Using Binary Coded Ternary Logic’ (with L. Ojala).

    Google Scholar 

  • Lofti A. Zadeh (1965). ‘Fuzzy Sets’. Lofti A. Zadeh (1966). ‘Shadows of Fuzzy Sets’ (Russian). Lofti A. Zadeh (1970). ‘Decision-making in a Fuzzy Environment’. Lofti A. Zadeh (1971). ‘Qualitative Fuzzy Semantics’. Lofti A. Zadeh (1971a). ‘Similarity Relations and Fuzzy Orderings’. E. Zavisca (1971). ‘An Approach to Multiple-valued Sequential Circuit Synthesis’ (with Charles M. Allen).

    Google Scholar 

  • E. Zavisca (1972). ‘Multiple-valued Combinational Function Synthesis Using a Single Gate Type’.

    Google Scholar 

  • Y. A. Zhogolev (1962). ‘The Order Code and Interpretive System for the Setun’ Computer’ (Russian).

    Google Scholar 

  • Y. A. Zhogolev (1962a). ‘The Setun’ Small Automatic Digital Computer’ (Russian) (with N. P. Brusentzov and V. V. Verigin and S. P. Maslov and A. M. Tishulina ).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1977 D. Reidel Publishing Company Dordrecht-Holland

About this chapter

Cite this chapter

Wolf, R.G. (1977). A Survey of Many-Valued Logic (1966–1974). In: Dunn, J.M., Epstein, G. (eds) Modern Uses of Multiple-Valued Logic. Episteme, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-1161-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-94-010-1161-7_7

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-1163-1

  • Online ISBN: 978-94-010-1161-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics