Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5778122 | Annals of Pure and Applied Logic | 2017 | 8 Pages |
Abstract
For a class C of sets, let us say that a set A is C stabilising if Aâ³XâC for every XâC. We prove that the Martin-Löf stabilising sets are exactly the K-trivial sets, as are the weakly 2-random stabilising sets. We also show that the 1-generic stabilising sets are exactly the computable sets.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Rutger Kuyper, Joseph S. Miller,