The lattice of subvarieties of the biregularization of the variety of Boolean algebras

Jerzy Płonka

Displaying similar documents to “The lattice of subvarieties of the biregularization of the variety of Boolean algebras”

$\forall_{n}$ -theories of Boolean algebras

Jan Waszkiewicz (1974)

Colloquium Mathematicae

Similarity:

Boolean algebras, splitting theorems, and $Δ_{2}^{0}$ sets

Michael Morley, Robert Soare (1975)

Fundamenta Mathematicae

Similarity:

Minimal generics from subvarieties of the clone extension of the variety of Boolean algebras

Jerzy Płonka (2008)

Colloquium Mathematicae

Similarity:

Let τ be a type of algebras without nullary fundamental operation symbols. We call an identity φ ≈ ψ of type τ clone compatible if φ and ψ are the same variable or the sets of fundamental operation symbols in φ and ψ are nonempty and identical. For a variety of type τ we denote by $^{c}$ the variety of type τ defined by all clone compatible identities from Id(). We call $^{c}$ the clone extension of . In this paper we describe algebras and minimal generics of all subvarieties of $^{c}$ , where is the...

Generalised irredundance in graphs: Nordhaus-Gaddum bounds

Ernest J. Cockayne, Stephen Finbow (2004)

Discussiones Mathematicae Graph Theory

Similarity:

For each vertex s of the vertex subset S of a simple graph G, we define Boolean variables p = p(s,S), q = q(s,S) and r = r(s,S) which measure existence of three kinds of S-private neighbours (S-pns) of s. A 3-variable Boolean function f = f(p,q,r) may be considered as a compound existence property of S-pns. The subset S is called an f-set of G if f = 1 for all s ∈ S and the class of f-sets of G is denoted by $Ω_{f} (G)$ . Only 64 Boolean functions f can produce different classes $Ω_{f} (G)$ , special cases...

Orthogonality and complementation in the lattice of subspaces of a finite vector space

Ivan Chajda, Helmut Länger (2022)

Mathematica Bohemica

Similarity:

We investigate the lattice $𝐋 (𝐕)$ of subspaces of an $m$ -dimensional vector space $𝐕$ over a finite field $GF (q)$ with a prime power $q = p^{n}$ together with the unary operation of orthogonality. It is well-known that this lattice is modular and that the orthogonality is an antitone involution. The lattice $𝐋 (𝐕)$ satisfies the chain condition and we determine the number of covers of its elements, especially the number of its atoms. We characterize when orthogonality is a complementation and hence when $𝐋 (𝐕)$ is orthomodular....

Linear preserver of $n \times 1$ Ferrers vectors

Leila Fazlpar, Ali Armandnejad (2023)

Czechoslovak Mathematical Journal

Similarity:

Let $A = {[a_{i j}]}_{m \times n}$ be an $m \times n$ matrix of zeros and ones. The matrix $A$ is said to be a Ferrers matrix if it has decreasing row sums and it is row and column dense with nonzero $(1, 1)$ -entry. We characterize all linear maps perserving the set of $n \times 1$ Ferrers vectors over the binary Boolean semiring and over the Boolean ring $ℤ_{2}$ . Also, we have achieved the number of these linear maps in each case.

A generalization of a formalized theory of fields of sets on non-classical logics

Helena Rasiowa

Similarity:

Contents Introduction.................................................................................................................................................. 3 § 1. System $𝒮$ of a propositional calculus...................................................................... 4 § 2. System $𝒮 *$ ..................................................................................................................... 5 § 3. $𝒮 *$ -algebras.....................................................................................................................

Coherent ultrafilters and nonhomogeneity

Jan Starý (2015)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We introduce the notion of a coherent $P$ -ultrafilter on a complete ccc Boolean algebra, strengthening the notion of a $P$ -point on $ω$ , and show that these ultrafilters exist generically under $𝔠 = 𝔡$ . This improves the known existence result of Ketonen [On the existence of $P$ -points in the Stone-Čech compactification of integers, Fund. Math. 92 (1976), 91–94]. Similarly, the existence theorem of Canjar [On the generic existence of special ultrafilters, Proc. Amer. Math. Soc. 110 (1990), no. 1,...

The rings which are Boolean

Ivan Chajda, Filip Švrček (2011)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We study unitary rings of characteristic 2 satisfying identity $x^{p} = x$ for some natural number p. We characterize several infinite families of these rings which are Boolean, i.e., every element is idempotent. For example, it is in the case if $p = 2^{n} - 2$ or $p = 2^{n} - 5$ or $p = 2^{n} + 1$ for a suitable natural number n. Some other (more general) cases are solved for p expressed in the form $2^{q} + 2 m + 1$ or $2^{q} + 2 m$ where q is a natural number and $m \in 1, 2, . . ., 2^{q} - 1$ .

FKN Theorem on the biased cube

Piotr Nayar (2014)

Colloquium Mathematicae

Similarity:

We consider Boolean functions defined on the discrete cube $- γ, γ^{- 1} ⁿ$ equipped with a product probability measure $μ^{\otimes n}$ , where $μ = β δ_{- γ} + α δ_{γ^{- 1}}$ and γ = √(α/β). This normalization ensures that the coordinate functions ${(x_{i})}_{i = 1, . . ., n}$ are orthonormal in $L ₂ (- γ, γ^{- 1} ⁿ, μ^{\otimes n})$ . We prove that if the spectrum of a Boolean function is concentrated on the first two Fourier levels, then the function is close to a certain function of one variable. Our theorem strengthens the non-symmetric FKN Theorem due to Jendrej, Oleszkiewicz and Wojtaszczyk. Moreover,...

Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

Claude Tardif (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We prove that for any $c \geq 5$ , there exists an infinite family ${(G_{n})}_{n \in ℕ}$ of graphs such that $χ (G_{n}) > c$ for all $n \in ℕ$ and $χ (G_{m} \times G_{n}) \leq c$ for all $m \neq n$ . These counterexamples to Hedetniemi’s conjecture show that the Boolean lattice of exponential graphs with $K_{c}$ as a base is infinite for $c \geq 5$ .

On the number of finite algebraic structures

Erhard Aichinger, Peter Mayr, R. McKenzie (2014)

Journal of the European Mathematical Society

Similarity:

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 fixed finite set $A$ , the set of all such Malcev clones is countable. This completes the solution of a problem that was first formulated in 1980, or earlier: how many Malcev clones can finite sets support? More generally, we prove that every finite algebra...

Cardinal sequences of length < ω₂ under GCH

István Juhász, Lajos Soukup, William Weiss (2006)

Fundamenta Mathematicae

Similarity:

Let (α) denote the class of all cardinal sequences of length α associated with compact scattered spaces (or equivalently, superatomic Boolean algebras). Also put $_{λ} (α) = s \in (α) : s (0) = λ = m i n [s (β) : β < α]$ . We show that f ∈ (α) iff for some natural number n there are infinite cardinals $λ ₀ i > λ ₁ > . . . > λ_{n - 1}$ and ordinals $α ₀, . . ., α_{n - 1}$ such that $α = α ₀ + \dots + α_{n - 1}$ and $f = f ₀ ⏜ f ₁ ⏜ . . . ⏜ f_{n - 1}$ where each $f_{i} \in_{λ_{i}} (α_{i})$ . Under GCH we prove that if α < ω₂ then (i) $_{ω} (α) = s \in^{α} ω, ω ₁ : s (0) = ω$ ; (ii) if λ > cf(λ) = ω, $_{λ} (α) = s \in^{α} λ, λ ⁺ : s (0) = λ, s^{- 1} λ i s ω ₁ - c l o s e d i n α$ ; (iii) if cf(λ) = ω₁, $_{λ} (α) = s \in^{α} λ, λ ⁺ : s (0) = λ, s^{- 1} λ i s ω - c l o s e d a n d s u c c e s s o r - c l o s e d i n α$ ; (iv) if cf(λ) > ω₁, $_{λ} (α) =^{α} λ$ . This yields a complete characterization of the classes (α) for all...

Relations on a lattice of varieties of completely regular semigroups

Mario Petrich (2020)

Mathematica Bohemica

Similarity:

Completely regular semigroups $𝒞ℛ$ are considered here with the unary operation of inversion within the maximal subgroups of the semigroup. This makes $𝒞ℛ$ a variety; its lattice of subvarieties is denoted by $ℒ (𝒞ℛ)$ . We study here the relations $𝐊, T, L$ and $𝐂$ relative to a sublattice $Ψ$ of $ℒ (𝒞ℛ)$ constructed in a previous publication. For $𝐑$ being any of these relations, we determine the $𝐑$ -classes of all varieties in the lattice $Ψ$ as well as the restrictions of $𝐑$ to $Ψ$ .