相关论文: On the logical strength of Nash-Williams' theorem …
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
A well-known theorem of Nash-Williams shows that the collection of locally finite trees under the topological minor relation results in a BQO. Set theoretically, two very natural questions arise: (1) What is the number $\lambda$ of…
Noncommutative Chern-Simons theory can be classically mapped to commutative Chern-Simons theory by the Seiberg-Witten map. We provide evidence that the equivalence persists at the quantum level by computing two and three-point functions of…
The entropy accumulation theorem states that the smooth min-entropy of an $n$-partite system $A = (A_1, \ldots, A_n)$ is lower-bounded by the sum of the von Neumann entropies of suitably chosen conditional states up to corrections that are…
Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…
We prove reducibility of a class of quasi-periodically forced linear equations of the form \[ \partial_tu-\partial_x\circ (1+a(\omega t, x))u+\mathcal{Q}(\omega t)u=0,\quad x\in\mathbb{T}:=\mathbb{R}/2\pi\mathbb{Z}, \] where $u=u(t,x)$, $a$…
Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…
We study transfinite extensions of Japaridze's provability logic GLP and the well-founded relations that naturally occur within them. Every ordinal induces a partial order over the class of "words," which are iterated consistency statements…
A sequence $s_1,s_2,\ldots, s_k$ of elements of a group $G$ is called a valid ordering if the partial products $s_1, s_1 s_2, \ldots, s_1\cdots s_k$ are all distinct. A long-standing problem in combinatorial group theory asks whether, for a…
We characterize the existence of minimal idempotent ultrafilters (on N) in the style of reverse mathematics and higher-order reverse mathematics using the Auslander-Ellis theorem and variant thereof. We obtain that the existence of minimal…
We show that the Priess-Crampe & Ribenboim fixed point theorem is provable in $\mathsf{RCA}_0$. Furthermore, we show that Caristi's fixed point theorem for both Baire and Borel functions is equivalent to the transfinite leftmost path…
The usage of elementary submodels is a simple but powerful method to prove theorems, or to simplify proofs in infinite combinatorics. First we introduce all the necessary concepts of logic, then we prove classical theorems using elementary…
The recent article "Ohm's Law Survives to the Atomic Scale" by Weber et al. [Science 335, 64 (1021)] reveals ohmic transport in quantized P-in-Si wires. We argue that their results have two main deficiencies: (a) the interpretation of…
Systems of Newton equations of the form $\ddot{q}=-{1/2}A^{-1}(q)\nabla k$ with an integral of motion quadratic in velocities are studied. These equations generalize the potential case (when A=I, the identity matrix) and they admit a…
In this paper we prove the existence of quasi-periodic, small-amplitude, solutions for quasi-linear Hamiltonian perturbations of the non-linear Schroedinger equation on the torus in presence of a quasi-periodic forcing. In particular we…
In this paper, we establish the quasi-compactness of the transfer operator associated with skew product systems that are semi-conjugate to piecewise convex maps with a countably infinite number of branches. These non-invertible skew…
Kruskal's theorem famously states that finite trees (ordered using an infima-preserving embeddability relation) form a well partial order. Freund, Rathjen, and Weiermann extended this result to general recursive data types with their…
We introduce the first cut-free nested sequent systems for first-order modal logics that admit increasing, decreasing, constant, and empty domains along with so-called general path conditions and seriality. We obtain such systems by means…
We reinterpret U(N) Chern-Simons-Witten theory quantized on a torus as a free fermion system. Its Hilbert space and some observables are simply related to those of group quantum mechanics, even at finite N and k. Its large N limit can be…
We introduce a flexible class of well-quasi-orderings (WQOs) on words that generalizes the ordering of (not necessarily contiguous) subwords. Each such WQO induces a class of piecewise testable languages (PTLs) as Boolean combinations of…