2 results
B. Courcelle. Equational theories and equivalences of programs. Mathematical logic in computer science, edited by B. Dömölki and T. Gergely, Colloquia mathematica Societatis János Bolyai, no. 26, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1981, pp. 289–302. - J. W. de Barker and J. I. Zucker. Derivatives of programs. Mathematical logic in computer science, edited by B. Dömölki and T. Gergely, Colloquia mathematica Societatis János Bolyai, no. 26, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1981, pp. 321–343. - E. Engeler. An algorithmic model of strict finitism. Mathematical logic in computer science, edited by B. Dömölki and T. Gergely, Colloquia mathematica Societatis János Bolyai, no. 26, János Bolyai Mathematical Society, Budapest, and North-Holland Publishing Company, Amsterdam, Oxford, and New York, 1981, pp. 345–357.
-
- Journal:
- The Journal of Symbolic Logic / Volume 49 / Issue 3 / September 1984
- Published online by Cambridge University Press:
- 12 March 2014, pp. 990-991
- Print publication:
- September 1984
-
- Article
- Export citation
A. Bertoni. Mathematical methods of the theory of stochastic automata. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 9–22. - R. V. Freivald. Functions computable in the limit by probabilistic machines. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 77–87. - B. Goetze and R. Klette. Some properties of limit recursive functions. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 88–90. - Ole-Johan Dahl. An approach to correctness proofs of semicoroutines. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 157–174. - G. Wechsung. The axiomatization problem of a theory of linear languages. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 298–302. - L. Banachowski. Modular approach to the logical theory of programs. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 327–332. - Pierangelo Miglioli. Mathematical foundations of motivation languages and synthesis maps. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, edited by A. Blikle, Lecture notes in computer science, vol. 28, Springer-Verlag, Berlin, Heidelberg, and New York, 1975, pp. 388–408. - H. Rasiowa. ω+-valued algorithmic logic as a tool to investigate procedures. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974, pp. 423–450. - Andrzej Salwicki. Procedures, formal computations and models. Mathematical foundations of computer science, 3rd symposium at Jadwisin near Warsaw, June 17–22, 1974 pp. 464–484.
-
- Journal:
- The Journal of Symbolic Logic / Volume 42 / Issue 3 / September 1977
- Published online by Cambridge University Press:
- 12 March 2014, pp. 422-423
- Print publication:
- September 1977
-
- Article
- Export citation