A class of recursively enumerable sets (Q1101444)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A class of recursively enumerable sets |
scientific article; zbMATH DE number 4047702
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A class of recursively enumerable sets |
scientific article; zbMATH DE number 4047702 |
Statements
A class of recursively enumerable sets (English)
0 references
1987
0 references
A coinfinite r.e. set is called special if any permutation of its complement which is extendible to a recursive permutation of the natural numbers fixes all but finitely many numbers. By a priority argument, it is shown that every simple set contains a special subset. Lattice- theoretic properties in \({\mathcal E}\) * of special sets are also given.
0 references
coinfinite r.e. set
0 references
recursive permutation
0 references
simple set
0 references
special sets
0 references
