English
Related papers

Related papers: Infinite decreasing chains in the Mitchell order

200 papers

This paper introduces a partial order on the maximal chains of any finite bounded poset $P$ which has a CL-labeling $\lambda$. We call this the maximal chain descent order induced by $\lambda$, denoted $P_{\lambda}(2)$. As a first example,…

Combinatorics · Mathematics 2022-10-03 Stephen Lacina

The limiting probability distribution is one of the key characteristics of a Markov chain since it shows its long-term behavior. In this paper, for a higher order Markov chain, we establish some properties related to its exact limiting…

Probability · Mathematics 2026-03-20 Lixing Han , Jianhong Xu

Let $\mathcal{CT}_n$ be the semigroup of full contraction mappings on $[n]=\{1,2,\ldots,n\}$, and let $\mathcal{OCT}_n$ and $\mathcal{ODCT}_n$ be the subsemigroups consisting of all order-preserving full contraction and subsemigroup of…

Group Theory · Mathematics 2022-04-18 M. M. Zubairu , A. Umar , J. A. Aliyu

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…

Logic · Mathematics 2024-03-27 Henry Towsner

We introduce an elementary class of linearly ordered groups, called growth order groups, encompassing certain groups under composition of formal series (e.g. transseries) as well as certain groups $\mathcal{G}_{\mathcal{M}}$ of infinitely…

Logic · Mathematics 2025-05-27 Vincent Mamoutou Bagayoko

Let $\mathcal{C}$ be a finitely bicomplete category and $\mathcal{W}$ a subcategory. We prove that the existence of a model structure on $\mathcal{C}$ with $\mathcal{W}$ as subcategory of weak equivalence is not first order expressible.…

Category Theory · Mathematics 2021-02-25 Jean-Marie Droz , Inna Zakharevich

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $\omega_1^{CK}$, the computable infinitary theory is $\aleph_0$-categorical. Millar and Sacks asked whether this…

Logic · Mathematics 2016-06-06 Matthew Harrison-Trainor , Gregory Igusa , Julia F. Knight

The presence of frozen-in or quenched disorder in a system can often modify the nature of its phase transition. A particular instance of this phenomenon is the so-called rounding effect: it has been shown in many cases that the free-energy…

Mathematical Physics · Physics 2014-11-14 Hubert Lacoin

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

Following Laczkovich we consider the partially ordered set $\iB_1(\RR)$ of Baire class 1 functions endowed with the pointwise order, and investigate the order types of the linearly ordered subsets. Answering a question of Komj\'ath and…

Logic · Mathematics 2011-09-29 Márton Elekes , Juris Steprāns

We investigate the extent of second order characterizable structures by extending Shelah's Main Gap dichotomy to second order logic. For this end we consider a countable complete first order theory T. We show that all sufficiently large…

Logic · Mathematics 2012-08-28 Tapani Hyttinen , Kaisa Kangas , Jouko Väänänen

Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…

Algebraic Geometry · Mathematics 2025-09-03 Andreas Blatter , Jan Draisma , Filip Rupniewski

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

Logic · Mathematics 2021-11-02 Juvenal Murwanashyaka

The paper develops a general theory of orderability of quandles with a focus on link quandles of tame links and gives some general constructions of orderable quandles. We prove that knot quandles of many fibered prime knots are…

Geometric Topology · Mathematics 2025-10-17 Hitesh Raundal , Mahender Singh , Manpreet Singh

We study the existence and the distribution of "long" chains in the Weihrauch degrees, mostly focusing on chains with uncountable cofinality. We characterize when such chains have an upper bound and prove that there are no cofinal chains…

Logic · Mathematics 2026-05-07 Steffen Lempp , Alberto Marcone , Manlio Valenti

We study feebly compact shift-continuous $T_1$-topologies on the symmetric inverse semigroup $\mathscr{I}_\lambda^n$ of finite transformations of the rank $\leqslant n$. It is proved that such $T_1$-topology is sequentially pracompact if…

General Topology · Mathematics 2023-06-05 Oleg Gutik

We study how the existence in an algebraic lattice $L$ of a chain of a given type is reflected in the join-semilattice $K(L)$ of its compact elements. We show that for every chain $\alpha$ of size $\kappa$, there is a set $\B$ of at most…

Combinatorics · Mathematics 2008-12-12 Ilham Chakir , Maurice Pouzet

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…

Combinatorics · Mathematics 2008-12-15 Ilham Chakir , Maurice Pouzet

A structural condition is given for finite maximal antichains in the homomorphism order of relational structures to have the splitting property. It turns out that non-splitting antichains appear only at the bottom of the order. Moreover, we…

Combinatorics · Mathematics 2008-03-09 Jan Foniok , Jaroslav Nesetril

Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…

Logic in Computer Science · Computer Science 2018-05-10 Alexis Bès , Christian Choffrut