Boundary logic proof proceeds by deletion of irrelevant forms, rather than by rearranging forms as do other logical proof systems. Since it is algebraic, boundary logic provides minimization as well as proof by casting inconsequential forms into the void.

Void-substitution is easily understood, it is erasure or deletion. Generalized pervasion is far less familiar, since it skips across conventional function application boundaries as if they were transparent.

Form Abstraction presents techniques for partitioning parens forms, tools that are useful for subdividing and simplifying complex nestings of parens. Since parens forms are shorthand for graphs, this piece is also about abstraction of homogeneous graphs. Pervasion is not a functional transformation, rather it introduces the unique idea of semipermeable boundaries that are transparent on one side. Understanding transparency is critical to understanding boundary logic transformations.

The remaining five short pieces examine basic transformational approaches, focusing on what is fundamental in void-based computation.