1-Genericity Is Not Weihrauch Reducible to the Finite Intersection Principle
math.LO
Submitted: 2026-11-01
Updated: 2026-11-01
Terminology
Sources
- On the Uniform Computational Content of Computability Theory
- Any FIP real computes a 1-generic
- On the first-order parts of problems in the Weihrauch degrees
- Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics
Related papers
- The consistency strength of the failure of amenable C-sequences
- Classification of bipartite observables III: simplicity, mixtures and quantum error correction
- The Additive Arithmetic of Linear Orders
- Indiscernible Extraction in Theories with Bounded k-splitting
- Measuring the Complexity of Countable Presburger Models
- A non-trivially non-trivial automorphism at an inaccessible cardinal