Related papers: On Maximum Conservative Extensions
We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$. We prove that the following are equivalent over the weak…
In this paper we prove that a complete Riemannian manifold is $L^p$-positivity preserving for any $p\in(1,\infty)$. This means that any $L^p$ function which solves $(-\Delta + 1)u\ge 0$ in the sense of distributions is necessarily…
A predilator is a particularly uniform transformation of linear orders. We have a dilator when the transformation preserves well-foundedness. Over the theory $\mathsf{ACA}_0$ from reverse mathematics, any $\Pi^1_2$-formula is equivalent to…
The determinacy of lightface $\Delta^1_{2n+2}$ and boldface $\boldsymbol{\Pi}^1_{2n+1}$ sets implies the existence of an $(\omega, \omega_1)$-iterable $M_{2n+1}^{\#}$.
For the Malvenuto-Reutenauer Hopf algebra of permutations, we provide a cancellation-free antipode formula for any permutation of the form $ab1\cdots(b-1)(b+1)\cdots(a-1)(a+1)\cdots n$, which starts with the decreasing sequence $ab$ and…
We discuss some well-known compactness principles for uncountable structures of small regular sizes ($\omega_n$ for $2 \le n<\omega$, $\aleph_{\omega+1}$, $\aleph_{\omega^2+1}$, etc.), consistent from weakly compact (the size-restricted…
The aim of this work is to extend and prove the Onsager conjecture for a class of conservation laws that possess generalized entropy. One of the main findings of this work is the "universality" of the Onsager exponent, $\alpha > 1/3$,…
We give in this paper some formulas which are useful in the construction of nontrivial conserved currents for submodels of CP^1-model or QP^1-model in (1+2) dimensions. These are full generalization of our results in the previous paper…
We use ``iterated square sequences'' to show: There is an L-definable partition n: L-singulars --> omega such that if M is an inner model without 0#: (a) For some n, M satisfies that {alpha | n(alpha)=n} is stationary. (b) For each n there…
We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Pi-1-2 and Sigma-1-2 hard, and we…
The aim of this paper is to give natural examples of $\mathbf{\Sigma}_1^1$-complete and $\mathbf{\Pi}_1^1$-complete sets. In the first part, we consider ideals on $\omega$. In particular, we show that the Hindman ideal $\mathcal{H}$ is…
We derive an integral expression $G(z)$ for the reciprocal gamma function, $1/\Gamma(z)=G(z)/\pi$, that is valid for all $z\in\mathbb{C}$, without the need for analytic continuation. The same integral avoids the singularities of the gamma…
For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…
We introduce the family of axioms, denoted $\operatorname{Slice}_\kappa$, that claim the existence of strictly increasing decompositions of the form $$2^{\delta}=\bigcup_{\alpha<\kappa} 2^{\delta}\cap M_\alpha,$$ where $\delta<\kappa$, and…
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 describe a data structure that supports access, rank and select queries, as well as symbol insertions and deletions, on a string $S[1,n]$ over alphabet $[1..\sigma]$ in time $O(\lg n/\lg\lg n)$, which is optimal even on binary sequences…
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, we show that $\mathrm{RT}^{2}+\mathsf{WKL}_0$ is a $\Pi^{1}_{1}$-conservative extension of $\mathrm{B}\Sigma^0_3$.
Nontrivial combinatory algebras with S and K must be infinite. Associativity is incompatible with combining a classifier and a retraction pair in a finite extensional magma. These obstructions exclude several standard settings from the…
We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal $\alpha$ there exists an ordinal $\beta$ such that $1+\beta\cdot(\beta+\alpha)$ (ordinal arithmetic) admits an…