English
Related papers

Related papers: A Proof of the Schr\"oder-Bernstein Theorem in ACL…

200 papers

The shuffle of a non-empty countable set $ S $ of linear orders is the (unique up to isomorphism) linear order $ \Xi(S) $ obtained by fixing a coloring function $ \chi: \mathbb{Q} \to S $ having fibers dense in $ \mathbb{Q} $ and replacing…

Logic · Mathematics 2024-11-19 Suyash Srivastava , Mihir Mittal

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…

Logic · Mathematics 2007-05-23 John Goodrick

Write A<=B if there is an injection from A to B, and A==B if there is a bijection. We give a simple proof that for finite n, nA<=nB implies A<=B. From the Cantor-Bernstein theorem it then follows that nA==nB implies A==B. These results have…

Logic · Mathematics 2015-04-08 Peter G. Doyle , Cecil Qiu

The Myhill isomorphism is a variant of the Cantor-Bernstein theorem. It states that, from two injections that reduces two subsets of $\mathbb{N}$ to each other, there exists a bijection $\mathbb{N} \to \mathbb{N}$ that preserves them. This…

Logic · Mathematics 2025-07-08 Cécilia Pradic

Sklar's theorem is an important tool that connects bidimensional distribution functions with their marginals by means of a copula. When there is imprecision about the marginals, we can model the available information by means of p-boxes,…

Probability · Mathematics 2016-01-12 Ignacio Montes , Enrique Miranda , Renato Pelessoni , Paolo Vicig

Schur's Theorem and its generalisation, Baer's Theorem, are distinguished results in group theory, connecting the upper central quotients with the lower central series. The aim of this paper is to generalise these results in two different…

Group Theory · Mathematics 2020-12-22 Guram Donadze , Xabier García-Martínez

We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results,…

Combinatorics · Mathematics 2007-09-11 Sylvie Corteel , Jeremy Lovejoy

We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…

Combinatorics · Mathematics 2007-05-23 Rekha Natarajan

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

Formal Languages and Automata Theory · Computer Science 2009-07-06 M. Rigo , L. Waxweiler

A first-order theory T has the Schr\"oder-Bernstein (SB) property if any pair of elementarily bi-embeddable models are isomorphic. We prove that T has an expansion by constants that has the SB property if and only if T is superstable and…

Logic · Mathematics 2012-04-17 John Goodrick , Michael C. Laskowski

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…

Combinatorics · Mathematics 2015-09-25 Istvan Tomon

We prove that, for every cardinal number $\alpha\geq {\mathfrak c}$, there exists a metrizable space $X$ with $|X|=\alpha$ such that for every pair of quasiorders $\leq_1$, $\leq_2$ on a set $Q$ with $|Q| \leq \alpha$ satisfying the…

General Topology · Mathematics 2007-05-23 Vera Trnkova

The consistency of a second-order version of a theorem of Morley on the number of countable models was proved in arXiv:2107.07636 with the aid of large cardinals. We here dispense with them.

Logic · Mathematics 2024-01-22 Franklin D. Tall , Jing Zhang

We prove in constructive logic that the statement of the Cantor-Bernstein theorem implies excluded middle. This establishes that the Cantor-Bernstein theorem can only be proven assuming the full power of classical logic. The key ingredient…

Logic · Mathematics 2023-03-24 Cécilia Pradic , Chad E. Brown

A proper merging of two disjoint quasi-ordered sets $P$ and $Q$ is a quasi-order on the union of $P$ and $Q$ such that the restriction to $P$ and $Q$ yields the original quasi-order again and such that no elements of $P$ and $Q$ are…

Combinatorics · Mathematics 2016-07-27 Henri Mühle

A set system F is intersecting if any pair of sets in F have a nonempty intersection. A fundamental theorem of Erd\H{o}s, Ko and Rado states that if F is an intersecting family of r-subsets of [n]={1,...,n}, and n>= 2r, then the cardinality…

Combinatorics · Mathematics 2017-10-18 Glenn Hurlbert , Vikram Kamat

A classic result due to Bernstein states that in set theory with classical logic, but without the axiom of choice, for all sets $X$ and $Y$, if $X \times 2 \cong Y \times 2$ then also $X \cong Y$. We show that this cannot be done in…

Logic · Mathematics 2018-04-13 Andrew Swan

We establish a bijective correspondence between certain non-self-intersecting curves in an $n$-punctured disc and positive ${\mathbf c}$-vectors of acyclic cluster algebras whose quivers have multiple arrows between every pair of vertices.…

Combinatorics · Mathematics 2019-10-25 Anna Felikson , Pavel Tumarkin

In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In…

Logic · Mathematics 2026-05-26 Shuwei Wang

In this paper, methods of second order and higher order reverse mathematics are applied to versions of a theorem of Banach that extends the Schroeder-Bernstein theorem. Some additional results address statements in higher order arithmetic…

Logic · Mathematics 2023-11-15 Jeffry L. Hirst , Carl Mummert
‹ Prev 1 2 3 10 Next ›