This paper is chiefly aimed at individuating some deep, but as yet almost unnoticed, similarities between Aristotle's syllogistic and the Stoic doctrine of conditionals, notably between Aristotle's metasyllogistic equimodality condition and truth-conditions for third type conditionals. In fact, as is shown in §1, Aristotle's condition amounts to introducing in his metasyllogistic a non-truthfunctional implicational arrow '', the truth-conditions of which turn out to be logically equivalent to truth-conditions of third type conditionals, according to which only the impossible follows from the (...) impossible. Moreover, Aristotle is given precisely this non-Scotian conditional logic in two so far overlooked passages of Themistius' Paraphrasis of De Caelo. Some further consequences of Aristotle's equimodality condition on his logic, and notably on his syllogistic, are pointed out and discussed at length. A extension of Aristotle's condition is also discussed, along with a full characterization of truth-conditions of fourth type conditionals. (shrink)

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)