English
Related papers

Related papers: On Countably Closed Complete Boolean Algebras

200 papers

We show that the Depth^+ of an ultraproduct of Boolean Algebras, can not jump over the Depth^+ of every component by more than one cardinality. We can have, consequently, similar results for the Depth invariant.

Logic · Mathematics 2018-02-06 Shimon Garti , Saharon Shelah

We give an example of a regular and complete subalgebra of a Cohen algebra which is not Cohen.

Logic · Mathematics 2008-02-03 Sabine Koppelberg , Saharon Shelah

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Logic · Mathematics 2021-09-21 Michael C. Laskowski , Douglas S. Ulrich

We show that the big Ramsey degree of the Boolean algebra with 3 atoms within the countable atomless Boolean algebra is infinite.

How many endomorphisms does a Boolean algebra have? Can we find Boolean algebras with as few endomorphisms as possible? Of course from any ultrafilter of the Boolean algebra we can define an endomorphism, and we can combine finitely many…

Logic · Mathematics 2011-05-20 Saharon Shelah

It is proved that the existence of a countable extremally disconnected Boolean topological group containing a family of open subgroups whose intersection has empty interior implies the existence of a rapid ultrafilter.

General Topology · Mathematics 2014-05-27 Ol'ga Sipacheva

A Boolean algebra carries a strictly positive exhaustive submeasure if and only if it has a sequential topology that is uniformly Frechet.

Logic · Mathematics 2017-05-03 Thomas Jech

For every regular cardinal kappa there exists a simple complete Boolean algebra with kappa generators.

Logic · Mathematics 2007-05-23 Thomas Jech , Saharon Shelah

We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…

Logic · Mathematics 2008-02-03 Saharon Shelah

We study the extent of countable saturation for coronas of abelian C*-algebras. In particular, we show that the corona algebra of $C_0(\bbR^n)$ is countably saturated if and only if $n=1$.

Logic · Mathematics 2022-06-09 Ilijas Farah , Alessandro Vignati

The Baire algebra of a topological space $X$ is the quotient of the algebra of all subsets of $X$ modulo the meager sets. We show that this Boolean algebra can be endowed with a natural closure operator, resulting in a closure algebra which…

Logic · Mathematics 2024-01-02 Guram Bezhanishvili , David Fernández-Duque

Given a complete Heyting algebra we construct an algebraic tensor triangulated category whose Bousfield lattice is the Booleanization of the given Heyting algebra. As a consequence we deduce that any complete Boolean algebra is the…

Category Theory · Mathematics 2017-07-21 Greg Stevenson

We characterise piecewise Boolean domains, that is, those domains that arise as Boolean subalgebras of a piecewise Boolean algebra. This leads to equivalent descriptions of the category of piecewise Boolean algebras: either as piecewise…

Logic in Computer Science · Computer Science 2014-07-15 Chris Heunen

We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…

Rings and Algebras · Mathematics 2011-05-31 Erhard Aichinger , Peter Mayr , Ralph McKenzie

Answering a question raised by V. V. Tkachuk, we present several examples of $\sigma$-compact spaces, some only consistent and some in ZFC, that are not countably tight but in which the closure of any discrete subset is countably tight. In…

General Topology · Mathematics 2024-11-08 István Juhász , Jan van Mill

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

Logic · Mathematics 2021-03-10 Nathanael Ackerman , Cameron Freer , Rehana Patel

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…

Operator Algebras · Mathematics 2016-05-06 Martino Lupini

The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model…

Logic · Mathematics 2018-11-08 Robert Goldblatt , Ian Hodkinson

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Logic · Mathematics 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

The noise-type completion C of a noise-type Boolean algebra B is generally not the same as the closure of B. As shown in Part I (Introduction, Theorem 2), C consists of all complemented elements of the closure. It appears that C is the…

Probability · Mathematics 2011-10-18 Boris Tsirelson