[FOM] Boolean algebra/ Simplicity

[Harvey Friedman]

This is nice.

How does it interact with my complexity issues?

E.g., can we prove that the various axiomatizations you present in the
various fragments are best possible under various interesting
complexity measures, for BA and HA? I.e., it would seem intuitively
"clear" that a Gentzen based approach should be optimal.

Harvey Friedman

On Tue, Oct 13, 2015 at 6:46 PM, Dana Scott <dana.scott at cs.cmu.edu> wrote:
> Equational axioms and free-variable equational deduction
> have much to recommend themselves, but sometimes the
> approach can lead to complications (say, in trying to
> limit the number of equations or the number of variables
> to be used).  In the case of classical and intuitionistic
> logic, an algebraic approach using a partial ordering
> can be given very neatly:
.......