Preview
Unable to display preview. Download preview PDF.
References
Abramson, F., "Interpolation theorems for program schemata", Information & Control, 36, February 1978.
Brown, Gries, and Szymanski, "Program schemes with pushdown stores", SIAM on Computing, 1, 242–268, 1972.
Constable, R.C. and Gries, D., "On classes of program schemata", SIAM. J. On Computing, 1, 66–118, 1972.
Engeler, E., "Algorithmic properties of structures", Math. Systems Theory, 1, 183–195, 1967.
Engeler, E., "Algorithmic logic" in Foundations of Computer Science, ed. J.W. de Bakker, Mathematical Centre Trace, 63, 57–85, Amsterdam 1975.
Engeler, E., "Generalized Galois Theory and its application to complexity", Theoretical Computer Science, 13, 271–293, March 1981.
Friedman, H., "Algorithmic procedures, generalized Turing algorithms and elementary recursion theory" in Logic Colloquium '69 edited by R.O. Gaudy & C.M.E. Yates, 361–389, North-Holland, Amsterdam, 1971.
Garland and Luckham, "Program schemes, recursion schemes, and formal languages", J. of Comp. & System Sciences, 7, 1973.
Hawrusik, F., Ph.D. Thesis, Dept. of Computer Science, Rutgers University, 1983.
Hawrusik, F., Venkataraman, K.N., and Yasuhara, A., "Classes of functions for computing on binary trees", STOC 1981.
Kfoury, A.J., "Translatability of schemas over restricted interpretations", J. of Comp. & System Sciences, 8, 387–408, June 1974.
Kfoury, A.J., "Definability by programs in first-order structures", to appear in Theoretical Computer Science, January 1983.
Kfoury, A.J., R.N. Moll and M.A. Arbib, A Programming Approach to Computability, Springer-Verlag, 1982.
Luckham, D., Park, D.M.R., and Paterson, M.S., "On formalized computer programs", J. of Comp. & System Sciences, 4, 220–249, 1970.
Lynch, N.A., "Straight-line program length as a parameter for complexity analysis", J. of Comp. & System Sciences, 21, 251–280, December 1980.
Lynch, N.A. and Blum, E.K., "A difference in expressive power between flow-charts and recursion schemes", Mathematical System Theory, 12 205–211, 1979.
Lynch, N.A. and Blum, E.K., "Relative complexity of operations on numeric and bit-string algebras", Mathematical Systems Theory, 13, 187–207, 1980.
Lynch, N.A. and Blum, E.K., "Relative complexity of algebras", Mathematical Systems Theory, 14, 193–214, 1981.
Paterson, M. and Hewitt, C., "Comparative schematology", MIT AI Lab. Memo No. 201., November 1970.
Pippenger, N., "Pebbling", in Proc. of Fifth IBM Symposium on Math. Foundations of Comp. Size, IBM Japan, May 1980.
Shepherdson, J.C., "Computation over abstract structures: serial and parallel procedures and Friedman's effective definitional schemes" in Logic Colloqium '73 ed. by J.C. Shepherdson and J. Rose, 445–513, North-Holland, Amsterdam, 1975.
Urzyczyn, P., "The unwind property in certain algebras", Information & Control, 50, 91–109, 1981.
Venkataraman, K.N., "Decidability of the purely existential fragment of the theory of term algebras", CTA-TR-4, Dept. of Computer Science, Rutgers University, Oct. 1981.
Winkler, P., "Classification of algebraic structures by work space", to appear in Algebra Universialis, 1982.
Yasuhara, A., "Computability on term algebras: Part I," DCS-TR-79, Dept. of Computer Science, Rutgers University, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kfoury, A.J., Urzyczyn, P. (1984). Necessary and sufficient conditions for the universality of programming formalisms. In: Clarke, E., Kozen, D. (eds) Logics of Programs. Logic of Programs 1983. Lecture Notes in Computer Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12896-4_368
Download citation
DOI: https://doi.org/10.1007/3-540-12896-4_368
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12896-0
Online ISBN: 978-3-540-38775-6
eBook Packages: Springer Book Archive