相关论文: Ultrapowers of determinacy models as iteration tre…

This paper shows that over infinite trees, satisfiability is decidable for weak monadic second-order logic extended by the unbounding quantifier U and quantification over infinite paths. The proof is by reduction to emptiness for a certain…

The HOM-problem, which asks whether the image of a regular tree language under a tree homomorphism is again regular, is known to be decidable by [Godoy, Gim\'enez, Ramos, \`Alvarez: The HOM problem is decidable. STOC (2010)]. Research on…

We study the model-checking problem for recursion schemes: does the tree generated by a given higher-order recursion scheme satisfy a given logical sentence. The problem is known to be decidable for sentences of the MSO logic. We prove…

Decision trees are renowned for their ability to achieve high predictive performance while remaining interpretable, especially on tabular data. Traditionally, they are constructed through recursive algorithms, where they partition the data…

We determine explicitly the Hodge ideals for the determinant hypersurface as an intersection of symbolic powers of determinantal ideals. We prove our results by studying the Hodge and weight filtrations on the mixed Hodge module O_X(*Z) of…

The Strong Lottery Ticket Hypothesis (SLTH) states that randomly-initialised neural networks likely contain subnetworks that perform well without any training. Although unstructured pruning has been extensively studied in this context, its…

We study the expressive power and succinctness of order-invariant sentences of first-order (FO) and monadic second-order (MSO) logic on structures of bounded tree-depth. Order- invariance is undecidable in general and, thus, one strives for…

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…

We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…

Linear tree constraints were introduced by Hofmann and Rodriguez in the context of amortized resource analysis for object oriented programs. More precisely, they gave a reduction from inference of resource types to constraint solving. Thus,…

We prove results concerning the behavior of Hodge ideals under restriction to hypersurfaces or fibers of morphisms, and addition. The main tool is the description of restriction functors for mixed Hodge modules by means of the…

We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…

Model-checking is one of the most powerful techniques for verifying systems and programs, which since the pioneering results by Knapik et al., Ong, and Kobayashi, is known to be applicable to functional programs with higher-order types…

A phylogenetic tree shows the evolutionary relationships among species. Internal nodes of the tree represent speciation events and leaf nodes correspond to species. A goal of phylogenetics is to combine such trees into larger trees, called…

We study the Hodge filtrations of Schmid and Vilonen on unipotent representations of real reductive groups. We show that for various well-defined classes of unipotent representations (including, for example, the oscillator representations…

Assume $AD+V=L(\mathbb{R})$. Let $\kappa=\utilde{\delta}^2_1$, the supremum of all $\utilde{\Delta}^2_1$ prewellorderings. We prove that extenders on the sequence of $\H$ that have critical point $\kappa$ are generated by countably complete…

In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…

One obstacle that so far prevents the introduction of machine learning models primarily in critical areas is the lack of explainability. In this work, a practicable approach of gaining explainability of deep artificial neural networks (NN)…

In this paper, we relate combinatorial conditions for polarizations of powers of the graded maximal ideal with rank conditions on submodules generated by collections of Young tableaux. We apply discrete Morse theory to the hypersimplex…

This paper is an extended version of our work in \cite{Ca2025}. We extend the concept of effective reducibility between statements of set theory with ordinal Turing machines (OTMs) explored in \cite{Ca2018} for $\Pi_{2}$-statements to…