Related papers: Reversible Sequences of Cardinals, Reversible Equi…

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…

Let kappa be an uncountable regular cardinal. Call an equivalence relation on functions from kappa into 2 Sigma_1^1-definable over H(kappa) if there is a first order sentence F and a parameter R subseteq H(kappa) such that functions…

This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of the…

We deal with germs of diffeomorphisms that are reversible under an involution. We establish that this condition implies that, in general, both the family of reversing symmetries and the group of symmetries are not finite, in contrast with…

For a strongly inacessible cardinal $\kappa$, we investigate the relationships between the following ideals: - the ideal of meager sets in the ${<}\kappa$-box product topology - the ideal of "null" sets in the sense of [Sh:1004]…

Let lambda be aleph_0 or a strong limit of cofinality aleph_0. Suppose that (G_m,p_{m,n}:m =< n<omega) and (H_m,p^t_{m,n}: m=< n < omega) are projective systems of groups of cardinality less than lambda and suppose that for every n<omega…

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…

We investigate possible cardinalities of maximal antichains in the poset of copies $\langle \mathbb P(\mathbb X),\subset \rangle$ of a countable ultrahomogeneous relational structure $\mathbb X$. It turns out that if the age of $\mathbb X$…

We prove that the homeomorphism relation between compact spaces can be continuously reduced to the homeomorphism equivalence relation between absolute retracts which strengthens and simplifies recent results of Chang and Gao, and Cie\'sla.…

An orthoset is a non-empty set together with a symmetric and irreflexive binary relation $\perp$, called the orthogonality relation. An orthoset with 0 is an orthoset augmented with an additional element 0, called falsity, which is…

Given any $\lambda\leq\kappa$, we construct a symmetric extension in which there is a set $X$ such that $\aleph(X)=\lambda$ and $\aleph^*(X)=\kappa$. Consequently, we show that $\mathsf{ZF}+$"For all pairs of infinite cardinals…

F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

A basic question concerning indecomposable Soergel bimodules is to understand their endomorphism rings. In characteristic zero all degree-zero endomorphisms are isomorphisms (a fact proved by Elias and the second author) which implies the…

We examine properties of generic automorphisms of the random poset, with the goal of explicitly characterizing them. We associate to each automorphism an auxiliary first-order structure, consisting of the random poset equipped with an…

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…