By consideration of the problematic of the universal algebra as some questions which are connected with some collection of functions (signiches functions), which are defined on some set (the basic set of algebra) take place the natural interest too some functions which can be defined in this set by the help, in some sense, from the signiches functions. The only restriction by this is the natural for the universal algebra (which study the algebras to the nearest by isomorphism) is the requirement for this functions to be permutable with the automorphisms of starting algebra. The functions which are defined on the algebra with the help of some logical language (the language of the first order logic, or the language of the logics with the infinite formulas, or the language of the second order logic and so other) are such. In the work is considered the questions which are connected with the functions and elements which are defined on the countable algebras of finite signatures in the language of the second order logic. It is known the Marek-theorem: by the preposition of set-theoretical axsiom of constructivity the theory of countable universal algebras of finite signatures in the language of second order logic are categorical. From this theorem it is proved that the functions on the basic set of this algebras which commutes with automorphisms of this algebra can be defined on this algebra in some natural extension of the second order logic language. As some corollary of this we given some description of endomorphisms (automorphisms) of countable universal algebras of finite signatures which commutes with oll automorphisms of this algebras. Another corollary given some description of elements from Galya-closuring of subalgebras of countable universal algebras of finite signatures.

1. Pinus A.G. Conditional terms and its contributions to algebra and computation theory. Uspechi math. nauk, 2001, V.56, №4, P.35-72.

2. Pinus A.G. Rational equivalence of algebras, its «clons» generalizations and «clons» categoricity. Sibirian math. Journal, 2013, V.54, № 3, P.673-688.

3. Pinus A.G. Definable functions of universal algebras and definable equivalence of algebras. Algebra and Logic, 2014, V.53, №1.

4. Baldwin J. Definable second-order quantifiers. Model-Theoretic Logics. New York-Berlin-Heidelberg-Tokio : Springer-Verlag, 1985. P. 445-478.

5. Pinus A.G. On classical Galua-closure on the universal algebras. Izvestia vuzov. Mathematica, 2014, P.47-72.

6. Pinus A.G. Point-termal complete clons of functions and the lattice of lattices of all sublattices of algebras with fixed basic set. Izvestia IrGU, ser. «Mathematica», 2012, V.5, №3, P.93-103.

7. Scott D. Logic with denumerable long formulas and finite strings of quantifiers. Theory of Models. Amsterdam : North Holland P. Comp., 1965. P. 329-341.

8. Marek W. Sur la constance d'une hypothese de Fraisse sur definesability dans un language du second order. C. R. Acad. Sci. Paris. Ser. A-B. 1973. Vol. 276. P. 1147-1150, 1169-1172.