Related papers: Characterising SJT reducibility

The provability logic of a theory $T$ captures the structural behavior of formalized provability in $T$ as provable in $T$ itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability…

Let $E$ and $B$ be arbitrary weakly compact JB$^*$-triples whose unit spheres are denoted by $S(E)$ and $S(B)$, respectively. We prove that every surjective isometry $f: S(E) \to S(B)$ admits an extension to a surjective real linear…

We consider the question of, given operators $A$, $Z$ and a sequence of invertible operators $U_n\to Z$, whether the sequence $U_nAU_n^{-1}$ is bounded in norm, as well as generalizations of this where $U_nAU_n^{-1}$ is modified by some…

Mechanistic interpretability seeks to reverse engineer a trained neural network by identifying the minimal subset of internal components. We perform a mechanistic interpretability analysis of the Particle Transformer architecture, trained…

We establish a version of a semistable reduction theorem over a log point with a non-trivial nilpotent structure. In order to do this we extend the classical desingularization theories to non-reduced schemes with generically principal…

Let p=tp(a/A) be a stationary type in an arbitrary finite rank stable theory, and P an A-invariant family of partial types. The following property is introduced and characterised: whenever c is definable over (A,a) and a is not algebraic…

Reductivity of knot projections refers to the minimum number of splices of double points needed to obtain reducible knot projections. Considering the type and method of splicing (Seifert type splice or non-Seifert type splice, recursively…

We show that the finiteness length of an $S$-arithmetic subgroup $\Gamma$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places…

We study countable structures from the viewpoint of enumeration reducibility. Since enumeration reducibility is based on only positive information, in this setting it is natural to consider structures given by their positive atomic diagram…

Building on reduction theorems and dimension bounds for symmetric groups obtained in our earlier work, we classify the irreducible restrictions of representations of the symmetric and alternating groups to proper subgroups. Such…

Let $G$ be a reductive algebraic group---possibly non-connected---over a field $k$ and let $H$ be a subgroup of $G$. If $G= GL_n$ then there is a degeneration process for obtaining from $H$ a completely reducible subgroup $H'$ of $G$; one…

Minimal thinness is a notion that describes the smallness of a set at a boundary point. In this paper, we provide tests for minimal thinness for a large class of subordinate killed Brownian motions in bounded C1,1 domains, C1,1 domains with…

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…

A higher order difference equation may be generally defined in an arbitrary nonempty set S as: \[ f_{n}(x_{n},x_{n-1},...,x_{n-k})=g_{n}(x_{n},x_{n-1},...,x_{n-k}) \] where $f_{n},g_{n} :S^{k+1}\rightarrow S$ are given functions for…

A specification given as a formula in linear temporal logic (LTL) defines a system by its set of traces. However, certain features such as information flow security constraints are rather modeled as so-called hyperproperties, which are sets…

We introduce a proof system for Hajek's logic BL based on a relational hypersequents framework. We prove that the rules of our logical calculus, called RHBL, are sound and invertible with respect to any valuation of BL into a suitable…

A strictly increasing sequence (n_k) of positive integers is said to be a Hilbertian Jamison sequence if for any bounded operator T on a separable Hilbert space such that the supremum over k of the norms ||T^{n_k}|| is finite, the set of…

A hypothesis testing algorithm is replicable if, when run on two different samples from the same distribution, it produces the same output with high probability. This notion, defined by by Impagliazzo, Lei, Pitassi, and Sorell [STOC'22],…

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…