The boolean-algebras tag has no usage guidance.

**4**

votes

**2**answers

271 views

### About a construction of Borel $\sigma$-algebra associated to a lattice

Let $(\mathcal{A}, \cup, \cap)$ a lattice (with minimum and maximum elements $\bot$ and $\top$).
Let $X\subset \mathcal{A}$ a generator set (a set of minimal cardinality that generate $\mathcal{A}$ i....

**16**

votes

**0**answers

738 views

### Which complete Boolean algebras arise as the algebras of projections of commutative von Neumann algebras?

Projections in an arbitrary commutative von Neumann algebra form a complete Boolean algebra.
Moreover, a morphism of commutative von Neumann algebras induces
a continuous morphism of the corresponding ...

**12**

votes

**0**answers

245 views

### The dominating number $\mathfrak{d}$ and convergent sequences

All spaces considered below are compact Hausdorff.
If $K$ is a space, then $w(K)$ is its weight. For a Boolean algebra $\mathcal{A}$, $K_\mathcal{A}$ denotes its Stone space. I am interested in ...

**10**

votes

**0**answers

428 views

### Existence of a regular subposet which collapses everything except the top cardinal

Suppose $\delta$ is an inaccessible cardinal, and $\mathbb{P}$ is the Levy Collapse $\text{Col}(\kappa, \delta)$ which adds a surjection from $\kappa \to \delta$ (for some regular $\kappa < \delta$)...

**8**

votes

**0**answers

571 views

### Full conditional probabilities and versions of AC?

A probability is a finitely additive measure on a boolean algebra with total measure $1$.
A function $P:\scr B \times (\scr B - \{ 0 \})$ is a full conditional probability on $\scr B$ (for a boolean ...

**6**

votes

**0**answers

164 views

### rigidity of $\mathcal P(\omega_1) / NS$ under MA

In Woodin's book, Lemma 5.100 asserts that if $MA_{\omega_1}$ holds and there is an $\omega_2$-saturated ideal $I$ on $\omega_1$, then $\mathcal P(\omega_1)/I$ is a rigid boolean algebra, meaning it ...

**6**

votes

**0**answers

403 views

### Order theory as a foundation of mathematics?

I know the followings kinds of formalization of mathematics:
based on set theory (e.g. ZFC)
based on type theory (e.g. the formalism of Coq proof assistant, as an advanced example)
based on category ...

**6**

votes

**0**answers

234 views

### Counting Copies of a BA within a BA: Arbitrarily Many versus Infinitely Many

Informally, I am wondering if a Boolean algebra $\mathcal{B}$ contains infinitely many disjoint copies of a Boolean algebra $\mathcal{A}$ whenever it contains arbitrarily many disjoint copies of $\...

**3**

votes

**0**answers

110 views

### Find the number of boolean functions of n variable that satisfy the following condition

For how many boolean functions is this true? The length of the shortest disjunctive normal form of that functions is equal to 2^(n-1). And the the number of variable entries in the minimal dnf of that ...

**3**

votes

**0**answers

191 views

### What algebraic identities does the iteration of forcing operation satisfy?

Let $G$ be the set of all formulas $\phi(x)$ in the language of such that $ZFC\vdash\exists x\phi(x)$ exists, $ZFC\vdash\phi(x)\rightarrow``x\,\textrm{is a complete Boolean algebra}"$, $ZFC\vdash``\...

**2**

votes

**0**answers

56 views

### Effective “almost enumeration” of monotone boolean functions

Denote by $\mathcal{M}(n)$ the set of all monotone functions $\{0,1\}^n \to \{0,1\}$.
Can $\mathcal{M}(n)$ be represented as $\mathcal{M}(n) = \{ f(t) | t\in \{0,1\}^k \}$ such that:
1) $k = \log |\...

**1**

vote

**0**answers

47 views

### Dual equivalence for multioperators

This is a reference request question. But let's start with a few definitions.
Let $L$ and $M$ be two bounded lattices. A multioperator $p$ for $L$ and $M$ is an application $$p : L \to Ft(M)^{op}$$ ...

**1**

vote

**0**answers

44 views

### Influence of independent variables on boolean functions?

Suppose a simple connected graph $G$ where its vertices are assumed to be independent. An event with uncertainty corresponds to each vertex. My instructor guides me that even though the vertices (...

**1**

vote

**0**answers

44 views

### Embedding a collection of finite subsets efficiently

Are there any general non-trivial methods for solving the following problem?
Suppose one has a collection of subsets $\mathcal{C} \subseteq \mathcal{P}\mathcal{P}\{1,\dots,n\}$. They may be viewed ...

**1**

vote

**0**answers

186 views

### Wolfram's axiom completeness

I have been reading Wolfram's A New Kind of Science, and as I was reading the section on systems of logic and axioms, I came across this axiom, for which all of the normal axioms of Boolean logic can ...

**1**

vote

**0**answers

139 views

### Can random elements be defined in terms of a measure algebra?

Let $(\Omega,\Sigma,\mu)$ be a probability space, $(X,\mathcal{X})$ be a measurable space and $R(\Omega,X)$ be the set of equivalence classes of measurable functions from $\Omega$ to $X$ under almost ...

**1**

vote

**0**answers

218 views

### Defining filters in closure algebras: reference request

A closure algebra C is a boolean algebra B together with a unary closure operator, and additional axioms, the Kuratowski axioms, that the closure operator must satisfy. (The Wikipedia article prefers ...

**0**

votes

**0**answers

34 views

### How to convert an expression to conjunctive normal form for Maximum-2-satisfiability?

I have a simplified Boolean expression almost ripe for maximum-2-satisfiability:
$(A\lor \neg B)\land(A\land C)\land(D\lor \neg A)$
In other words, I want to find the assignment of variables so that ...