Fairness, distances and degrees
Résumé
We show the identity between sets of fair computations in recursive transition graphs, sets of cluster points of finite computations for II01 ultra-metrics refining the Baire metrics, and II03 subsets of ww . The results are applied to recursive marked trees, fairness definitions, w-regular languages, and II03 sets.