Π 0 1 ENCODABILITY AND OMNISCIENT REDUCTIONS - Archive ouverte HAL
Journal Articles Notre Dame Journal of Formal Logic Year : 2016

Π 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.
Fichier principal
Vignette du fichier
encodability_and_omniscient_reduction.pdf (312.05 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01397286 , version 1 (15-11-2016)

Identifiers

  • HAL Id : hal-01397286 , version 1

Cite

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

Collections

LACL UPEC
115 View
82 Download

Share

More