Contents
Reviews
Masao Ohnishi and Kazuo Matsumoto. Gentzen method in modal calculi. Osaka mathematical journal, vol. 9 no. 2 (1957), pp. 113–130. See Correction, Masao Ohnishi and Kazuo Matsumoto. Gentzen method in modal calculi. Osaka mathematical journal, vol. 10 (1958), p. 147.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 466-467
-
- Article
- Export citation
Front matter
JSL volume 40 issue 2 Cover and Front matter
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. f1-f2
-
- Article
-
- You have access
- Export citation
Reviews
Patrick C. Fischer, Albert R. Meyer, and Arnold L. Rosenberg. Time-restricted sequence generation. Journal of computer and system sciences, vol. 4 (1970), pp. 50–73.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 616-617
-
- Article
- Export citation
Shen Lin and Tibor Rado. Computer studies of Turing machine problems. Journal of the Association for Computing Machinery, vol. 12 (1965), pp. 196–212. - Allen H. Brady. The conjectured highest scoring machines for Rado's Σ(k) for the value k = 4. IEEE transactions on electronic computers, vol. EC-15 (1966), pp. 802–803. - Milton W. Green. A lower bound on Rado's sigma function for binary Turing machines. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11-13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York 1964, pp. 91–94.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 617
-
- Article
- Export citation
Masao Ohnishi and Kazuo Matsumoto. Gentzen method in modal calculi, II. Osaka mathematical journal, vol. 11 no. 1 (1959), pp. 115–120.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 467-468
-
- Article
- Export citation
Back matter
JSL volume 40 issue 2 Cover and Back matter
-
- Published online by Cambridge University Press:
- 12 March 2014, p. b1
-
- Article
-
- You have access
- Export citation
Reviews
Kazuo Matsumoto. Decision procedure for modal sentential calculus S3. Osaka mathematical journal, vol. 12 no. 1 (1960), pp. 167–175.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 468
-
- Article
- Export citation
Richard M. Karp. Reducibility among combinatorial problems. Complexity of computer computations, Proceedings of a Symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New York, edited by Raymond E. Miller and James W. Thatcher, Plenum Press, New York and London 1972, pp. 85–103.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 618-619
-
- Article
- Export citation
Masao Ohnishi. Gentzen decision procedures for Lewis's systems S2 and S3. Osaka mathematical journal, vol. 13 (1961), pp. 125–137.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 468-469
-
- Article
- Export citation
Ann Yasuhara. Recursive function theory and logic. Academic Press, New York and London 1971, xv + 338 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 619-620
-
- Article
- Export citation
Masao Ohnishi. Von Wright-Anderson's decision procedures for Lewis's systems S2 and S3. Osaka mathematical journal, vol. 13 (1961), pp. 139–142.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 469
-
- Article
- Export citation
Rózsa Péter. Über die Verallgemeinerung der Theorie der rekursiven Funktionen für abstrakte Mengen geeigneter Struktur ah Definitionsbereiche. Acta mathematica Academiae Scientiarum Hungaricae, vol. 12 (1961), pp. 271–314, and vol. 13 (1962), pp. 1-24.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 620-621
-
- Article
- Export citation
E. William ChapinJr., Gentzen-like systems for partial propositional calculi. Notre Dame journal of formal logic, vol. 12 (1971), pp. 75–80, and pp. 179–182.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 469
-
- Article
- Export citation
Frieder Schwenkel. Rekursive Wortfunktionen über unendlichen Alphabeten. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 133–147.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 621-622
-
- Article
- Export citation
A. S. Kuzičév. Diagrammy Vénna. Istoriá i priménéniá. (Venn diagrams. History and applications.) Izdatél'stvo “Nauka,” Moscow1968, 252 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 469-470
-
- Article
- Export citation
Rósza Péter. Zum Beitrag von F. Schwenkel “Rekursive Wortfunktionen uber unendlichen Alphabeten.” Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 377–378. - F. Schwenkel. Entgegnung. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 (1965), pp. 379–380.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 622
-
- Article
- Export citation
Michael O. Rabin. Weakly definable relations and special automata. Mathematical logic and foundations of set theory, Proceedings of an international colloquium held under the auspices of the Israel Academy of Sciences and Humanities, Jerusalem, 11-14 November 1968, edited by Yehoshua Bar-Hillel, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam and London 1970, pp. 1–23.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 622-623
-
- Article
- Export citation
N. G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Koninklyke Nederlandse Akademie van Wetenschappen, Proceedings, ser. A vol. 75 (1972), pp. 381–392; also Indagationes mathematicae, vol. 34 (1972), pp. 381–392.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 470
-
- Article
- Export citation
E. K. Blum. Towards a theory of semantics and compilers for programming languages. Journal of computer and system sciences, vol. 3 (1969), pp. 248–275.
-
- Published online by Cambridge University Press:
- 12 March 2014, pp. 470-471
-
- Article
- Export citation
Michael O. Rabin. Automata on infinite objects and Church's problem. Conference Board of the Mathematical Sciences, Regional conference series in mathematics, no. 13. American Mathematical Society, Providence 1972, 22 pp.
-
- Published online by Cambridge University Press:
- 12 March 2014, p. 623
-
- Article
- Export citation