We investigate the structure of the lattice of clones on an infinite set X. We first observe that ultrafilters naturally induce clones; this yields a simple proof of Rosenberg’s theorem: there are $2^{2^{\lambda }}$ maximal (= “precomplete”) clones on a set of size λ. The clones we construct do not contain all unary functions. We then investigate clones that do contain all unary functions. Using a strong negative partition theorem from pcf theory we show that for cardinals λ (in particular, for all successors of...

We study the possibilities of constructing, in ZFC without any additional assumptions, strongly equivalent non-isomorphic trees of regular power. For example, we show that there are non-isomorphic trees of power ω₂ and of height ω · ω such that for all α < ω₁· ω · ω, E has a winning strategy in the Ehrenfeucht-Fraïssé game of length α. The main tool is the notion of a club-guessing sequence.

Shelah’s club-guessing and good points are used to show that the two-cardinal diamond principle ${◊}_{\kappa ,\lambda }$ holds for various values of $\kappa$ and $\lambda$.

We investigate the structure of the Tukey ordering among directed orders arising naturally in topology and measure theory.

We prove that if there exists a Cohen real over a model, then the family of perfect sets coded in the model has a disjoint refinement by perfect sets.

We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on ω₂ using finite conditions.

A structure $={(A;E_i)}_{i\in n}$ where each $E_i$ is an equivalence relation on A is called an n-grid if any two equivalence classes coming from distinct $E_i$’s intersect in a finite set. A function χ: A → n is an acceptable coloring if for all i ∈ n, the ${\chi }^{-1}\left(i\right)$ intersects each $E_i$-equivalence class in a finite set. If B is a set, then the n-cube Bⁿ may be seen as an n-grid, where the equivalence classes of $E_i$ are the lines parallel to the ith coordinate axis. We use elementary submodels of the universe to characterize those n-grids...

We study combinatorial principles we call the Homogeneity Principle HP(κ) and the Injectivity Principle IP(κ,λ) for regular κ > ℵ₁ and λ ≤ κ which are formulated in terms of coloring the ordinals < κ by reals. These principles are strengthenings of $C^s\left(\kappa \right)$ and $F^s\left(\kappa \right)$ of I. Juhász, L. Soukup and Z. Szentmiklóssy. Generalizing their results, we show e.g. that IP(ℵ₂,ℵ₁) (hence also IP(ℵ₂,ℵ₂) as well as HP(ℵ₂)) holds in a generic extension of a model of CH by Cohen forcing, and IP(ℵ₂,ℵ₂) (hence also HP(ℵ₂))...

This note is devoted to combinatorial properties of ideals on the set of natural numbers. By a result of Mathias, two such properties, selectivity and density, in the case of definable ideals, exclude each other. The purpose of this note is to measure the ``distance'' between them with the help of ultrafilter topologies of Louveau.

We characterize exactly the compactness properties of the product of κ copies of the space ω with the discrete topology. The characterization involves uniform ultrafilters, infinitary languages, and the existence of nonstandard elements in elementary extensions. We also have results involving products of possibly uncountable regular cardinals.

We prove that if there is a dominating family of size ℵ₁, then there are ℵ₁ many compact subsets of ${\omega }^{\omega }$ whose union is a maximal almost disjoint family of functions that is also maximal with respect to infinite partial functions.

We propose and study a “classification” of Borel ideals based on a natural infinite game involving a pair of ideals. The game induces a pre-order $⊑$ and the corresponding equivalence relation. The pre-order is well founded and “almost linear”. We concentrate on $F_{\sigma }$ and $F_{\sigma \delta }$ ideals. In particular, we show that all $F_{\sigma }$-ideals are $⊑$-equivalent and form the least equivalence class. There is also a least class of non-$F_{\sigma }$ Borel ideals, and there are at least two distinct classes of $F_{\sigma \delta }$ non-$F_{\sigma }$ ideals.

This is an expository paper about constructions of locally compact, Hausdorff, scattered spaces whose Cantor-Bendixson height has cardinality greater than their Cantor-Bendixson width.

A subset of a vector space is called countably convex if it is a countable union of convex sets. Classification of countably convex subsets of topological vector spaces is addressed in this paper. An ordinal-valued rank function ϱ is introduced to measure the complexity of local nonconvexity points in subsets of topological vector spaces. Then ϱ is used to give a necessary and sufficient condition for countable convexity of closed sets. Theorem. Suppose that S is a closed subset of a Polish linear...

The following theorem is proved, answering a question raised by Davies in 1963. If $L_0\cup L_1\cup L_2\cup ...$ is a partition of the set of lines of ${ℝ}^n$, then there is a partition ${ℝ}^n=S_0\cup S_1\cup S_2\cup ...$ such that $|\ell \cap S_i|\le 2$ whenever $\ell \in L_i$. There are generalizations to some other, higher-dimensional subspaces, improving recent results of Erdős, Jackson Mauldin.

For any three noncollinear points c₀,c₁,c₂ ∈ ℝ², there are sprays S₀,S₁,S₂ centered at c₀,c₁,c₂ that cover ℝ². This improves the result of de la Vega in which c₀,c₁,c₂ were required to be the vertices of an equilateral triangle.