Contents
Reviews
Alan Rose. Caractérisation, au moyen de la théorie des treillis, du calcul de propositions à foncteurs variables. Applications scientifiques de la logique mathématique, Actes du 2° Colloque International de Logique Mathématique, Paris, 25-30 août 1952, Institut Henri Poincaré, Collection de logique mathématique, ser. A, no. 5, lithographed (“dactyl-spécial”). Gauthier-Villars, Paris1954, and E. Nauwelaerts, Louvain 1954, pp. 87–88.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 121
-
- Article
- Export citation
Kensuke Takeuchi. Ziyû-daisûkei no go no mondai (The word problem of free algebras). Sûgaku, vol. 8 no. 4 (1957), pp. 218–229.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 302-303
-
- Article
- Export citation
B. van Rootselaar. Intuition und Konstruktion. Studium generale, vol. 19 (1966), pp. 175–181.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 656
-
- Article
- Export citation
William W. Boone and Hartley Rogers Jr. On a problem of J. H. C. Whitehead and a problem of Alonzo Church. Mathematica Scandinavica, vol. 19 (1966), pp. 185–192.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 506-507
-
- Article
- Export citation
Robert McNaughton. Automata, formal languages, abstract switching, and computability in a Ph. D. computer science program. Communications of the ACM, vol. 11 (1968), pp. 738–740, 746.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 656
-
- Article
- Export citation
Trevor Evans. The word problem for abstract algebras. The journal of the London Mathematical Society, vol. 26 (1951), pp. 64–71. - Trevor Evans. Embeddability and the word problem. The journal of the London Mathematical Society, vol. 28 (1953), pp. 76–80.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 507
-
- Article
- Export citation
Luka Krnič. Tipy bazisov algébry logiki (Types of bases in the algebra of logic). Glasnik matematičko-fizìčki i astronomski, ser. 2 vol. 20 (1965), pp. 23–32.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 121-122
-
- Article
- Export citation
T. Traczyk. Some theorems on independence in Post algebras. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 11 (1963), pp. 3–8.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 303
-
- Article
- Export citation
Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1965, pp. 24–30.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 657
-
- Article
- Export citation
A. A. Fridman. O vzaimootnošénii méždu problémoj toždéstoa i problémoj soprážénnosti v konéínooprédélénnyh gruppah (On the relation between the word problem and the conjugacy problem in finitely defined groups). Trudy Moskovskogo Matématičéskogo Obščéstva, vol. 9 (1960), pp. 329–356.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 507-508
-
- Article
- Export citation
Eugen Mihăilescu. Forme normale in calcul propoziţiilor bivalente (Formes normales dans le calcul des propositions bivalentes). Roumanian, with Russian and French summaries. Buletin ştiinţific, Secţia de ştiinţe matematice şi fizice, vol. 8 (1956), pp. 297–327. - Eugen Mihăilescu. Recherches sur quelques systèmes du calcul des propositions. French, with Russian and English summaries. Analele Universitáţii C. I. Parkon (Bucharest), Seria Acta logica, vol. 1 (1958), pp. 173–185.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 122
-
- Article
- Export citation
T. Traczyk. An equational definition of a class of Post algebras. Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 12 (1964), pp. 147–149.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 303
-
- Article
- Export citation
Manuel Blum. A Machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 657-658
-
- Article
- Export citation
Seppo Ilkka. A new arithmetization for finitely many-valued propositional calculi. Societas Scientiarum Fennica, Commentationes physico-mathematicae, vol. 32 no. 8, Helsinki1966, 13 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 304
-
- Article
- Export citation
Yasuyuki Imai and Kiyoshi Iséki. On axiom systems of propositional calculi. I. Proceedings of the Japan Academy, vol. 41 (1965), pp. 436–439. - Yoshinari Arai. On axiom systems of propositional calculi. II.Proceedings of the Japan Academy, vol. 41 (1965), pp. 440–442. - Yoshinari Arai. On axiom systems of propositional calculi. III.Proceedings of the Japan Academy, vol. 41 (1965), pp. 570–574. - Kiyoshi Iséki. On axiom systems ofpropositional calculi. IV.Proceedings of the Japan Academy, vol. 41 (1965), pp. 575–577. - Kiyoshi Iséki and Shôtarô Tanaka. On axiom systems of propositional calculi. V.Proceedings of the Japan Academy, vol. 41 (1965), pp. 661–662. - Shôtarô Tanaka. On axiom systems ofpropositional calculi. VI.Proceedings of the Japan Academy, vol. 41 (1965), pp. 663–666. - Yoshinari Arai and Kiyoshi Iséki. On axiom systems of propositional calculi. VII.Proceedings of the Japan Academy, vol. 41 (1965), pp. 667–669. - Shôtarô Tanaka. On axiom systems of propositional calculi. VIII.Proceedings of the Japan Academy, vol. 41 (1965), pp. 795–797. - Shôtarô Tanaka. On axiom systems of propositional calculi. IX.Proceedings of the Japan Academy, vol. 41 (1965), pp. 798–800. - Kiyoshi Iséki and Shôtarô Tanaka. On axiom systems of propositional calculi. X.Proceedings of the Japan Academy, vol. 41 (1965), pp. 801–802. - Kashiko Tanaka. On axiom systems of propositional calculi. XI.Proceedings of the Japan Academy, vol. 41 (1965), pp. 898–900. - Yoshinari Arai. On axiom systems of propositional calculi. XII.Proceedings of the Japan Academy, vol. 41 (1965), pp. 901–903. - Shôtarô Tanaka. On axiom systems of propositional calculi. XIII.Proceedings of the Japan Academy, vol. 41 (1965), pp. 904–907.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 122-124
-
- Article
- Export citation
Michael O. Rabin and Hao Wang. Words in the history of a Turing machine with a fixed input. Journal of the Association for Computing Machinery, vol. 10 (1963), pp. 526–527.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 508
-
- Article
- Export citation
Angelo Margaris. A problem of Rosser and Turquette. The journal of symbolic logic, vol. 23 no. 3 (for 1958, pub. 1959), pp. 271–279.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 304-305
-
- Article
- Export citation
Philip K. Hooper. Monogenic Post normal systems of arbitrary degree. Journal of the Association for Computing Machinery, vol. 13 (1966), pp. 359–363.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 508-509
-
- Article
- Export citation
R. H. Thomason and H. Leblanc. All or none: a novel choice of primitives for elementary logic. The journal of symbolic logic, vol. 32 (1967), pp. 345–351.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 124-125
-
- Article
- Export citation
Sheila Greibach. A new normal-form theorem for context-free phrase structure grammars. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 42–52.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 658
-
- Article
- Export citation