We prove that every chainable continuum can be mapped into a dendroid such that all point-inverses consist of at most three points. In particular, it follows that there exists a finite-to-one map from a hereditarily indecomposable continuum (the pseudoarc) onto hereditarily decomposable continuum. This answers a question by J. Krasinkiewicz.

The main purpose of this paper is to study the weight under hereditarily irreducible mappings between continua. The main result states that if f : X → Y is an hereditarily irreducible and surjective mapping of a D-continuum X, then w(X) = w(Y ).

In this paper we examine the role of the β-space property (equivalently of the MCM-property) in generalized ordered (GO-)spaces and, more generally, in monotonically normal spaces. We show that a GO-space is metrizable iff it is a β-space with a Gδ-diagonal and iff it is a quasidevelopable β-space. That last assertion is a corollary of a general theorem that any β-space with a σ-point-finite ba...

We give a combinatorial equivalent to the existence of a non-free hereditarily separable group of cardinality א1. This can be used, together with a known combinatorial equivalent of the existence of a non-free Whitehead group, to prove that it is consistent that every Whitehead group is free but not every hereditarily separable group is free. We also show that the fact that Z is a p.i.d. with i...

Prolog’s ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranking and unranking functions. Starting from a generalization of Ackerman’s encoding of Hereditarily Finite Sets with Urelements and a novel tupling/untupling operation, we derive encodings for Finite Functions and use them a...