Abstract

This paper explores the interplay between logic-sensitivity and bitstring semantics in the square of opposition. Bitstring semantics is a combinatorial technique for representing the formulas that appear in a logical diagram, while logic-sensitivity entails that such a diagram may depend, not only on the formulas involved, but also on the logic with respect to which they are interpreted. These two topics have already been studied extensively in logical geometry, and are thus well-understood by themselves. However, the precise details of their interplay turn out to be far more complicated. In particular, the paper describes an elegant and natural interaction between bitstrings and logic-sensitivity, which makes perfect sense when bitstrings are viewed as purely combinatorial entities. However, when we view bitstrings as semantically meaningful entities (which is actually the standard perspective, cf. the term ‘bitstring semantics’!), this interaction does not seem to have a full and equally natural counterpart. The paper describes some attempts to address this situation, but all of them are ultimately found wanting. For now, it thus remains an open problem to capture this interaction between bitstrings and logic-sensitivity from a semantic (rather than merely a combinatorial) perspective.