Polynym Math

set comparison between two polynyms

PSOLID object-oriented programming ⊥ Pfascination


Equality

$$A \neq B$$
A is not equal to B

Subset

$$A \not\subseteq B$$
A is not a subset of or equal to B

Superset

$$A \not\supseteq B$$
A is not a superset of or equal to B

Intersection

$$A \cap B =$$
{ }

Union

$$A \cup B =$$
{ Liskov substitution, dependency inversion, effort, external stimulus, idle, interface segregation, open-closed, single responsibility }

Symmetric Difference

$$A \ominus B =$$
{ Liskov substitution, dependency inversion, effort, external stimulus, idle, interface segregation, open-closed, single responsibility }

Difference

$$A - B =$$
{ Liskov substitution, dependency inversion, interface segregation, open-closed, single responsibility }

Difference

$$B - A =$$
{ effort, external stimulus, idle }

Cartesian Product

$$A \times B =$$
{ (Liskov substitution, effort),
(Liskov substitution, external stimulus),
(Liskov substitution, idle),
(dependency inversion, effort),
(dependency inversion, external stimulus),
(dependency inversion, idle),
(interface segregation, effort),
(interface segregation, external stimulus),
(interface segregation, idle),
(open-closed, effort),
(open-closed, external stimulus),
(open-closed, idle),
(single responsibility, effort),
(single responsibility, external stimulus),
(single responsibility, idle) }
Polynym
SOLID

SOLID object-oriented programming

Source
Robert C. Martin
Area
Programming
Mode
part
Depth
5
User
scotty


vs.

fascination

Source
James Westly
Area
Psychology
Mode
type
Depth
3
User
kemp
5 parts of SOLID object-oriented programming

3 types of fascination
single responsibility
open-closed
Liskov substitution
interface segregation
dependency inversion

idle
external stimulus
effort
© 2026 Nymology