MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY

DOI10.1017/jsl.2022.60arXiv2106.00312MaRDI QIDQ6095978

Joseph S. Miller, André Nies, Steffen Lempp, Mariya Ivanova Soskova

Publication date: 11 September 2023

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

highnessultrafilterscardinal characteristicsmass problemsMedvedev reducibilitysequences of computable sets

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relativized Schnorr tests with universal behavior
• The Shelah P-point independence theorem
• An Analogy between Cardinal Characteristics and Highness Properties of Oracles
• Combinatorial Cardinal Characteristics of the Continuum
• Algorithmic Randomness and Complexity
• Low upper bounds of ideals
• The degrees below a 1-generic degree < 0′
• A cohesive set which is not high
• General topology meets model theory, on 𝔭 and 𝔱
• Cardinal invariants, non-lowness classes, and Weihrauch reducibility
• Definable maximal independent families
• Degrees in Which the Recursive Sets are Uniformly Recursive
• On the filter of computably enumerable supersets of an r-maximal set

This page was built for publication: MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY