Related papers: Well ordering principles and bar induction
Higman's lemma states that for any well partial order $X$, the partial order $X^*$ of finite sequences with members from $X$ is also well. By combining results due to Girard as well as Sch\"{u}tte and Simpson, one can show that Higman's…
We develop a theory of ordered *-vector spaces with an order unit. We prove fundamental results concerning positive linear functionals and states, and we show that the order (semi)norm on the space of self-adjoint elements admits multiple…
In this paper, we describe a way of turning a seminormed preordered vector space into an Archimedean order unit space. We show that this construction satisfies a universal property similar to that of the Archimedeanization of Paulsen and…
We present a systematic development of inductive limits in the categories of ordered *-vector spaces, Archimedean order unit spaces, matrix ordered spaces, operator systems and operator C*-systems. We show that the inductive limit…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
We study the logical structure of Teichm{\"u}ller-Tukey lemma, a maximality principle equivalent to the axiom of choice and show that it corresponds to the generalisation to arbitrary cardinals of update induction, a well-foundedness…
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…
In this paper general rearrangements of the Haar system in BMO are considered. Several, necessary and suficient, conditions for the boundednes of the induced permutation operator are given. Using analytic families of operators extensions to…
The problem of ordering operators has afflicted quantum mechanics since its foundation. Several orderings have been devised, but a systematic procedure to move from one ordering to another is still missing. The importance of establishing…
Michael Rathjen and the present author have shown that $\Pi^1_1$-bar induction is equivalent to (a suitable formalization of) the statement that every normal function has a derivative, provably in $\mathbf{ACA_0}$. In this note we show that…
We continue our study of operator algebras with and contractive approximate identities (cais). In earlier papers we have introduced and studied a new notion of positivity in operator algebras, with an eye to extending certain C*-algebraic…
We establish a pre-order principle. From the principle, we obtain a very general set-valued Ekeland variational principle, where the objective function is a set-valued map taking values in a quasi ordered linear space and the perturbation…
We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…
We consider the computational strength of Power-OTMs, i.e., ordinal Turing machines equipped with a power set operator, and study a notion of realizability based on these machines. When parameters are allowed, these machines are, modulo…
We investigate the rearrangement of the Haar system induced by the postorder on the set of dyadic intervals in $[0,1]$ with length greater than or equal to $2^{-N}$. By means of operator norms on $\text{BMO}_N$ we prove that the postorder…
This paper introduces the seed order, a partial order of the class of uniform countably complete ultrafilters that generalizes the Mitchell order on normal measures. Like that order, the seed order is consistently a linear ordering even…
We prove that omega^2 strictly bounds the iterations required for modal definable functions to reach a fixed point across all countable structures. The result corrects and extends the previously claimed result by the first and third authors…
In previous work, the author has shown that $\Pi^1_1$-induction along $\mathbb N$ is equivalent to a suitable formalization of the statement that every normal function on the ordinals has a fixed point. More precisely, this was proved for 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 continue to study the local well-posedness for higher order Benjamin-Ono type equations, especially fourth order equations. The proof is based on the energy methods with correction terms. Although one of correction terms can eliminate…