Related papers: Provably well-founded strict partial orders

We show that every poset P=(P,\le) satisfying the Ascending Chain Condition can be isomorphically embedded into the poset of all mappings from P to the set A(P) of all antichains of P equipped with a certain partial order relation. This…

In this note the well-ordering principle for the derivative of normal functions on ordinals is shown to be equivalent to the existence of arbitrarily large countable coded omega-models of the well-ordering principle for the function.

Well-partial orders, and the ordinal invariants used to measure them, are relevant in set theory, program verification, proof theory and many other areas of computer science and mathematics. In this article we focus on one of the most…

Optimal embeddings for fractional Orlicz-Sobolev spaces into (generalized) Campanato spaces on the Euclidean space are exhibited. Embeddings into vanishing Campanato spaces are also characterized. Sharp embeddings into…

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

We obtain the sharp asymptotic behavior at infinity of extremal functions for the fractional critical Sobolev embedding.

We consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which…

We study transfinite extensions of Japaridze's provability logic GLP and the well-founded relations that naturally occur within them. Every ordinal induces a partial order over the class of "words," which are iterated consistency statements…

We prove that in some cases definable chains of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic chains, ROD chains in the Solovay model, and $\Sigma^1_2$ chains in the assumption that…

We show that any directed colimit of acessible categories and accessible full embeddings is accessible and, assuming the existence of arbitrarily large strongly compact cardinals, any directed colimit of acessible categories and accessible…

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.

Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

We reevaluate the claim that predicative reasoning (given the natural numbers) is limited by the Feferman-Schutte ordinal Gamma_0. First we comprehensively criticize the arguments that have been offered in support of this position. Then we…

One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…

According to a theorem due to Kenneth Kunen, under ZFC, there is no ordinal $\lambda$ and non-trivial elementary embedding $j:V_{\lambda+2}\to V_{\lambda+2}$. His proof relied on the Axiom of Choice (AC), and no proof from ZF alone has been…

In a previous paper we introduced a version of associativity for a partial infinitary operation. We prove here that if $\gamma$ is an infinite ordinal and some associative infinitary operation is defined for all sequences indexed by…

We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…

There exists a family $\{B_{\alpha}\}_{\alpha<\omega_1}$ of sets of countable ordinals such that o $\max B_{\alpha}=\alpha$, o if $\alpha\in B_{\beta}$ then $B_{\alpha}\subseteq B_{\beta}$, o if $\lambda\leq \alpha$ and $\lambda$ is a limit…

We obtain sharp embeddings from the Sobolev space $W^{k,2}_0(-1,1)$ into the space $L^1(-1,1)$ and determine the extremal functions. This improves on a previous estimate of the sharp constants of these embeddings due to Kalyabin.