SearcharxivSearch

arXiv subjects

Sandra Müller

Publications and source records attributed to Sandra Müller.

At least 19 recordsLinked to original sources

On a local variant of the 12th Delfino problem -- the $\Sigma$-side

Assuming that $M_n$, the canonical inner model with $n$ Woodin cardinals, exists, we force a model in which every $\boldsymbol{\Sigma}^1_{n+2}$ set is Lebesgue measurable and has the Baire property, and in which $\Sigma^1_{n+2+m}$-uniformization holds for every $m\in\omega$. Additionally, this universe has a $\Delta^1_{n+3}$-definable wellorder of the reals. This answers a question of S. D. Friedman and R. Schindler from 1999. In the case $n=1$, the construction also gives a model with one Woodin cardinal in which all $\Sigma^1_3$ sets are measurable with respect to the random, Cohen, Sacks and Miller notions of measurability, while a $\Delta^1_4$-definable wellorder of the reals exists answering an instance of a question of S. D. Friedman and D. Schrittesser.

math.LO

CoarseSoundNet: Building a reliable model for ecological soundscape analysis

A soundscape is composed of three types of sound: biophony (sounds made by animals), geophony (natural abiotic sounds) and anthropophony (sounds made by humans). A key research question in the field of soundscape ecology is how these components interact with each other, specifically how biophony responds to geophony and anthropophony. Nevertheless, as of today, there are not many analytical instruments that enable the distinct quantification of these elements. Recent machine learning (ML) approaches aim to support automated analysis but often rely on task-specific or clean data, limiting generalisation to noisy passive acoustic monitoring (PAM) recordings. This study presents a clear and reproducible structure to build ML models for coarse soundscape classification and introduces CoarseSoundNet, a deep learning model trained to distinguish biophony, geophony, and anthropophony under realistic PAM conditions. We systematically investigate model architectures, the influence of an additional training class, data composition, and evaluation strategies. Our findings suggest that model performance improves with additional PAM data, especially when similar to the target domain, and by introducing an explicit silence class during training. Class-specific decision thresholds and duration-based constraints further enhance performance, particularly for anthropophony and geophony. Error analyses exhibit challenges for anthropophony due to masking effects and confusions for silence and insect sounds for geophony and biophony. Finally, we conduct an ecological case study which shows that pre-filtering recordings with CoarseSoundNet yields acoustic index trends comparable to ground-truth filtering, supporting its use as an effective preprocessing tool for ecoacoustic analyses.

cs.SD

Long games just beyond fixed countable length

We introduce a new type of game on natural numbers of variable countable length, which can be regarded as a diagonalization of all games of fixed countable length on natural numbers. Building on previous work by Trang and Woodin, we show that analytic determinacy of the game is equivalent to the existence of a sharp for a canonical inner model with a limit of Woodin cardinals $\lambda$ such that the order type of Woodin cardinals below $\lambda$ is $\lambda$.

math.LO

A model with fragments of projective determinacy and failures of $\mathsf{DC}$

We describe a construction of a model of second order arithmetic in which (boldface) $\bm{\Pi^1_n}$-determinacy holds, but (lightface) $\Pi^1_{n+2}$-$\mathsf{DC}$ fails, thus showing that no projective level of determinacy implies full $\mathsf{DC}_{\mathbb{R}}$. The construction builds upon the work of Gitman, Friedman, and Kanovei.

math.LO

The $\lambda$-PSP at $\lambda$-$\Pi^1_1$ sets

Given a strong limit cardinal $\lambda$ of countable cofinality, we show that if every (boldface) $\lambda\hyp\boldsymbol{\Pi}^1_1$ subset of the generalised Cantor space ${}^{\lambda}2$ has the $\lambda$-$\mathsf{PSP}$, then $0^\dagger$ exists. We show too that if every (lightface) $\lambda\hyp\Pi^1_1$ subset of ${}^\lambda 2$ has the $\lambda\hyp\mathsf{PSP}$, then there is an inner model with a measurable cardinal. The paper, a contribution to the ongoing research on generalised regularity properties in generalised descriptive set theory at singular cardinals of countable cofinality, is aimed at descriptive set theorists, and so it presents its results in as much detail as possible, particularly regarding the inner model-theoretic aspects. In doing so, we intend to provide the community with the tools needed to handle consistency strength arguments at the corresponding levels.

math.LO

G\"odel's Program in Set Theory

G\"odel proved in the 1930s in his famous Incompleteness Theorems that not all statements in mathematics can be proven or disproven from the accepted ZFC axioms. A few years later he showed the celebrated result that Cantor's Continuum Hypothesis is consistent. Afterwards, G\"odel raised the question whether, despite the fact that there is no reasonable axiomatic framework for all mathematical statements, natural statements, such as Cantor's Continuum Hypothesis, can be decided via extending ZFC by large cardinal axioms. While this question has been answered negatively, the problem of finding good axioms that decide natural mathematical statements remains open. There is a compelling candidate for an axiom that could solve G\"odel's problem: V = Ultimate-L. In addition, due to recent results the Sealing scenario has gained a lot of attention. We describe these candidates as well as their impact and relationship.

math.LO

Independence Phenomena in Mathematics: a Set Theoretic Perspective on Current Obstacles and Scenarios for Solutions

The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt Gödel's famous incompleteness theorems, we nowadays know numerous concrete examples for such questions. A large number of problems in set theory, for example, regularity properties such as Lebesgue measurability and the Baire property are not decided - for even rather simple (for example, projective) sets of reals - by ZFC. Even many problems outside of set theory have been showed to be unsolvable, meaning neither their truth nor their failure can be proven from ZFC. A major part of set theory is devoted to attacking this problem by studying various extensions of ZFC and their properties. We outline some of these extensions and explain current obstacles in understanding their impact on the set theoretical universe together with recent progress on these questions and future scenarios. This work is related to the overall goal to identify the "right" axioms for mathematics.

math.LO

Outward compactness

We introduce and study a new type of compactness principle for strong logics that, roughly speaking, infers the consistency of a theory from the consistency of its small fragments in certain outer models of the set-theoretic universe. We refer to this type of compactness property as outward compactness, and we show that instances of this type of principle for second-order logic can be used to characterize various large cardinal notions between measurability and extendibility, directly generalizing a classical result of Magidor that characterizes extendible cardinals as the strong compactness cardinals of second-order logic. In addition, we generalize a result of Makowsky that shows that Vop\v{e}nka's Principle is equivalent to the existence of compactness cardinals for all abstract logics by characterizing the principle "Ord is Woodin" through outward compactness properties of abstract logics.

math.LO

$Σ_1$-definability at higher cardinals: Thin sets, almost disjoint families and long well-orders

Given an uncountable cardinal $κ$, we consider the question of whether subsets of the power set of $κ$ that are usually constructed with the help of the Axiom of Choice are definable by $Σ_1$-formulas that only use the cardinal $κ$ and sets of hereditary cardinality less than $κ$ as parameters. For limits of measurable cardinals, we prove a perfect set theorem for sets definable in this way and use it to generalize two classical non-definability results to higher cardinals. First, we show that a classical result of Mathias on the complexity of maximal almost disjoint families of sets of natural numbers can be generalized to measurable limits of measurables. Second, we prove that for a limit of countably many measurable cardinals, the existence of a simply definable well-ordering of subsets of $κ$ of length at least $κ^+$ implies the existence of a projective well-ordering of the reals. In addition, we determine the exact consistency strength of the non-existence of $Σ_1$-definitions of certain objects at singular strong limit cardinals. Finally, we show that both large cardinal assumptions and forcing axioms cause analogs of these statements to hold at the first uncountable cardinal $ω_1$.

math.LO

Chang models over derived models with supercompact measures

Based on earlier work of the third author, we construct a Chang-type model with supercompact measures extending a derived model of a given hod mouse with a regular cardinal $\delta$ that is both a limit of Woodin cardinals and a limit of ${<}\delta$-strong cardinals. The existence of such a hod mouse is consistent relative to a Woodin cardinal that is a limit of Woodin cardinals. We argue that our Chang-type model satisfies $\mathsf{AD}_{\mathbb{R}} + \Theta$ is regular + $\omega_1$ is ${<}\delta_{\infty}$-supercompact for some regular cardinal $\delta_{\infty}>\Theta$. This complements Woodin's generalized Chang model, which satisfies $\mathsf{AD}_{\mathbb{R}}+\omega_1$ is supercompact, assuming a proper class of Woodin cardinals that are limits of Woodin cardinals.

math.LO

An undecidable extension of Morley's theorem on the number of countable models

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of $σ$-projective equivalence relations in several models of set theory. Our methods include random and Cohen forcing, Woodin cardinals and Inner Model Theory.

math.LO

Towards a generic absoluteness theorem for Chang models

Let $\Gamma^\infty$ be the set of all universally Baire sets of reals. Inspired by recent work of the second author and Nam Trang, we introduce a new technique for establishing generic absoluteness results for models containing $\Gamma^\infty$. Our main technical tool is an iteration that realizes $\Gamma^\infty$ as the sets of reals in a derived model of some iterate of $V$. We show, from a supercompact cardinal $\kappa$ and a proper class of Woodin cardinals, that whenever $g \subseteq Col(\omega, 2^{2^\kappa})$ is $V$-generic and $h$ is $V[g]$-generic for some poset $\mathbb{P}\in V[g]$, there is an elementary embedding $j: V\rightarrow M$ such that $j(\kappa)=\omega_1^{V[g*h]}$ and $L(\Gamma^\infty, \mathbb{R})$ as computed in $V[g*h]$ is a derived model of $M$ at $j(\kappa)$. As a corollary we obtain that $\mathsf{Sealing}$ holds in $V[g]$, which was previously demonstrated by Woodin using the stationary tower forcing. Also, using a theorem of Woodin, we conclude that the derived model of $V$ at $\kappa$ satisfies $\mathsf{AD}_{\mathbb{R}}+``\Theta$ is a regular cardinal". Inspired by core model induction, we introduce the definable powerset $\mathcal{A}^\infty$ of $\Gamma^\infty$ and use our derived model representation mentioned above to show that the theory of $L(\mathcal{A}^\infty)$ cannot be changed by forcing. Working in a different direction, we also show that the theory of $L(\Gamma^\infty, \mathbb{R})[\mathcal{C}]$, where $\mathcal{C}$ is the club filter on $\wp_{\omega_1}(\Gamma^\infty)$, cannot be changed by forcing. Proving the two aforementioned results is the first step towards showing that the theory of $L(Ord^\omega, \Gamma^\infty, \mathbb{R})([\mu_\alpha: \alpha\in Ord])$, where $\mu_\alpha$ is the club filter on $\wp_{\omega_1}(\alpha)$, cannot be changed by forcing.

math.LO

Determinacy and Large Cardinals

The study of inner models was initiated by Gödel's analysis of the constructible universe. Later, the study of canonical inner models with large cardinals, e.g., measurable cardinals, strong cardinals or Woodin cardinals, was pioneered by Jensen, Mitchell, Steel, and others. Around the same time, the study of infinite two-player games was driven forward by Martin's proof of analytic determinacy from a measurable cardinal, Borel determinacy from ZFC, and Martin and Steel's proof of levels of projective determinacy from Woodin cardinals with a measurable cardinal on top. First Woodin and later Neeman improved the result in the projective hierarchy by showing that in fact the existence of a countable iterable model, a mouse, with Woodin cardinals and a top measure suffices to prove determinacy in the projective hierarchy. This opened up the possibility for an optimal result stating the equivalence between local determinacy hypotheses and the existence of mice in the projective hierarchy. This article outlines the main concepts and results connecting determinacy hypotheses with the existence of mice with large cardinals as well as recent progress in the area.

math.LO

Uniformization and Internal Absoluteness

Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a given ideal. We prove that for all $σ$-ideals $I$ such that the ideal forcing $\mathbb{P}_I$ of Borel sets modulo $I$ is proper, this uniformization principle is equivalent to an absoluteness principle for projective formulas with respect to $\mathbb{P}_I$ that we call internal absoluteness. In addition, we show that it is equivalent to measurability with respect to $I$ together with $1$-step absoluteness for the poset $\mathbb{P}_I$. These equivalences are new even for Cohen and random forcing and they are, to the best of our knowledge, the first precise equivalences between regularity and absoluteness beyond the second level of the projective hierarchy.

math.LO

Constructing Wadge classes

We show that, assuming the Axiom of Determinacy, every non-selfdual Wadge class can be constructed by starting with those of level $ω_1$ (that is, the ones that are closed under Borel preimages) and iteratively applying the operations of expansion and separated differences. The proof is essentially due to Louveau, and it yields at the same time a new proof of a theorem of Van Wesep (namely, that every non-selfdual Wadge class can be expressed as the result of a Hausdorff operation applied to the open sets). The exposition is self-contained, except for facts from classical descriptive set theory.

math.LO

Perfect Subtree Property for Weakly Compact Cardinals

We investigate the consistency strength of the statement: $κ$ is weakly compact and there is no tree on $κ$ with exactly $κ^{+}$ many branches. We show that this statement fails strongly (in the sense that there is a sealed tree with exactly $κ^{+}$ many branches) if there is no inner model with a Woodin cardinal. Moreover, we show that for a weakly compact cardinal $κ$ the nonexistence of a tree on $κ$ with exactly $κ^{+}$ many branches and, in particular, the Perfect Subtree Property for $κ$, implies the consistency of $AD_{\mathbb{R}} + DC$.

math.LO

The consistency strength of determinacy when all sets are universally Baire

It is known that the large cardinal strength of the Axiom of Determinacy when enhanced with the hypothesis that all sets of reals are universally Baire is much stronger than the Axiom of Determinacy itself. Sargsyan conjectured it to be as strong as the existence of a cardinal that is both a limit of Woodin cardinals and a limit of strong cardinals. Larson, Sargsyan and Wilson used a generalization of Woodin's derived model construction to show that this conjectured result would be optimal. In this paper we introduce a new translation procedure for hybrid mice extending work of Steel, Zhu and Sargsyan and apply it to prove Sargsyan's conjecture.

math.LO

Lebesgue's Density Theorem and definable selectors for ideals

We introduce a notion of density point and prove results analogous to Lebesgue's density theorem for various well-known ideals on Cantor space and Baire space. In fact, we isolate a class of ideals for which our results hold. In contrast to these results, we show that there is no reasonably definable selector that chooses representatives for the equivalence relation on the Borel sets of having countable symmetric difference. In other words, there is no notion of density which makes the ideal of countable sets satisfy an analogue to the density theorem. The proofs of the positive results use only elementary combinatorics of trees, while the negative results rely on forcing arguments.

math.LO