Studies of Euler diagrams

Studies of Boolean functions

dummy

This resource shows the Euler diagrams for many Boolean functions, and aims to find a systematic way to draw them.
This is part of the documentation of a software, that is not yet published.

* criteria for good Euler diagrams
* examples (list of named Boolean functions)
* terminology used in this project
* sequences

## examples

[edit | edit source]

medusa

Euler diagram, graph and formula tree

## blightless   (examples by clan)

[edit | edit source]

multi-bundle

4-ary bundles

## blighted   (reducible valency)

[edit | edit source]

bloated

blotted

## clans, transformations, tables

[edit | edit source]

dukeli NP

table of tabita

## gapspots

[edit | edit source]

gap variants

hard and soft

## filtrates

[edit | edit source]

## splits

[edit | edit source]

3 possible relationships between 2 different splits

A split is a generalization of a set without the notion of inside and outside. It just splits the universe in two sides.

## decompose

[edit | edit source]

decomposition into three bundles

decomposition into bundles, i.e. parts of the Euler diagram that are connected by crossing circles

## ternary labels

[edit | edit source]

labels with 3 and 4 digits

While the cells can be labeled with binary numbers, all segments (including edges and vertices) can be labeled with balanced ternary numbers.

## grids

[edit | edit source]

## formula trees

[edit | edit source]

## To do

[edit | edit source]

* How are Euler diagrams related to hypergraphs?

Wikimedia Commons has media related to Studies of Euler diagrams.