Related papers: Bounds on Continuous Scott Rank

We introduce a generalization of sequential compactness using barriers on $\omega$ extending naturally the notion introduced in [W. Kubi\'{s} and P. Szeptycki, On a topological Ramsey theorem, \emph{Canad. Math. Bull.}, 66 (2023),…

Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimulin and Yamaleev. Using the same…

We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of $\omega$-regular expressions…

Let $(\Omega, \mu)$ be a measure space and $\{\tau_\alpha\}_{\alpha\in \Omega}$ be a normalized continuous Bessel family for a real Hilbert space $\mathcal{H}$. If the diagonal $\Delta := \{(\alpha, \alpha):\alpha \in \Omega\}$ is…

We conduct a comparative analysis of the constants in the Nagaev-Bikelis and Bikelis-Petrov inequalities which establish non-uniform estimates of the rate of convergence in the central limit theorem for sums of independent random variables…

We prove equality between the Topological Stable Rank and the Bass Stable Rank for finitely generated projective left modules over a unital C*-algebra. In order to do so, the concept of Stable Rank of a Hilbert module is introduced.

We focus on formulae $\exists X.\, \varphi(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set. The ordinal rank $\mathrm{rank}(X) < \omega_1$ of such a set $X$ measures its…

Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…

We prove some results on the Wadge order on the space of sets of natural numbers endowed with Scott topology, and more generally, on omega-continuous domains. Using alternating decreasing chains we characterize the property of Wadge…

Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…

This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…

Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of…

The cardinal direction calculus (CDC) proposed by Goyal and Egenhofer is a very expressive qualitative calculus for directional information of extended objects. Early work has shown that consistency checking of complete networks of basic…

We show that if $0<t<s\leq n-1$, $\Omega\subseteq \mathbb{R}^{n}$ with lower $s$-content regular complement, and $z\in \Omega$, there is a chord-arc domain $\Omega_{z}\subseteq \Omega $ with center $z$ so that…

We give a general lower bound on the rank of matrices of the form $\rho(h) - I$ with $\rho : G \rightarrow GL({\mathbb F}^n)$ an irreducible representation of a finite group $G$. The main tool in the proof is a (strengthening) of a…

This paper extends our previous results on logarithmically improved regularity criteria for the three-dimensional Navier-Stokes equations by establishing a comprehensive framework of multi-level logarithmic improvements. We prove that if…

A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While…

A rigorous way to obtain sharp bounds for Stokes constants is introduced and illustrated on a concrete problem arising in applications.

Rank-metric codes are subspaces of matrices over finite fields endowed with the rank metric and admit a natural tensorial representation. The tensor rank provides a measure of the minimal size of a decomposition of a code into rank-one…

A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…