Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Aho,A.,Hopcroft,J.,Ullman,J., The design and analysis of computer algorithms, Addision-Wesley, 1974
2. Banachowski, L., An axioms approach to the theory of data structures, Bull.Acad.Pol.Sci.Ser.Math.Astr.Phys. 23(1975),315–323
3. Dańko,W., A criterion of undecidability of algorithmic theories, Proc.MFCS 80 Rydzyna in Lecture Notes on Comp.Sci.Springer, 1980
4. Engeler, E., Algorithmic properties of structures, Math.Systems Theory 1 (1967), 183–195
5. Engeler,E., On the solvability of algorithmic problems, in H.E.Rose and J.C.Shepherdson eds. Logic Colloquium 73 North-Holland, 1975, 231–251
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On algorithmic logic with partial operations;Logics of Programs and Their Applications;1983
2. Algorithmic theories of data structures;Automata, Languages and Programming;1982