Properties of Boolean functions are maps that assign values to Boolean functions.

Soft properties are dependent on arity.
For them the domain is always just the set of ${\displaystyle 2^{2^{n}}}$ Boolean functions with arity ${\displaystyle n}$.

Hard properties are rarer, and probably more useful.
For them the domain can be the infinite set of all Boolean functions. (Typically the codomain will also be infinite, unless the values are Boolean.)

Properties of 3-ary BF are illustrated here: Boolf prop/3-ary
E.g. Boolf prop/3-ary/quaestor, Boolf prop/3-ary/patron

Below is a list of links to the respective chapters.   They are created with {{boolf-prop}}.

hard

• weight
• nonlinearity
• atoms
• root
• family, faction, clan
• super-family, super-faction, super-clan
• prefect
• legion, cohort
• complement
• reverse
• dual

soft

• twin
• half-complement
• ultra-family, ultra-clan
• tribe
• principality, dominion
• partner, friend
• squad, platoon, company