Searcharxiv⌕ Search

arXiv subjects

Iván Ongay-Valverde

Publications and source records attributed to Iván Ongay-Valverde.

5 recordsLinked to original sources

A new topological generalization of descriptive set theory

We introduce a new topological generalization of the $σ$-projective hierarchy, not limited to Polish spaces. Earlier attempts have replaced $^ωω$ by $^κκ$, for $κ$ regular uncountable, or replaced countable by $σ$-discrete. Instead we close the usual $σ$-projective sets under continuous images and perfect preimages together with countable unions. The natural set-theoretic axiom to apply is $σ$-projective determinacy, which follows from large cardinals. Our goal is to generalize the known results for $K$-analytic spaces (continuous images of perfect preimages of $^ωω$) to these more general settings. We have achieved some successes in the area of Selection Principles--the general theme is that nicely defined Menger spaces are Hurewicz or even $σ$-compact. The $K$-analytic results are true in ZFC; the more general results have consistency strength of only an inaccessible.

math.LO↗

$\mathsf{SOCA}$ and $\mathsf{OGA}$ for $\mathsf{HL}$ spaces with strong properties

We study open colorings in certain classes of hereditary Lindelöf ($\mathsf{HL}$) spaces and submetrizable spaces. In particular, we show that the definible version for the Open Graph Axiom ($\mathsf{OGA}$) holds for the class of $\mathsf{HL}$ strong Choquet submetrizable spaces extending a well-known result of Feng. Furthermore, we show the consistency of the Open Graph Axiom for regular spaces that have countable spread and it's square also has it, reaching closer to a well known conjecture of Todorčević: "It is consistent that all regular spaces with countable spread satisfy $\mathsf{OGA}$".

math.GN↗

Splitting Localization and Prediction Numbers

In this paper the work done by Newelski and Roslanowski is revisited to solve a question done by Blass about one of the possible evasion and prediction numbers. This led to define a variation of the $k$-localization property (the $(k+1)^ω$-localization property) and the use of a forcing notion with accelerating trees.

math.LO↗

Computable analogs of cardinal characteristics: Prediction and Rearrangement

There has recently been work by multiple groups in extracting the properties associated with cardinal invariants of the continuum and translating these properties into similar analogous combinatorial properties of computational oracles. Each property yields a highness notion in the Turing degrees. In this paper we study the highness notions that result from the translation of the evasion number and its dual, the prediction number, as well as two versions of the rearrangement number. When translated appropriately, these yield four new highness notions. We will define these new notions, show some of their basic properties and place them in the computability-theoretic version of Cichoń's diagram.

math.LO↗

Effective Localization number: building $k$-surviving degrees

We introduce and study effective versions of the localization numbers introduced by Newelski and Roslanowski (cite in paper). We show that proper hierarchies are produced, and that the corresponding highness notions are relatively weak, in that they can often be made computably traceable. We discuss connections with other better-understood effective cardinal characteristics.

math.LO↗