Skip to Main content Skip to Navigation
Journal articles

Π 0 1 ENCODABILITY AND OMNISCIENT REDUCTIONS

Abstract : A set of integers A is computably encodable if every infinite set of integers has an infinite subset computing A. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this notion of computable encodability to subsets of the Baire space and we characterize the Π01 encodable compact sets as those who admit a non-empty Σ11 subset. Thanks to this equivalence, we prove that weak weak König's lemma is not strongly computably reducible to Ramsey's theorem. This answers a question of Hirschfeldt and Jockusch.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01397286
Contributor : Benoit Monin <>
Submitted on : Tuesday, November 15, 2016 - 4:08:59 PM
Last modification on : Friday, October 4, 2019 - 1:35:20 AM
Document(s) archivé(s) le : Thursday, March 16, 2017 - 6:10:55 PM

File

encodability_and_omniscient_re...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01397286, version 1

Collections

Citation

Benoit Monin, Ludovic Patey. Π 0 1 ENCODABILITY AND OMNISCIENT REDUCTIONS. Notre Dame Journal of Formal Logic, University of Notre Dame, 2016. ⟨hal-01397286⟩

Share

Metrics

Record views

173

Files downloads

140