Related papers: Provably well-founded strict partial orders
Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…
A new characterization of provably recursive functions of first-order arithmetic is described. Its main feature is using only terms consisting of 0, the successor S and variables in the quantifier rules, namely, universal elimination and…
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.
The paper focuses on the structure of fundamental sequences of ordinals smaller than $\epsilon_0$. A first result is the construction of a monadic second-order formula identifying a given structure, whereas such a formula cannot exist for…
M. E. Rudin proved under CH that for each P-point there exists another P-point strictly RK-greater (M. E. Rudin, Partial orders on the types of $\beta \mathbb{N}$ , Trans. Amer. Math. Soc., 155 (1971), 353-362). Assuming…
We show that if $f\colon I\to I$ is piecewise monotone, post-critically finite, and locally eventually onto, then for every point $x\in X=\underleftarrow{\lim}(I,f)$ there exists a planar embedding of $X$ such that $x$ is accessible. In…
In this paper we study the almost sure conditional central limit theorem in its functional form for a class of random variables satisfying a projective criterion. Applications to strongly mixing processes and non irreducible Markov chains…
In this paper we expound some basic ideas of proof theory for theories of ordinals such that there are many stable ordinals below the ordinals.
We classify all finite order invariants of immersions of a closed orientable surface into R^3, with values in any Abelian group. We show that they are all functions of order one invariants.
In this paper, we introduce a partial order on neighborhood equivalence classes of maximally spread essential multibranched surfaces embedded in a 3-manifold. We show that if a maximally spread essential multibranched surface is atoroidal…
We prove that there exists an entire function for which every complex number is an asymptotic value and whose growth is arbitrarily slow subject only to the necessary condition that the function is of infinite order.
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
It is be shown that the sequence of Bernstein polynomials for a function of several variables converges to this function uniformly along with every partial derivative of any order, provided that the latter derivative is well defined and…
Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep…
We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of…
We prove a partition identity conjectured by Lassalle (Adv. in Appl. Math. 21 (1998), 457-472).
In the paper, we describe all total orders $\succ$ compatible with addition on additive subsemigroup $S$ of finite dimensional spaces over rational numbers. We provide a necessary and sufficient condition under which a finitely generated…
We investigate the computational complexity of admissibility of inference rules in infinite-valued {\L}ukasiewicz propositional logic (\L). It was shown in [13] that admissibility in {\L} is checkable in PSPACE. We establish that this…
We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…
Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…