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 main objective of this paper is devoted to two main parts. First, the paper introduces logical interpretations of classical structures of opposition that are constructed as extensions of the square of opposition. Blanché’s hexagon as well as two cubes of opposition proposed by Morreti and pairs Keynes–Johnson will be introduced. The second part of this paper is dedicated to a graded extension of the Aristotle’s square and Peterson’s square of opposition with intermediate quantifiers. These quantifiers are linguistic expressions such (...) as “most”, “many”, “a few”, and “almost all”, and they correspond to what are often called “fuzzy quantifiers” in the literature. The graded Peterson’s cube of opposition, which describes properties between two graded squares, will be discussed at the end of this paper. (shrink)