Related papers: Well ordering principles and bar induction

By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory…

Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…

In this paper we consider the $f$-orthomorphisms and $f$-linear operators on the order dual of an $f$-algebra. In particular, when the $f$-algebra has the factorization property (not necessarily unital), we prove that the orthomorphisms,…

Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…

Any model of ZFC + GCH has a generic extension (made with a poset of size aleph_2) in which the following hold: MA + 2^{aleph_0}= aleph_2+ there exists a Delta^2_1-well ordering of the reals. The proof consists in iterating posets designed…

Over the last century, the principle of "induction on the continuum" has been studied by different authors in different formats. All of these different readings are equivalent to one of the three versions that we isolate in this paper. We…

This paper extends the class of ordinal regression models with a structured interpretation of the problem by applying a novel treatment of encoded labels. The net effect of this is to transform the underlying problem from an ordinal…

We are able to derive the equations of motion for forced mechanical systems in a purely variational setting, both in the context of Lagrangian or Hamiltonian mechanics, by duplicating the variables of the system as introduced by Galley…

We give an alternate proof of the left-orderability of the mapping class group of a connected oriented infinite-type surface with a non-empty boundary. Our main strategy involves the inductive construction of a countable stable Alexander…

We study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders under a hypothesis called the Ultrapower Axiom. Our main focus is on the relationship between the Ultrapower Axiom and the linearity of…

The study of intelligent systems explains behaviour in terms of economic rationality. This results in an optimization principle involving a function or utility, which states that the system will evolve until the configuration of maximum…

Our goal is to show that the standard model-theoretic concept of types can be applied in the study of order-invariant properties, i.e., properties definable in a logic in the presence of an auxiliary order relation, but not actually…

This article is concerned with the Axiom of Choice (AC) and the well-ordering theorem (WO) in second-order predicate logic with Henkin interpretation (HPL). We consider a principle of choice introduced by Wilhelm Ackermann (1935) and…

While the theory of labelled well-quasi-order has received significant attention in the graph setting, it has not yet been considered in the context of permutation patterns. We initiate this study here, and show how labelled well quasi…

We introduce the notion of \tau-like partial order, where \tau is one of the linear order types \omega, \omega*, \omega+\omega*, and \zeta. For example, being \omega-like means that every element has finitely many predecessors, while being…

A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and…

First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…

Transformations of well partial orders induce functions on the ordinals, via the notion of maximal order type. In most examples from the literature, these functions are not normal, in marked contrast with the central role that normal…

The Bashicu Matrix System is a recursive system of ordinal notations created by the user BashicuHyudora of the japanese Googology Wiki. In this paper, we prove that the Bashicu Matrix System is well-ordered.

Given an ordered set partition, when one insert a number of bars in-between the blocks of the ordered set partition the result is a barred preferential arrangement. In this study, using the notion of barred preferential arrangements we…