Premium
On a Class of Recursively Enumerable Sets
Author(s) -
Didehvar Farzad
Publication year - 1999
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19990450405
Subject(s) - recursively enumerable language , mathematics , closure (psychology) , recursively enumerable set , class (philosophy) , maximal set , relation (database) , natural number , discrete mathematics , combinatorics , set (abstract data type) , computer science , artificial intelligence , data mining , programming language , economics , market economy
We define a class of so‐called ∑( n )‐sets as a natural closure of recursively enumerable sets W n under the relation “∈” and study its properties.