This article is cited in 1 scientific paper (total in 1 paper)
On complexity of solving systems of functional equations in countable-valued logic
S. S. Marchenkov
Moscow State University, 1 Leninskie gory, 119991 Moscow, Russia
We propose a procedure to construct all solutions of an arbitrary system of functional equations in countable-valued logic. Based on this procedure, the solutions of systems of equations in the class $\Sigma_2$ of Kleene–Mostovsky arithmetical hierarchy which include only the ternary discriminator $p$ are determined. We prove that for given systems of equations the components of solutions may be arbitrary functions of the class $\Sigma^1_1$ of Kleene analytical hierarchy. Bibliogr. 10.
system of functional equations, function of countable-valued logic.
PDF file (288 kB)
S. S. Marchenkov, “On complexity of solving systems of functional equations in countable-valued logic”, Diskretn. Anal. Issled. Oper., 22:2 (2015), 49–62
Citation in format AMSBIB
\paper On complexity of solving systems of functional equations in countable-valued logic
\jour Diskretn. Anal. Issled. Oper.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
S. S. Marchenkov, “On alphabetic coding for superwords”, Problems Inform. Transmission, 55:3 (2019), 275–282
|Number of views:|