References
G. E. Tseitlin, "Functional completeness criteria in Dijkstra algebra," Kibernetika i Sistemnyi Analiz, No. 5, 28-40 (1995).
S. V. Yablonskii, G. P. Gavrilov, and V. B. Kudryavtsev, Boolean Functions and Post Classes [in Russian], Nauka, Moscow (1966).
V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, Algebras, Languages, and Programming [in Russian], 3rd edn., Naukova Dumka, Kiev (1989).
Yu. V, Golunkov, Completeness Problems in Functional Systems of Program Type [in Russian], Doctoral Dissertation, Kazan' (1989).
D. B. Bui and V. N. Red'ko, "Primitive program algebras of computable functions," Kibernetika, No. 3, 68-74 (1987).
V. D. Solov'ev, Functional Systems of Recursive Functions and Predicates with Strong Closure Software Tools [in Russian], Doctoral Dissertation, Moscow (1996).
G. E. Tseitlin, "On infinitely generated subalgebras of the modified Post algebra," Kibernetika, No. 2, 43-56 (1971).
Additional information
The research has been supported by the Renaissance International Foundation under grant SPU 041 074 of the Program for Support of Education in Exact Sciences.
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 27–45, January–February, 1997.
Rights and permissions
About this article
Cite this article
Tseitlin, G.E. Constructing the lattice of subalgebras of the dijkstra algebra. Cybern Syst Anal 33, 21–34 (1997). https://doi.org/10.1007/BF02665937
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02665937