Table of Contents
Fetching ...

Free skew Boolean algebras

Ganna Kudryavtseva, Jonathan Leech

Abstract

We study the structure and properties of free skew Boolean algebras. For finite generating sets, these free algebras are finite and we give their representation as a product of primitive algebras and provide formulas for calculating their cardinality. We also characterize atomic elements and central elements and calculate the number of such elements. These results are used to study minimal generating sets of finite skew Boolean algebras. We also prove that the center of the free infinitely generated algebra is trivial and show that all free algebras have intersections.

Free skew Boolean algebras

Abstract

We study the structure and properties of free skew Boolean algebras. For finite generating sets, these free algebras are finite and we give their representation as a product of primitive algebras and provide formulas for calculating their cardinality. We also characterize atomic elements and central elements and calculate the number of such elements. These results are used to study minimal generating sets of finite skew Boolean algebras. We also prove that the center of the free infinitely generated algebra is trivial and show that all free algebras have intersections.

Paper Structure

This paper contains 6 sections, 28 theorems, 52 equations.

Key Result

Theorem 2.2

A skew lattice ${\bf S}$ is strongly distributive if and only if it is symmetric, distributive and normal.

Theorems & Definitions (52)

  • Example 2.1
  • Theorem 2.2: L6
  • Remark 2.3
  • Remark 2.4
  • Theorem 2.5: L2
  • Remark 2.6
  • Theorem 3.1: L2
  • Remark 3.2
  • Corollary 3.3
  • Corollary 3.4
  • ...and 42 more