In [1, p. 51] A. V. Arhangel'skiĭ, in connection with the problems of L-spaces and S-spaces, examined further the notions of hereditary separability and hereditary Lindelöfness. In particular he considered the following property P: “Every regular topological space has a countable net weight provided its countable product is hereditarily Lindelöf and hereditarily separable.” He noticed that the continuum hypothesis implies negation of the property P and posed a question: “Do Martin's Axiom and the negation of the continuum hypothesis imply P?” The purpose of this paper is to give a negative answer to this question.

The set-theoretical and topological notation that we use is standard and can be found in [6] and [5] respectively.

Throughout the paper we will use the notation H(X, Y) to denote the set of all finite functions from a set X to Y.

Theorem. Con(ZFC) → Con(ZFC + MA + ¬CH + there exists a 0-dimensional Hausdorff space X such that nw(X) = с and nw(Y) = ω for any Y ϵ [X]<с).

Proof. Let M be a model of ZFC satisfying CH and let F be an M-generic filter over the Cohen forcing {H(ω2 × ω2, 2), ⊃). Then f = ⋃F is a function and f: ω2 × ω2 → 2.

This paper is concerned with the combinator representation of numeral systems with logarithmic space complexity of symbols. The principle used is based on the lexicographic ordering of words over a finite alphabet.

We prove that if V = L then there is a maximal orthogonal (i.e., mutually singular) set of measures on Cantor space. This provides a natural counterpoint to the well-known theorem of Preiss and Rataj [16] that no analytic set of measures can be maximal orthogonal.

This paper provides a Bishop-style constructive analysis of the contrapositive of the statement that a continuous homomorphism of R onto a compact abelian group is periodic. It is shown that, subject to a weak locatedness hypothesis, if G is a complete (metric) abelian group that is the range of a continuous isomorphism from R, then G is noncompact. A special case occurs when G satisfies a certain local path-connectedness condition at 0. A number of results about one-one and injective mappings are proved en route to the main theorem. A Brouwerian example shows that some of our results are the best possible in a constructive framework.

In this paper, constructions of free ordered algebras on one generator are given that correspond to some one-variable fragments of affine propositional classical logic and their extensions with n-contraction (n ≥ 2). Moreover, embeddings of the already known infinite free structures into the algebras introduced below are furnished with; thus, solving along the respective cardinality problems.

Throughout the paper A will be a transitive set closed under finite subsets and the formulas in various classes mentioned are allowed to contain parameters from A (or from B in §2).

By use of a refinement of Moschovakis' notion of the game-quantifier [13], [14], [15] we are able to obtain a game-theoretic description of s-Π11 predicates over countable sets which then leads to a classification of positive Σ1 inductive sets.

Similar results are then proved for certain sets of cofinality ω. As a consequence we obtain the compactness results of Green [8], [11], Nyberg [16] and Makkai [12].

The use of games to classify inductive sets was initiated by Moschovakis [13], [14], [15] and has been extended to Q-inductive sets by Aczel [2]. Games were also used in a slightly different setting by Vaught [18] and Makkai [12]. In fact, Vaught's proof of the compactness theorem is very close to our proof in §1 and Makkai's extension to cofinality ω sets uses a result similar to Theorem 3 in §2.

We are indebted to the referee for many helpful suggestions, in particular, for bringing to our attention the related works of Vaught and Makkai cited above.