相关论文: On the logical strength of Nash-Williams' theorem …
Given $l>2\nu>2d\geq 4$, we prove the persistence of a Cantor--family of KAM tori of measure $O(\varepsilon^{1/2-\nu/l})$ for any non--degenerate nearly integrable Hamiltonian system of class $C^l(\mathscr D\times\mathbb{T}^d)$, where…
It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this…
In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…
Assuming that a Nash type inequality is satisfied by a non-negative self-adjoint operator $A$, we prove a Nash type inequality for the fractional powers $A^{\alpha}$ of $A$. Under some assumptions, we give ultracontractivity bounds for the…
N=2 noncritical strings are closely related to the $\Slr/\Slr$ Wess-Zumino- Novikov-Witten model, and there is much hope to further probe the former by using the algebraic apparatus provided by the latter. An important ingredient is the…
A quasi-order $Q$ induces two natural quasi-orders on $P(Q)$, but if $Q$ is a well-quasi-order, then these quasi-orders need not necessarily be well-quasi-orders. Nevertheless, Goubault-Larrecq showed that moving from a well-quasi-order $Q$…
We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…
It has been widely assumed that partially quenched chiral perturbation theory is the correct low-energy effective theory for partially quenched QCD. Here we present arguments supporting this assumption. First, we show that, for partially…
The ternary betweenness relation of a tree, B(x,y,z) expresses that y is on the unique path between x and z. This notion can be extended to order-theoretic trees defined as partial orders such that the set of nodes larger than any node is…
Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…
We develop the abstract framework for a proof-theoretic analysis of theories with scope beyond ordinal numbers, resulting in an analog of Ordinal Analysis aimed at the study of theorems of complexity $\Pi^1_2$. This is done by replacing the…
Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…
We show that the Nash-Williams theorem has a uniform version and that the Galvin theorem does not. We show that there is an $F_\sigma$ tall ideal on $\mathbb{N}$ without a Borel selector and also construct a $\mathbf\Pi^1_2$ tall ideal…
We provide mutual elementary recursive order isomorphisms between classical ordinal notations, based on Skolem hulling, and notations from pure elementary patterns of resemblance of order $2$, showing that the latter characterize the…
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…
We investigate the logical strength of the cohesiveness principle when restricted to finite sequences of sets, denoted by fin-COH, over different base theories. Our main result shows that fin-COH entails $I\Sigma_1^0$ over the weaker base…
We discuss an incompleteness result proven by Bezboruah and Shepherdson. This result tells us that the weak theory ${\sf PA}^-$ does not prove the consistency of any theory (under certain assumptions explained in the paper). Kreisel argued…
In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…
Weighted First Order Model Counting (WFOMC) is fundamental to probabilistic inference in statistical relational learning models. As WFOMC is known to be intractable in general ($\#$P-complete), logical fragments that admit polynomial time…
The weak boundedness property associated with a standard alpha-fractional Calderon-Zygmund operator and a weight pair is good-lambda controlled by the testing conditions and the Muckenhoupt and energy side conditions. As a consequence,…