\({\Pi}_1^0\)-encodability and omniscient reductions

DOI10.1215/00294527-2018-0020OpenAlexW3098284102MaRDI QIDQ2418778

Ludovic Patey, Benoit Monin

Publication date: 29 May 2019

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.01086

zbMATH Keywords

reverse mathematicshigher recursion theoryRamsey's theorycomputable encodabilitycomputable reduction

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65)

Related Items (3)

The coding power of a product of partitions ⋮ COH, SRT 2 2 , and multiple functionals ⋮ Lawvere-Tierney topologies for computability theorists

This page was built for publication: \({\Pi}_1^0\)-encodability and omniscient reductions