Related papers: ${\Sigma}^0_3$ determinacy and ${\mathbf{\Pi}}^1_2…

In the paper, by convolution theorem of the Laplace transforms, a monotonicity rule for the ratio of two Laplace transforms, Bernstein's theorem for completely monotonic functions, and other analytic techniques, the authors verify…

Fra\"iss\'e's conjecture (proved by Laver) is implied by the $\Pi^1_1$-comprehension axiom of reverse mathematics, as shown by Montalb\'an. The implication must be strict for reasons of quantifier complexity, but it seems that no better…

We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an $\aleph_0$-categorical theory is $\Pi^0_3$-complete; and the property of being an Ehrenfeucht…

We study translating solitons for the mean curvature flow, $\Sigma^2\subseteq\mathbb{R}^3$ which are contained in slabs, and are of finite genus and finite entropy. As a first consequence of our results, we can enumerate connected…

It is well known that classical varieties of $\Sigma$-algebras correspond bijectively to finitary monads on $\mathsf{Set}$. We present an analogous result for varieties of ordered $\Sigma$-algebras, i.e., classes presented by inequations…

We show that strongly monotone systems of ordinary differential equations which have a certain translation-invariance property are so that all solutions converge to a unique equilibrium. The result may be seen as a dual of a well-known…

We define a notion of model for the $\lambda$$\Pi$-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the $\lambda$$\Pi$-calculus modulo any…

We consider inverse problems for $p$-Laplace type equations under monotonicity assumptions. In two dimensions, we show that any two conductivities satisfying $\sigma_1 \geq \sigma_2$ and having the same nonlinear Dirichlet-to-Neumann map…

We determine the consistency strength of determinacy for projective games of length $\omega^2$. Our main theorem is that $\boldsymbol\Pi^1_{n+1}$-determinacy for games of length $\omega^2$ implies the existence of a model of set theory with…

To verify the universal validity of the "two-sided" monotonicity condition introduced in [8], we will apply it to include more classical examples. The present paper selects the $L^{p}$ convergence case for this purpose. Furthermore, Theorem…

We show that in the iterated Sacks model over the constructible universe the Mansfield-Solovay Theorem holds for $\Sigma^1_3$ sets. In particular, every $\mathbf{\Sigma}^1_3$ set is Marczewski measurable and the optimal complexity for a…

For $\Gamma_1$-structures on 3-manifolds, we give a very simple proof of Thurston's regularization theorem, first proved in \cite{thurston}, without using Mather's homology equivalence. Moreover, in the co-orientable case, the resulting…

We show that the SO(3) monopole cobordism formula from Feehan and Leness (2002) implies that all smooth, closed, oriented four-manifolds with $b^1=0$ and $b^+\geq 3$ and odd with Seiberg-Witten simple type satisfy the superconformal simple…

In this short note a new proof of the monotone con- vergence theorem of Lebesgue integral on \sigma-class is given.

We consider a $\pi_{1}$--injective immersion $f:\Sigma\to M$ from a compact surface $\Sigma$ to a hyperbolic 3--manifold $M$. Let $\Gamma$ denote the copy of $\pi_{1}\Sigma$ in $\mathrm{Isom}({\mathbb{H}}^{3})$ induced by the immersion and…

We use the Sigma^1_3 absoluteness theorem to show that the complexity of the statement "(omega,E)$ is isomorphic to an initial segment of the core model" is Pi^1_4, and that the complexity of the statement "(omega,E)$ is isomorphic to a…

Steel and Welch have shown that K is \Sigma^1_3 correct if the reals are closed under sharps but 0^\pistol doesn't exist. We'll give a simple and purely combinatorial proof of the following: K is \Sigma^1_3 correct if the reals are closed…

We prove the consistency result from the title. By forcing we construct a model of g=aleph_1, b=cf(Sym(omega))=aleph_2.

This paper considers the computational hardness of computing expected outcomes and deciding (universal) (positive) almost-sure termination of probabilistic programs. It is shown that computing lower and upper bounds of expected outcomes is…

We study the consistency strength of Lebesgue measurability for $\Sigma^1_3$ sets over Zermelo set theory ($Z$) in a completely choiceless context. We establish a result analogous to the Solovay-Shelah theorem.