@incollection{AST_1976__38-39__45_0, author = {Engeler, Erwin}, title = {Lover bounds by {Galois} theory}, booktitle = {Journ\'ees algorithmiques}, author = {Collectif}, series = {Ast\'erisque}, publisher = {Soci\'et\'e math\'ematique de France}, number = {38-39}, year = {1976}, zbl = {0355.02027}, mrnumber = {449010}, language = {en}, url = {http://www.numdam.org/item/AST_1976__38-39__45_0/} }
TY - CHAP AU - Engeler, Erwin TI - Lover bounds by Galois theory BT - Journées algorithmiques AU - Collectif T3 - Astérisque PY - 1976 DA - 1976/// IS - 38-39 PB - Société mathématique de France UR - http://www.numdam.org/item/AST_1976__38-39__45_0/ UR - https://zbmath.org/?q=an%3A0355.02027 UR - https://www.ams.org/mathscinet-getitem?mr=449010 LA - en ID - AST_1976__38-39__45_0 ER -
Engeler, Erwin. Lover bounds by Galois theory, in Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 45-52. http://www.numdam.org/item/AST_1976__38-39__45_0/
[1] On the Solvability of Algorithmic Problems, in : H.E Rose and J.C. Shepherdson (eds) Logic Colloquium 73, North-Holland Publ. Co, 1975, pp. 231-251. | MR | Zbl
:[2] Structural Relations between Programs and Problems, to appear as invited talk in : (ed.) Proceedings of the 5th Intern. Congress of Logic, Methodology and Philosophy of Science. Preprint : Report N°15 of the Institut für Informatik, E.T.H., Oct. 1975. | Zbl
: