Abstract
Algebras of operations defined on recursively enumerable sets of different kinds are considered. Every such algebra is specified by a list of operations involved and a list of basic elements. An element of an algebra is said to be representable in this algebra if it can be obtained from given basic elements by operations of the algebra. Two kinds of recursively enumerable sets are considered: recursively enumerable sets in the usual sense and fuzzy recursively enumerable sets. On binary, i.e., two-dimensional recursively enumerable sets of these kinds, algebras of operations are introduced. An algebra θ is constructed in which all binary recursively enumerable sets are representable. A subalgebra θ0 of θ is constructed in which all binary recursively enumerable sets are representable if and only if they are described by formulas of Presburger’s arithmetic system. An algebra Ω is constructed in which all binary recursively enumerable fuzzy sets are representable. A subalgebra Ω0 of the algebra Ω is constructed such that fuzzy recursively enumerable sets representable in Ω0 can be treated as fuzzy counterparts of sets representable by formulas of Presburger’s system. Bibliography: 16 titles.
Similar content being viewed by others
REFERENCES
D. Hilbert and P. Bernays, Grundlagen der Mathematik, Band I, Springer-Verlag, Berlin (1934).
S. C. Kleene, Introduction to Metamathematics, Amsterdam-Groningen (1952).
B. A. Kushner, Lectures on Constructive Mathematical Analysis [in Russian], Moscow (1973).
A. I. Mal’cev, Algorithms and Recursive Functions [in Russian], 2nd ed., Moscow (1986).
S. N. Manukian, “On enumerable predicates and sequentional calculuses of fuzzy logic,” in: 9th All-Union Conference on Mathematical Logic, Abstracts of Reports, Leningrad (1988), p. 5.
S. N. Manukian, “On the representation of fuzzy recursively enumerable sets,” in: 11th Interrepublican Conference on Mathematical Logic, Abstracts of Reports, Kazan (1992), p. 94.
S. N. Manukian, “On the structure of recursively enumerable fuzzy sets,” Math. Probl. Computer Sci., 17, 86–91 (1997).
S. N. Manukian, “On some properties of recursively enumerable fuzzy sets,” in: Proceedings of the Conference “Computer Science and Information Technologies,” CSIT-99, Yerevan, Armenia (1999), pp. 5–6.
S. N. Manukian, “Algorithmic operators on recursively enumerable fuzzy sets,” in: Proceedings of the Conference “Computer Science and Information Technologies,” CSIT-01, Yerevan, Armenia (2001), pp. 125–126.
S. N. Manukian, “On binary recursively enumerable fuzzy sets,” in: International Conference “21st Days of Weak Arithmetics,” Abstracts, St. Petersburg (2002), pp. 13–15.
M. Presburger, “Uber die Vollstaendigkeit eines gewissen System der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt,” in: Sprawozdanie z I Kongresu Matematikow Krajow Slowianskich (Comptes rendu du I congres des matematiciens des pays slaves), Warszawa (1930), pp. 92–101.
E. Specker, “Nicht konstruktiv beweisbare Satze der Analysis,” sJ. Symb. Logic, 14, 115–158 (1949).
N. A. Shanin, “Constructive real numbers and constructive functional spaces,” Tr. Steklov Mat. Inst., 67, 15–294 (1962).
G. S. Tseytin, “A method for exposing the theory of algorithms and enumerable sets,” Tr. Steklov Mat. Inst., 72, 69–98 (1964).
L. Zadeh, “Fuzzy sets,” Inform. Control, 8, 338–353 (1965).
I. D. Zaslavsky, “On the constructive truth of inferences and some uncommon systems of constructive logic,” Matem. Vopr. Kibern. Vychisl. Tekhn., 8, 99–153 (1975).
Author information
Authors and Affiliations
Additional information
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 304, 2003, pp. 75–98.
Rights and permissions
About this article
Cite this article
Manukian, S.N. Algebras of Recursively Enumerable Sets and Their Applications to Fuzzy Logic. J Math Sci 130, 4598–4606 (2005). https://doi.org/10.1007/s10958-005-0354-1
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10958-005-0354-1