In the next Subdivision I consider a logical transformation ''F'' that has the concrete type ''F'' : [''u'', ''v''] → [''x'', ''y''] and the abstract type ''F'' : ['''B'''<sup>2</sup>] → ['''B'''<sup>2</sup>]. From the standpoint of propositional calculus, the task of understanding such a transformation is naturally approached by parsing it into component maps with 1-dimensional ranges, as follows: | In the next Subdivision I consider a logical transformation ''F'' that has the concrete type ''F'' : [''u'', ''v''] → [''x'', ''y''] and the abstract type ''F'' : ['''B'''<sup>2</sup>] → ['''B'''<sup>2</sup>]. From the standpoint of propositional calculus, the task of understanding such a transformation is naturally approached by parsing it into component maps with 1-dimensional ranges, as follows: |