Peters and Westerståhl (Quantifiers in Language and Logic, 2006), and Westerståhl (New Perspectives on the Square of Opposition, 2011) draw a crucial distinction between the “classical” Aristotelian squares of opposition and the “modern” Duality squares of opposition. The classical square involves four opposition relations, whereas the modern one only involves three of them: the two horizontal connections are fundamentally distinct in the Aristotelian case (contrariety, CR vs. subcontrariety, SCR) but express the same Duality relation of internal negation (SNEG). Furthermore, the (...) vertical relations in the classical square are unidirectional, whereas in the modern square they are bidirectional. The present paper argues that these differences become even bigger when two more operators are added, namely the U ( ${{\equiv} {\rm A}\,{\vee} \,{\rm E} }$ , all or no) and Y ( ${\equiv{\rm I} \,{\wedge} \,{\rm O}}$ , some but not all) of Blanché (Structures Intellectuelles, 1969). In the resulting Aristotelian hexagon the two extra nodes are perfectly integrated, yielding two interlocking triangles of CR and SCR. In the duality hexagon by contrast, they do not enter into any relation with the original square, but constitute a independent pair of their own, since they are their own SNEGs. Hence, they not only stand in a relation of external NEG, but also in one of duality. This reflexive nature of the SNEG will be shown to result in defective monotonicity configurations for the pair, namely the absence of right-monotonicity (on the predicate argument). In the second half of the paper, we present an overview of those hexagonal structures which are both Aristotelian and Duality configurations, and those which are only Aristotelian. (shrink)

The central aim of this paper is to present a Boolean algebraic approach to the classical Aristotelian Relations of Opposition, namely Contradiction and (Sub)contrariety, and to provide a 3D visualisation of those relations based on the geometrical properties of Platonic and Archimedean solids. In the first part we start from the standard Generalized Quantifier analysis of expressions for comparative quantification to build the Comparative Quantifier Algebra CQA. The underlying scalar structure allows us to define the Aristotelian relations in Boolean terms (...) and to propose a 3D visualisation by transforming a cube into an octahedron. In part two, the architecture of the CQA is shown to carry over, both to the classical quantifiers of Predicate Calculus and to the modal operators—which are given a Generalized Quantifier style re-interpretation. In this way we provide an algebraic foundation for Blanché’s Aristotelian hexagon as well as a 3D alternative to his 2D star-like visualisation. In a final part, a richer scalar structure is argued to underly the realm of Modality, thus generalizing the 3D algebra with eight (2 3 ) operators to a 4D algebra with sixteen (2 4 ) operators. The visual representation of the latter structure involves a transformation of the hypercube to a rhombic dodecahedron. The resulting 3D visualisation allows a straightforward embedding, not only of the classical Blanché star of Aristotelian relations or the paracomplete and paraconsistent stars of Béziau (Log Investig 10, 218–232, 2003) but also of three additional isomorphic Aristotelian constellations. (shrink)

Our aim is to show that translating the modal graphs of Moretti’s “n-opposition theory” (2004) into set theory by a suited device, through identifying logical modal formulas with appropriate subsets of a characteristic set, one can, in a constructive and exhaustive way, by means of a simple recurring combinatory, exhibit all so-called “logical bi-simplexes of dimension n” (or n-oppositional figures, that is the logical squares, logical hexagons, logical cubes, etc.) contained in the logic produced by any given modal graph (an (...) exhaustiveness which was not possible before). In this paper we shall handle explicitly the classical case of the so-called 3(3)-modal graph (which is, among others, the one of S5), getting to a very elegant tetraicosahedronal geometrisation of this logic. (shrink)

. The truth conditions that Aristotle attributes to the propositions making up the traditional square of opposition have as a consequence that a particular affirmative proposition such as ‘Some A is not B’ is true if there are no Bs. Although a different convention than the modern one, this assumption remained part of centuries of work in logic that was coherent and logically fruitful.

This paper first investigates logical characterizations of different structures of opposition that extend the square of opposition in a way or in another. Blanché’s hexagon of opposition is based on three disjoint sets. There are at least two meaningful cubes of opposition, proposed respectively by two of the authors and by Moretti, and pioneered by philosophers such as J. N. Keynes, W. E. Johnson, for the former, and H. Reichenbach for the latter. These cubes exhibit four and six squares of (...) opposition respectively. We clarify the differences between these two cubes, and discuss their gradual extensions, as well as the one of the hexagon when vertices are no longer two-valued. The second part of the paper is dedicated to the use of these structures of opposition for discussing the comparison of two items. Comparing two items usually involves a set of relevant attributes whose values are compared, and may be expressed in terms of different modalities such as identity, similarity, difference, opposition, analogy. Recently, J.-Y. Béziau has proposed an “analogical hexagon” that organizes the relations linking these modalities. Elementary comparisons may be a matter of degree, attributes may not have the same importance. The paper studies in which ways the structure of the hexagon may be preserved in such gradual extensions. As another illustration of the graded hexagon, we start with the hexagon of equality and inequality due to R. Blanché and extend it with fuzzy equality and fuzzy inequality. Besides, the cube induced by a tetra-partition can account for the comparison of two items in terms of preference, reversed preference, indifference and non-comparability even if these notions are a matter of degree. The other cube, which organizes the relations between the different weighted qualitative aggregation modes, is more relevant for the attribute-based comparison of items in terms of similarity. (shrink)

The paper first introduces a cube of opposition that associates the traditional square of opposition with the dual square obtained by Piaget’s reciprocation. It is then pointed out that Blanché’s extension of the square-of-opposition structure into an conceptual hexagonal structure always relies on an abstract tripartition. Considering quadripartitions leads to organize the 16 binary connectives into a regular tetrahedron. Lastly, the cube of opposition, once interpreted in modal terms, is shown to account for a recent generalization of formal concept analysis, (...) where noticeable hexagons are also laid bare. This generalization of formal concept analysis is motivated by a parallel with bipolar possibility theory. The latter, albeit graded, is indeed based on four graded set functions that can be organized in a similar structure. (shrink)

This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax, semantics, soundness, completeness, independence, normal forms, vertical paths through negation normal formulas, compactness, Smullyan's Unifying Principle, natural deduction, cut-elimination, semantic tableaux, Skolemization, Herbrand's Theorem, unification, duality, interpolation, and definability. The last three chapters of the book provide an introduction to type theory (higher-order logic). It is shown how various mathematical concepts can be formalized in this very expressive formal language. This expressive notation facilitates proofs (...) of the classical incompleteness and undecidability theorems which are very elegant and easy to understand. The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory. Some of the numerous exercises require giving formal proofs. A computer program called ETPS which is available from the web facilitates doing and checking such exercises. Audience: This volume will be of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification. (shrink)