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

Jerzy Płonka

Displaying similar documents to “Minimal generics from subvarieties of the clone extension of the variety of Boolean algebras”

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

Jerzy Płonka (2001)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Let τ: F → N be a type of algebras, where F is a set of fundamental operation symbols and N is the set of all positive integers. An identity φ ≈ ψ is called biregular if it has the same variables in each of it sides and it has the same fundamental operation symbols in each of it sides. For a variety V of type τ we denote by $V_{b}$ the biregularization of V, i.e. the variety of type τ defined by all biregular identities from Id(V). Let B be the variety of Boolean algebras of type $τ_{b} : +, \cdot, ´ \to N$ , where...

$\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:

Orthomodular lattices that are horizontal sums of Boolean algebras

Ivan Chajda, Helmut Länger (2020)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The paper deals with orthomodular lattices which are so-called horizontal sums of Boolean algebras. It is elementary that every such orthomodular lattice is simple and its blocks are just these Boolean algebras. Hence, the commutativity relation plays a key role and enables us to classify these orthomodular lattices. Moreover, this relation is closely related to the binary commutator which is a term function. Using the class $ℋ$ of horizontal sums of Boolean algebras, we establish an identity...

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

A representation theorem for tense $n \times m$ -valued Łukasiewicz-Moisil algebras

Aldo Victorio Figallo, Gustavo Pelaitay (2015)

Mathematica Bohemica

Similarity:

In 2000, Figallo and Sanza introduced $n \times m$ -valued Łukasiewicz-Moisil algebras which are both particular cases of matrix Łukasiewicz algebras and a generalization of $n$ -valued Łukasiewicz-Moisil algebras. Here we initiate an investigation into the class $_{n \times m}$ of tense $n \times m$ -valued Łukasiewicz-Moisil algebras (or tense LM $_{n \times m}$ -algebras), namely $n \times m$ -valued Łukasiewicz-Moisil algebras endowed with two unary operations called tense operators. These algebras constitute a generalization of tense...

k-Normalization and (k+1)-level inflation of varieties

Valerie Cheng, Shelly Wismath (2008)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Let τ be a type of algebras. A common measurement of the complexity of terms of type τ is the depth of a term. For k ≥ 1, an identity s ≈ t of type τ is said to be k-normal (with respect to this depth complexity measurement) if either s = t or both s and t have depth ≥ k. A variety is called k-normal if all its identities are k-normal. Taking k = 1 with respect to the usual depth valuation of terms gives the well-known property of normality of identities or varieties. For any variety...

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

On generalized Beurling’s theorem and symmetry of $L_{1}$ -group algebras

Zenobia Anusiak (1971)

Colloquium Mathematicae

Similarity:

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

On cardinalities of algebras of formulas for $ω_{0}$ -categorical theories

Jan Waszkiewicz (1973)

Colloquium Mathematicae

Similarity:

$ℵ_{0}$ -categoricity of products of 1-unary algebras

Philip Olin (1975)

Colloquium Mathematicae

Similarity:

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

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.

Transfer of derived equivalences from subalgebras to endomorphism algebras II

Shengyong Pan, Jiahui Yu (2024)

Czechoslovak Mathematical Journal

Similarity:

We investigate derived equivalences between subalgebras of some $Φ$ -Auslander-Yoneda algebras from a class of $n$ -angles in weakly $n$ -angulated categories. The derived equivalences are obtained by transferring subalgebras induced by $n$ -angles to endomorphism algebras induced by approximation sequences. Then we extend our constructions in T. Brüstle, S. Y. Pan (2016) to $n$ -angle cases. Finally, we give an explicit example to illustrate our result.