Iterative forcing and hyperimmunity in reverse mathematics

@article{Patey2017IterativeFA,
  title={Iterative forcing and hyperimmunity in reverse mathematics},
  author={Ludovic Patey},
  journal={Computability},
  year={2017},
  volume={6},
  pages={209-221}
}
The separation between two theorems in reverse mathematics is usually done by constructing a Turing ideal satisfying a theorem P and avoiding the solutions to a fixed instance of a theorem Q. Lerman, Solomon and Towsner introduced a forcing technique for iterating a computable non-reducibility in order to separate theorems over omega-models. In this paper, we present a modularized version of their framework in terms of preservation of hyperimmunity and show that it is powerful enough to obtain… CONTINUE READING

From This Paper

Topics from this paper.
5 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Combinatorial weaknesses of ramseyan principles

  • Ludovic Patey
  • In preparation,
  • 2015
2 Excerpts

Dissent within cohesiveness in reverse mathematics

  • Ludovic Patey
  • In preparation,
  • 2015
6 Excerpts

Similar Papers

Loading similar papers…