English
Related papers

Related papers: Semi-Cohen Boolean algebras

200 papers

We show that there are semi-Cohen Boolean algebras which cannot be completely embedded into Cohen Boolean algebras. Using the ideas from this proof, we give a simpler argument for a theorem of S. Koppelberg and S. Shelah, stating that there…

Logic · Mathematics 2008-02-03 Jindřich Zapletal

Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…

Logic · Mathematics 2025-10-28 Xiaohao Liu , Heyan Wang , Wenjuan Chen

The feeling that those two forcing notions-Cohen and Random-(equivalently the corresponding Boolean algebras Borel(R)/(meager sets), Borel(R)/(null sets)) are special, was probably old and widespread. A reasonable interpretation is to show…

Logic · Mathematics 2016-09-06 Saharon Shelah

We introduce quantum Boolean algebras which are the analogue of the Weyl algebras for Boolean affine spaces. We study quantum Boolean algebras from the logical and set theoretical viewpoints.

Quantum Algebra · Mathematics 2017-11-10 Rafael Diaz

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 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

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Ciraulo , Michele Contente

These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…

Logic · Mathematics 2014-02-10 Matteo Viale , Giorgio Audrito , Silvia Steila

We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras.…

Logic in Computer Science · Computer Science 2007-05-23 Riccardo Pucella

It is shown that there exists a complete, atomless, sigma-centered Boolean algebra, which does not contain any regular countable subalgebra if and only if there exist a nowhere dense ultrafilter. Therefore the existence of such algebras is…

Logic · Mathematics 2016-09-07 Aleksander Błaszczyk , Saharon Shelah

Given a partially ordered set $P$ there exists the most general Boolean algebra $F(P)$ which contains $P$ as a generating set, called the {\it free Boolean algebra} over $P$. We study free Boolean algebras over posets of the form $P=P_0\cup…

General Topology · Mathematics 2012-10-23 Robert Bonnet , Latifa Faouzi , Wiesław Kubiś

We describe right-hand skew Boolean algebras in terms of a class of presheaves of sets over Boolean algebras called Boolean sets, and prove a duality theorem between Boolean sets and etale spaces over Boolean spaces.

Category Theory · Mathematics 2013-03-26 Ganna Kudryavtseva , Mark V Lawson

Scaled Boolean algebras are a category of mathematical objects that arose from attempts to understand why the conventional rules of probability should hold when probabilities are construed, not as frequencies or proportions or the like, but…

Probability · Mathematics 2009-09-29 Michael Hardy

A general notion of a quasi-finite algebra is introduced as an algebra graded by the set of all integers equipped with topologies on the homogeneous subspaces satisfying certain properties. An analogue of the regular bimodule is introduced…

Quantum Algebra · Mathematics 2007-05-23 Atsushi Matsuo , Kiyokazu Nagatomo , Akihiro Tsuchiya

For suitable groups G we will show that one can add a Boolean algebra B by forcing in such a way that Aut(B) is almost isomorphic to G. In particular, we will give a positive answer to the following question due to J.Roitman: Is…

Logic · Mathematics 2007-05-23 Tapani Hyttinen , Saharon Shelah

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 study equations over boolean algebras with distinguished elements. We prove the criteria, when a boolean algebra is equationally Noetherian, weakly equationally Noetherian, $\mathbf{q}_\omega$-compact or $\mathbf{u}_\omega$-compact. Also…

Rings and Algebras · Mathematics 2013-05-30 Artem N. Shevlyakov

Abstractly, the generic extensions after $\aleph_\omega$-many Cohen reals and $\aleph_{\omega+1}$-many Cohen reals must be different for reasons of uniform density the relevant Boolean algebras. Nevertheless this is not satisfying and it…

Logic · Mathematics 2025-11-26 Pedro Marun , Saharon Shelah , Corey Bacal Switzer

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

Rings and Algebras · Mathematics 2011-02-23 Tamás Waldhauser

The oracle c.c.c. is closely related to Cohen forcing. During an iteration we can ``omit a type''; i.e. preserve ``the intersection of a given family of Borel sets of reals is empty'' provided that Cohen forcing satisfies it. We generalize…

Logic · Mathematics 2007-05-23 Saharon Shelah
‹ Prev 1 2 3 10 Next ›