Projects per year
Abstract
We present an analogy between cardinal characteristics from set theory and highness properties from computability theory, which specify a sense in which a Turing oracle is computationally strong. While this analogy was first studied explicitly by Rupprecht (Effective correspondents to cardinal characteristics in Cichon’s diagram, PhD thesis, University of Michigan, 2010), many prior results can be viewed from this perspective. After a comprehensive survey of the analogy for characteristics from Cichon’s diagram, we extend it to Kurtz randomness and the analogue of the SpeckerEda number.
Original language  English 

Title of host publication  Proceedings of the 13th Asian Logic Conference 
Subtitle of host publication  Guangzhou, China, 16 – 20 September 2013 
Publisher  World Scientific Publishing Co. 
Pages  128 
Number of pages  28 
ISBN (Electronic)  9789814678018 
ISBN (Print)  9789814675994 
Publication status  Published  1 May 2015 
Keywords
 computability theory
 set theory
Fingerprint Dive into the research topics of 'An analogy between cardinal characteristics and highness properties of oracles'. Together they form a unique fingerprint.
Projects
 1 Finished

Bringing set theory and algebraic topology together.
Rasappan, R.
21/10/13 → 20/06/16
Project: Research