Studies of Euler diagrams
Jump to navigation
Jump to search
Studies of Boolean functions |
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
- list of example functions
- terminology used in this project
- sequences
examples[edit | edit source]
blightless (examples by clan)[edit | edit source]
blighted (reducible arity)[edit | edit source]
clans, transformations, tables[edit | edit source]
gapspots[edit | edit source]
filtrates[edit | edit source]
splits[edit | edit source]
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 bundles, i.e. parts of the Euler diagram that are connected by crossing circles
ternary labels[edit | edit source]
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]
Wikimedia Commons has media related to Studies of Euler diagrams.