Related papers: Provably well-founded strict partial orders
The set of quasipositive surfaces is closed under incompressible inclusion. We prove that the induced order on fibre surfaces of positive braid links is almost a well-quasi-order. When restricting to quasipositive surfaces containing a…
In this paper, we give two proofs of the wellfoundedness of recursive notation systems for $\Pi_N$-reflecting ordinals. One is based on $\Pi_{N-1}^0$-inductive definitions, and the other is based on distinguished classes.
We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…
A celebrated unresolved conjecture of Peter Frankl states that every finite collection of sets, with finite universe, admits an abundant element. In this paper, we prove Frankl's union-closed conjecture(FC). We provide an induction proof…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…
We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…
Recent developments in the formalisation of quantum causal structures have made it possible to test and compare hypotheses about causal structure empirically, rather than being a-priori assumptions. Such differences in causal structure may…
We prove a result concerning elementary embeddings of the set-theoretic universe into itself (Reinhardt embeddings) and functions on ordinals that "eventually dominate" such embeddings. We apply that result to show the existence of…
A full characterization of the boundedness of Laplace--Carleson embeddings on $L^\infty$ is provided, in terms of the Carleson intensity of the respective measure and of a suitable weighted Berezin transform of the measure. Moreover,…
Necessary and sufficient conditions are presented for a fractional Orlicz-Sobolev space on $\rn$ to be continuously embedded into a space of uniformly continuous functions. The optimal modulus of continuity is exhibited whenever these…
A coarse space $X$, endowed with a linear order compatible with the coarse structure of $X$, is called linearly ordered. We prove that every linearly ordered coarse space $X$ is locally convex and the asymptotic dimension of $X$ is either…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
In this paper we will establish necessary and sufficient conditions for a Laplace-Carleson embedding to be bounded for certain spaces of functions on the positive half-line. We will use these results to characterise weighted (infinite-time)…
We consider the problem of the minimizer constancy in the fractional embedding theorem $\mathcal{H}^s(\Omega) \hookrightarrow L_q(\Omega)$ for a bounded Lipschitz domain $\Omega,$ depending on the domain size. For the family of domains…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…
The optimal Orlicz target space is exhibited for embeddings of fractional-order Orlicz-Sobolev spaces in $\mathbb R^n$. An improved embedding with an Orlicz-Lorentz target space, which is optimal in the broader class of all…
It is shown that a separable exact residually finite dimensional C*-algebra with locally finitely generated (rational) even K-homology embeds in a uniformly hyperfinite C*-algebra.