Page 1

Displaying 1 – 3 of 3

Showing per page

Making factorizations compositive

Reinhard Börger (1991)

Commentationes Mathematicae Universitatis Carolinae

The main aim of this paper is to obtain compositive cone factorizations from non-compositive ones by itereration. This is possible if and only if certain colimits of (possibly large) chains exist. In particular, we show that (strong-epi, mono) factorizations of cones exist if and only if joint coequalizers and colimits of chains of regular epimorphisms exist.

Maximal free sequences in a Boolean algebra

J. D. Monk (2011)

Commentationes Mathematicae Universitatis Carolinae

We study free sequences and related notions on Boolean algebras. A free sequence on a BA A is a sequence a ξ : ξ < α of elements of A , with α an ordinal, such that for all F , G [ α ] < ω with F < G we have ξ F a ξ · ξ G - a ξ 0 . A free sequence of length α exists iff the Stone space Ult ( A ) has a free sequence of length α in the topological sense. A free sequence is maximal iff it cannot be extended at the end to a longer free sequence. The main notions studied here are the spectrum function 𝔣 sp ( A ) = { | α | : A has an infinite maximal free sequence of length α } and the associated min-max function 𝔣 ( A ) = min ( 𝔣 sp ( A ) ) . Among the results...

Currently displaying 1 – 3 of 3

Page 1