Related papers: Linear extensions of partial orders and Reverse Ma…

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

Every end of an infinite graph $ G $ defines a tangle of infinite order in $ G $. These tangles indicate a highly cohesive substructure in the graph if and only if they are closed in some natural topology. We characterize, for every finite…

We introduce a q-analogue of the classical Zeta polynomial of finite partially ordered sets, as a polynomial in one variable x with coefficients depending on the indeterminate q. We prove some properties of this polynomial invariant,…

It is well known that there is a correspondence between sets and complete, atomic Boolean algebras (CABA's) taking a set to its power-set and, reciprocally, a complete, atomic Boolean algebra to its set of atomic elements. Of course, such a…

We prove that Higman's lemma is strictly stronger for better quasi orders than for well quasi orders, within the framework of reverse mathematics. In fact, we show a stronger result: the infinite Ramsey theorem (for tuples of all lengths)…

The concept of proximate order is widely used in the theories of entire, meromorphic, subharmonic and plurisubharmonic functions. We give a general interpretation of this concept as a proximate growth function relative to a model growth…

Let $R$ be a unital ring with involution. We give several characterizations and properties of core partial order in $R$. In particular, we investigate the reverse order law $(ab)^{\tiny\textcircled{\tiny\#}} = b^{\tiny\textcircled{\tiny\#}}…

We prove that the order of an ordered group is an interval order if and only if it is a semiorder. Next, we prove that every semiorder is isomorphic to a collection $\mathcal J$ of intervals of some totally ordered abelian group, these…

For any length category, we establish a set of rules (necessary and sufficient) that ensure a partial order on the isomorphism classes of simple objects such that the category is equivalent to the category of finite dimensional…

A block in a linear order is an equivalence class when factored by the block relation B(x,y), satisfied by elements that are finitely far apart. We show that every computable linear order with dense condensation-type (i.e. a dense…

In 1978, Apery has given sequences of rational approximations to $\zeta(2)$ and $\zeta(3)$ yielding the irrationality of each of these numbers. One of the key ingredient of Apery's proof are second-order difference equations with polynomial…

Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse…

The class of support $\tau$-tilting modules was introduced recently by Adachi, Iyama and Reiten. These modules complete the class of tilting modules from the point of view of mutations. Given a finite dimensional algebra $A$, we study all…

Let $\Lambda^r_n$ be the path algebra of the linearly oriented quiver of type $\mathbb{A}$ with $n$ vertices modulo the $r$-th power of the radical, and let $\widetilde{\Lambda}^r_n$ be the path algebra of the cyclically oriented quiver of…

We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…

Let $(P,\leq)$ be a partially ordered set and let $\tau$ be a compact topology on $P$ that is finer than the interval topology. Then $\tau$ is contained in the order (convergence) topology on $(P,\tau)$. So any Priestley topology is…

Ranking theories according to their strength is a recurring motif in mathematical logic. We introduce a new ranking of arbitrary (not necessarily recursively axiomatized) theories in terms of the encoding power of their $\beta$-models:…

The countable condensation on a linear order $L$ is the equivalence relation $\sim_\omega$ defined by declaring $x \sim_\omega y$ when the set of points between $x$ and $y$ is countable. We characterize the linear orders $L$ that condense…

In the 1970s M. Laczkovich posed the following problem: Let $\mathcal{B}_1(X)$ denote the set of Baire class $1$ functions defined on an uncountable Polish space $X$ equipped with the pointwise ordering. \[\text{Characterize the order types…

The program Reverse Mathematics in the foundations of mathematics seeks to identify the minimal axioms required to prove theorems of ordinary mathematics. One always assumes the base theory, a logical system embodying computable…