On algorithmic solvability of the A-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate S-functions

Autor:	M. A. Podkolzina, V. A. Buevich
Rok vydání:	2012
Předmět:	Algebra Applied Mathematics Completeness (order theory) Discrete Mathematics and Combinatorics Mathematics
Zdroj:	Discrete Mathematics and Applications. 22
ISSN:	1569-3929 0924-9265
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::38fb0cc2474eaec1b4b20b73951ffe6b https://doi.org/10.1515/dma-2012-038 Zobrazit plný text záznamu