Abstract
This paper is mainly about Boolean combinations of Σ-formulas (B(Σ)-formulas) in
HA. We prove a theorem guaranteeing that if a B(Σ)-formula is provable in HA, then a simpler one is also provable. Our theorem yields a characterization of the derived rules of HA for Σ-substitutions. Another application is a decision procedure
... read more