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. (shrink)

Logical geometry systematically studies Aristotelian diagrams, such as the classical square of oppositions and its extensions. These investigations rely heavily on the use of bitstrings, which are compact combinatorial representations of formulas that allow us to quickly determine their Aristotelian relations. However, because of their general nature, bitstrings can be applied to a wide variety of topics in philosophical logic beyond those of logical geometry. Hence, the main aim of this paper is to present a systematic technique for assigning bitstrings (...) to arbitrary finite fragments of formulas in arbitrary logical systems, and to study the logical and combinatorial properties of this technique. It is based on the partition of logical space that is induced by a given fragment, and sheds new light on a number of interesting issues, such as the logic-dependence of the Aristotelian relations and the subtle interplay between the Aristotelian and Boolean structure of logical fragments. Finally, the bitstring technique also allows us to systematically analyze fragments from contemporary logical systems, such as public announcement logic, which could not be done before. (shrink)

The Aristotelian square of oppositions is a well-known diagram in logic and linguistics. In recent years, several extensions of the square have been discovered. However, these extensions have failed to become as widely known as the square. In this paper we argue that there is indeed a fundamental difference between the square and its extensions, viz., a difference in informativity. To do this, we distinguish between concrete Aristotelian diagrams and, on a more abstract level, the Aristotelian geometry. We then introduce (...) two new logical geometries, and develop a formal, well-motivated account of their informativity. This enables us to show that the square is strictly more informative than many of the more complex diagrams. (shrink)

This paper studies John Buridan's octagons of opposition for the de re modal propositions and the propositions of unusual construction. Both Buridan himself and the secondary literature have emphasized the strong similarities between these two octagons (as well as a third one, for propositions with oblique terms). In this paper, I argue that the interconnection between both octagons is more subtle than has previously been thought: if we move beyond the Aristotelian relations, and also take Boolean considerations into account, then (...) the strong analogy between Buridan's octagons starts to break down. These differences in Boolean structure can already be discerned within the octagons themselves; on a more abstract level, they lead to these two octagons having different degrees of Boolean complexity (i.e. Boolean closures of different sizes). These results are obtained by means of bitstring analysis, which is one of the key tools from contemporary logical geometry. Finally, I argue that this historical investigation is directly relevant for the theoretical framework of logical geometry, and discuss how it helps us to address certain open questions in this framework. (shrink)

© Springer International Publishing Switzerland 2016. We develop a systematic approach for dealing with informationally equivalent Aristotelian diagrams, based on the interaction between the logical properties of the visualized information and the geometrical properties of the concrete polygon/polyhedron. To illustrate the account’s fruitfulness, we apply it to all Aristotelian families of 4-formula fragments that are closed under negation and to all Aristotelian families of 6-formula fragments that are closed under negation.