Lawless order

R. Baer asked whether the group operation of every (totally) ordered group can be redefined, keeping the same ordered set, so that the resulting structure is an Abelian ordered group. The answer is no. We construct an ordered set (G, ) which carries an ordered group (G, , ) but which islawless in the following sense. If (G, *, ) is an ordered group on the same carrier (G, ), then the group (G, *) satisfies no nontrivial equational law.Research partially supported by NSERC of Canada Grants #A4044 and A3040.Research partially supported by NSERC of Canada Grant #U0075.Research partially supported by a grant from the BSF.     

On mappings of \mathbb{Q}^d to \mathbb{Q}^d that preserve distances 1 and \sqrt 2 and the Beckman-Quarles Theorem

Benz proved that every mapping that preserves the distances 1 and 2 is an isometry, provided d ≥ 5. We prove that every mapping that preserves the distances 1 and is an isometry, provided d ≥ 5.     

A cofinal coloring theorem for partially ordered algebras

If P is a directed partially ordered algebra of an appropriate sort-e.g. an upper semilattice-and has no maximal element, then P has two disjoint subalgebras each cofinal in P. In fact, if P has cofinality then there exists a family of such disjoint subalgebras. A version of this result is also proved without the directedness assumption, in which the cofinality of P is replaced by an invariant which we call its global cofinality.This work was done while the first author was partly supported by NSF contract MCS 82-02632.     

Lattice-theoretic properties of algebras of logic

In the theory of lattice-ordered groups, there are interesting examples of properties — such as projectability — that are defined in terms of the overall structure of the lattice-ordered group, but are entirely determined by the underlying lattice structure. In this paper, we explore the extent to which projectability is a lattice-theoretic property for more general classes of algebras of logic. For a class of integral residuated lattices that includes Heyting algebras and semi-linear residuated lattices, we prove that a member of such is projectable iff the order dual of each subinterval [a,1]$[a,1]$ is a Stone lattice. We also show that an integral GMV algebra is projectable iff it can be endowed with a positive Gödel implication. In particular, a ΨMV or an MV algebra is projectable iff it can be endowed with a Gödel implication. Moreover, those projectable involutive residuated lattices that admit a Gödel implication are investigated as a variety in the expanded signature. We establish that this variety is generated by its totally ordered members and is a discriminator variety.     

Almost disjoint large subsets of semigroups

There are several notions of largeness in a semigroup S that originated in topological dynamics. Among these are thick, central, syndetic and piecewise syndetic. Of these, central sets are especially interesting because they are partition regular and are guaranteed to contain substantial combinatorial structure. It is known that in (N,+) any central set may be partitioned into infinitely many pairwise disjoint central sets. We extend this result to a large class of semigroups (including (N,+)) by showing that if S is a semigroup in this class which has cardinality κ then any central set can be partitioned into κ many pairwise disjoint central sets. We also show that for this same class of semigroups, if there exists a collection of μ almost disjoint subsets of any member S, then any central subset of S contains a collection of μ almost disjoint central sets. The same statement applies if “central” is replaced by “thick”; and in the case that the semigroup is left cancellative, “central” may be replaced by “piecewise syndetic”. The situation with respect to syndetic sets is much more restrictive. For example, there does not exist an uncountable collection of almost disjoint syndetic subsets of N. We investigate the extent to which syndetic sets can be split into disjoint syndetic sets.     

Ordered groups with a conucleus

Our work proposes a new paradigm for the study of various classes of cancellative residuated lattices by viewing these structures as lattice-ordered groups with a suitable operator (a conucleus). One consequence of our approach is the categorical equivalence between the variety of cancellative commutative residuated lattices and the category of abelian lattice-ordered groups endowed with a conucleus whose image generates the underlying group of the lattice-ordered group. In addition, we extend our methods to obtain a categorical equivalence between -algebras and product algebras with a conucleus. Among the other results of the paper, we single out the introduction of a categorical framework for making precise the view that some of the most interesting algebras arising in algebraic logic are related to lattice-ordered groups. More specifically, we show that these algebras are subobjects and quotients of lattice-ordered groups in a “quantale like” category of algebras.     

Atomic Decomposition of a Weighted Inductive Limit in \mathbb{C}^{n}

We construct an atomic decomposition of the space H_V^∞ consisting of analytic functions on the open unit disc. The research of the second named author was supported by the Academy of Finland project “Functional Analysis and Applications”.     

On minimal non-potentially closed subsets of the plane

We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions. We show the existence of a perfect antichain made of minimal sets among non-potentially closed sets. We apply this result to graphs, quasi-orders and partial orders. We also give a non-potentially closed set minimum for another notion of comparison. Finally, we show that we cannot have injectivity in the Kechris-Solecki-Todor?evi? dichotomy about analytic graphs.     

THOUGHTS ON THE CANTOR-BERNSTEIN THEOREM

The usual proofs of the well-known set-theoretical theorem “Given one-one maps f: A → B and g:B → A, there exists a one-one onto map h:A → B” actually produce a map h:A → B contained in the relation f U g^?1. Considering Tarski's Fixpoint Theorem as the implicit basic ingredient of such proofs. We examine several classical proofs/starting with Dedekind (1887), and illuminate their common feature by means of the categorical notion of a natural fixpoint. We consider a categorical form (CBT) of the theorem (with h ? f Ug^?1) in a variety of contexts, obtaining some examples of categories where CBT holds and others where it fails. Among other results we prove for a topos E, (1) CBT holds if E is Boolean, and conversely if E has a natural number object; (2) The Axiom of Choice in E implies a dual version of CBTI and conversely if E has splitting supports and a natural number object.     

Identities of cofinal sublattices

If V is a variety of lattices and L a free lattice in V on uncountably many generators, then any cofinal sublattice of L generates all of V. On the other hand, any modular lattice without chains of order-type +1 has a cofinal distributive sublattice. More generally, if a modular lattice L has a distributive sublattice which is cofinal modulo intervals with ACC, this may be enlarged to a cofinal distributive sublattice. Examples are given showing that these existence results are sharp in several ways. Some similar results and questions on existence of cofinal sublattices with DCC are noted.This work was done while the first author was partly supported by NSF contract MCS 82-02632, and the second author by an NSF Graduate Fellowship.     

Comparison of Boolean algebras

In this work, some results related to superatomic Boolean interval algebras are presented, and proved in a topological way. Let x be an uncountable cardinal. To each I x, we can associate a superatomic interval Boolean algebra B _I of cardinality x in such a way that the following properties are equivalent: (i) I I x, (ii) B _I is a quotient algebra of B _J, and (iii) there is an homomorphism f from B _J into B _I such that for every atom b of B _I, there is an atom a of B _J satisfying f(a)=b. As a corollary, there are 2 ^x isomorphism types of superatomic interval Boolean algebras of cardinality x. This case is quite different from the countable one.     

On ηα-groups and fields

Let :=. The following are known: two -sets of power are isomorphic. Let >0. Two ordered divisible Abelian groups that are -sets of power are isomorphic, two real closed fields that are -sets of power are isomorphic. The following is shown: (1) there exist 2 nonisomorphic ordered Abelian groups (respectively ordered fields) that are -sets of power ; (2) there exist 2 nonisomorphic ordered divisible Abelian groups (respectively real closed fields) of power all having the same order type; (3) there exist 2 nonisomorphic ordered divisible Abelian groups (respectively real closed fields) that are -sets having the same order type.     

Models of expansions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathbb N}$\end{document} with no end extensions

We deal with models of Peano arithmetic (specifically with a question of Ali Enayat). The methods are from creature forcing. We find an expansion of ${\mathbb N}$ such that its theory has models with no (elementary) end extensions. In fact there is a Borel uncountable set of subsets of ${\mathbb N}$ such that expanding ${\mathbb N}$ by any uncountably many of them suffice. Also we find arithmetically closed ${\mathcal A}$ with no ultrafilter on it with suitable definability demand (related to being Ramsey). © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Universality of Embeddability Relations for Coloured Total Orders

Some examples of Σ₁ ¹-universal preorders are presented, in the form of various relations of embeddability between countable coloured total orders. As an application, strengthening a theorem of (Marcone, A. and Rosendal, C.: The Complexity of Continuous Embeddability between Dendrites, J. Symb. Log. 69 (2004), 663–673), the Σ₁ ¹-universality of continuous embeddability for dendrites whose branch points have order 3 is obtained.     

Lexicographically ordered trees

We characterize trees whose lexicographic ordering produces an order isomorphic copy of some sets of real numbers, or an order isomorphic copy of some set of ordinal numbers. We characterize trees whose lexicographic ordering is order complete, and we investigate lexicographically ordered ω-splitting trees that, under the open-interval topology of their lexicographic orders, are of the first Baire category. Finally we collect together some folklore results about the relation between Aronszajn trees and Aronszajn lines, and use earlier results of the paper to deduce some topological properties of Aronszajn lines.     

Possible size of an ultrapower of \omega

Let be the first infinite ordinal (or the set of all natural numbers) with the usual order . In § 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of , whose cardinality is (1) a singular strong limit cardinal, (2) a strongly inaccessible cardinal. This answers two questions in [1], modulo the assumption of supercompactness. In § 2 we construct several -Archimedean ultrapowers of under some large cardinal assumptions. For example, we show that, assuming the consistency of a measurable cardinal, there may exist a -Archimedean ultrapower of for some uncountable cardinal . This answers a question in [8], modulo the assumption of measurability. Received: 19 November 1996     

Invariant metrics and the boundary behavior of holomorphic functions on domains in\mathbb{C}^n

Invariant metrics are used to provide a unified approach to the study of holomorphic functions in Hardy classes on domains in one and several complex variables. Both approach regions and boundary measures are constructed from the metric. Examples are provided to show how diverse theories can be unified with this approach. The Hartogs extension phenomenon and Fatou’s theorem are seen to be two aspects of the same circle of ideas. Author supported in part by a grant from the National Science Foundation     

Cancellation and absorption of lexicographic powers of totally ordered Abelian groups

Let G and H be totally ordered Abelian groups such that, for some integer k, the lexicographic powers G ^k and H ^k are isomorphic (as ordered groups). It was proved by F. Oger that G and H need not be isomorphic. We show here that they are whenever G is either divisible or ₁ -saturated (and in a few more cases). Our proof relies on a general technique which we also use to prove that G and H must be elementary equivalent as ordered groups (a fact also proved by F. Delon and F. Lucas) and isomorphic as chains. The same technique applies to the question of whether G and H should be isomorphic as groups, but, in this last case, no hint about a possible negative answer seems available.