  We review some independence results in a finite axiom-schematization of
classical first-order logic introduced by Norman Megill. We also prove that a
certain axiom scheme of this system is independent although all of its
instances are provable from the other axiom schemes.
