Closed classes in the functional system of polynomials with real coefficients

N. Ph. Alexiadis

Čebyševskij sbornik, Tome 24 (2023) no. 1, pp. 5-14.

Résumé

A functional system is a set of functions endowed with a set of operations on these functions. The operations allow one to obtain new functions from the existing ones. Functional systems are mathematical models of real and abstract control systems and thus are one of the main objects of discrete mathematics and mathematical cybernetic. The problems in the area of functional systems are extensive. One of the main problems is deciding completeness; this problem consists in the description of all subsets of functions that are complete, i.e. generate the whole set. In our paper we consider the functional system of polynomials with real coefficients endowed with the superposition operation for this system we study the problem of closed classes (structure, basis, number of finite and infinite closed classes). Importance of the problem of closed classes is ensured by the fact that completeness problem can frequently be solved with the help of (maximal) closed classes. The main results concerning the functional system of polynomials with real coefficients presented in our paper are the following: all finite closed classes are described explicitly; the number of finite closed classes, infinite closed classes and all closed classes is found; the problem of bases of closed classes is studied, namely, it is established that there exist closed classes with a finite basis, there exist closed classes with an infinite basis, and there exist closed classes without a basis; explicit examples of the corresponding closed classes are given; the number of closed classes with a finite basis, the number of closed classes with an infinite basis and the number of closed classes without a basis are established.

Détail

Keywords: functional system, completeness problem, complete system, closed class, basis, polynomial, polynomial function.

Bibliographie

[1] Aleksiadis N. Ph., “On closed classes in a functional system of polynomials with real coefficients”, Proc. XXI Int. Conf. “Algebra, number theory and discrete geometry: modern problems, applications and problems of history”, 2022, 142–145

[2] Aleksiadis N. Ph., “Algorithmic unsolvability of the completeness problem for polynomials with integer coefficients”, Vestnik MPEI, 2015, no. 3, 110–117

[3] Aleksiadis N. Ph., “On the functional system of polynomials with rational coefficients”, Intelligent systems. Theory and applications, 23:4 (2019), 93–114 | MR

[4] Aleksiadis N. Ph., “Rational A-functions with rational coefficients”, Chebyshevskii sbornik, 23:4 (2022), 11–19 | DOI | MR | Zbl

[5] Babin D. N., “On the completeness problem for automata”, Proc. Intelligent systems. Theory and Applications, 23:4 (2020), 82–83

[6] Gavrilov G. P., “On functional completeness in countable logic”, Problems of cybernetics, 15, 1965, 5–64

[7] Kudryavtsev V. B., “On the powers of sets of discrete sets of some functional systems related to automata”, Problems of cybernetics, 13 (1965), 45–74

[8] Kudryavtsev V. B., Functional systems, Publishing House of Mekh-mat. fac. MSU, M., 1982, 157 pp.

[9] Maltsev A. I., Selected works, v. II, Publishing House “Nauka”, M., 1976, 388 pp. | MR

[10] Salomaa A., Some completeness criteria for sets of functions over a finite domain. II, Annales Universitatis Turkuensis, Series AI, No 63, Turun Yliopisto, Turku, 1963, 19 pp. | MR

[11] Chasavskikh A. A., “The problem of completeness in classes of linear automata”, Intelligent systems. Theory and Applications, 22:2 (2018), 151–154

[12] Yablonsky S., Introduction to discrete mathematics, Science, M., 1986, 384 pp. | MR

[13] Yablonsky S. V., “On functional completeness in three-digit calculus”, DAN USSR, 95:6 (1954), 1153–1156

[14] Yablonsky S. V., “Functional constructions in $k$-valued logic”, Proceedings of the Steklov Institute of Mathematics, 51 (1958), 5–142 | Zbl

[15] Post E., Two-valued iterative sistems of mathematical logik, Prinston, 1941 | MR

[16] Rosenberg Y., “Uber die functionale Vollständigkeit in den mehrwertigen Logiken”, Praha, Rozpravi Ceskoslovenska Acodemie Ved., 80:4 (1970), 393

[17] Slupecki J., “Kriterium pelnosci wielowar — tosciowych systemow logiki zdan”, Comptes Rendus des Seances de la Societe des Sciences et des Lettres de Varsivie. Cl. III, 32 (1939), 102–128