Computing sets from all infinite subsets

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the collection of introreducible sets is Π11\boldsymbol {\Pi }^1_1...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Transactions of the American Mathematical Society 2021-08, Vol.374 (11), p.8131-8160
Hauptverfasser:	Greenberg, Noam, Harrison-Trainor, Matthew, Patey, Ludovic, Turetsky, Dan
Format:	Artikel
Sprache:	eng
Schlagworte:	Logic Mathematics Research article
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!