Re: Boolean Expansions

John F. Sowa wrote:
> 
> There is also the question of who first made the observation
> that any Boolean expression with n variables can be exhaustively
> evaluated for validity, contradiction, or satisfiability with
> a table of 2^n rows.  It's possible that Emil Post may have
> made that observation, but I don't have a complete collection
> of his works to verify that claim.

I think that Boole made this clear enough with
his use of what we now call boolean expansions,
as detailed in ''The Laws of Thought''.

There is a graphical version of this principle in what
I called the "Case Analysis-Synthesis Theorem" (CAST):

http://mywikibiz.com/PERS#Case_analysis-synthesis_theorem

Happy Year Of The Bunny ...

Jon

cc: Arisbe, Inquiry

-- 

inquiry list: http://stderr.org/pipermail/inquiry/
mwb: http://www.mywikibiz.com/Directory:Jon_Awbrey
knol: http://knol.google.com/k/-/-/3fkwvf69kridz/1
oeiswiki: http://www.oeis.org/wiki/User:Jon_Awbrey