Maximal set (computability theory): Difference between revisions

Revision as of 05:42, 19 August 2007

Revision as of 05:52, 19 August 2007

Line 2:

{{context}}

A '''maximal set''' is a coinfinite [[recursive]]ly enumerable (r.e.) subset ''A'' of the natural numbers such that for every further r.e. subset ''B'' of the natural numbers, either ''B'' is cofinite or ''B'' is a finite variant of ''A'' or ''B'' is not a superset of ''A''. This gives an easy definition within the lattic of the r.e. sets. Maximal sets have many interesting properties: they are simple, hypersimple, hyperhypersimple and r-maximal; the latter property says that every recursive set ''R'' contains either only finitely many elements of the complement of ''A'' or almost all elements of the complement of ''A''. There are r-maximal sets whichthat are not maximal; some of them do even not have maximal supersets. Myhill (1956) asked whether maximal sets exists and Frieberg (1958) constrcuted one. Soare (1974) showed that the maximal sets form an orbit with respect to automorphism of the recursively enumerable sets under inclusion (modulo finite sets). On the one hand, every automorphism maps a maximal set ''A'' to another maximal set ''B''; on the other hand, for every two maximal sets ''A'', ''B'' there is an automorphism of the recursively enumerable sets such that ''A'' is mapped to ''B''.

{{unreferenced|date=August 2007}}