Knot Logic and Arborescent Links

This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is foundational, and it is related to generalisations of boolean logic and to aspects of foundations based in diagrams and networks. Applications are given to rational knots, links and tangles and to the structure of the bracket polynomial and the beginnings of Khovanov homology.