Notions of indifference for genericity: Union and subsequence sets
Logic
2021-05-24 v1 Logic in Computer Science
Abstract
A set is said to be a universal indifferent set for -genericity if for every -generic and for all , is also -generic. Miller showed that there is no infinite universal indifferent set for -genericity. We introduce two variants (union and subsequence sets for -genericity) of the notion of universal indifference and prove that there are no non-trivial universal sets for -genericity with respect to these notions. In contrast, we show that there is a non-computable subsequence set for weak--genericity.
Cite
@article{arxiv.2104.13910,
title = {Notions of indifference for genericity: Union and subsequence sets},
author = {Tejas Bhojraj},
journal= {arXiv preprint arXiv:2104.13910},
year = {2021}
}
Comments
9 pages