Expressively complete boolean functions

[Jon Awbrey]

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

a useful starting point for thinking about
"expressively complete sets of boolean operators" (ecs obos's),
aka "sole sufficient sets of boolean operators" (s^3 obo's),
is given by the family of "minimal negation operators" (mno's):

http://www.getwiki.net/wiki.php?title=Minimal_negation_operator

oops, that page is still being reformatted, until then see:

http://en.wikipedia.org/wiki/Minimal_negation_operator

ja

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
inquiry e-lab: http://stderr.org/pipermail/inquiry/
zhongwen wp: http://zh.wikipedia.org/wiki/User:Jon_Awbrey
wikinfo: http://wikinfo.org/wiki.php?title=User:Jon_Awbrey
meta: http://www.getwiki.net/wiki.php?title=User:Jon_Awbrey
wp review: http://wikipediareview.com/index.php?showuser=398
o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o