Related papers: Provable better quasi orders
Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…
It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…
A poset $P$ is said to satisfy the finite antichain condition, or FAC for short, if it has no infinite antichain. It was conjectured by Aharoni and Korman in 1992 that any FAC poset $P$ possesses a chain $C$ and a partition into antichains…
Let $P$ be a partial order on $[n] = \{1,2,\ldots,n\}$, $\mathbb{F}_{q}^n$ be the linear space of $n$-tuples over a finite field $\mathbb{F}_{q}$ and $w$ be a weight on $\mathbb{F}_{q}$. In this paper, we consider metrics on…
Characteristic earlier results were of the form CON$(2^{\aleph_0} \to [\lambda]^2_{n, 2})$, with $2^{\aleph_0} $ an ex-large cardinal, in the best case the first weakly Mahlo cardinal. Characteristic new results are CON$((2^{\aleph_0} =…
We show that perverse character varieties are (quasi-)affine. We do this in a purely stack-theoretic fashion, by exhibiting enough sections of the structure sheaf.
We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
We study the structure of the Rudin-Frolik order on countably complete ultrafilters under the assumption that this order is directed. This assumption, called the Ultrapower Axiom, holds in all known canonical inner models. It turns out that…
It is known that the set of all nonnegative integers may be equipped with a total order that is chaotic in the sense that there is no monotone three-term arithmetic progressions. Such chaotic order must be so complicated that the resulting…
We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…
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…
Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the…
We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…
Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…
In this work, new equivalences of topological statements and weaker axioms than ${\bf AC}$ are proven. This equivalences include the use of anti-properties. All this equivalences have been checked with a computer using the theorem proving…
We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our…
In the present paper we propose a new approach on `distributed systems': the processes are represented through total orders and the communications are characterized by means of biorders. The resulting distributed systems capture situations…
We propose a framework to build formal developments for robot networks using the COQ proof assistant, to state and to prove formally various properties. We focus in this paper on impossibility proofs, as it is natural to take advantage of…