Singular-term semantics has been intractable. Frege took the referents of singular terms to be their semantic values. On his account, vacuous terms lacked values. Russell separated the semantics of definite descriptions from the semantics of proper names, which caused truth-values to be composed in two different ways and still left vacuous names without values. Montague gave all noun phrases sets of verb-phrase extensions for values, which created type mismatches when noun phrases were objects and still left vacuous names without values. (...) There is a single type of value for all noun phrases that dissolves the difficulties which have beset singular-term semantics. (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)

In this paper, we provide an overview of some of the results obtained in the mathematical theory of intermediate quantifiers that is part of fuzzy natural logic. We briefly introduce the mathematical formal system used, the general definition of intermediate quantifiers and define three specific ones, namely, “Almost all”, “Most” and “Many”. Using tools developed in FNL, we present a list of valid intermediate syllogisms and analyze a generalized 5-square of opposition.

Some Carrollian posthumous manuscripts reveal, in addition to his famous ‘logical diagrams’, two mysterious ‘logical charts’. The first chart, a strange network making out of fourteen logical sentences a large 2D ‘triangle’ containing three smaller ones, has been shown equivalent—modulo the rediscovery of a fourth smaller triangle implicit in Carroll's global picture—to a 3D tetrahedron, the four triangular faces of which are the 3+1 Carrollian complex triangles. As it happens, such an until now very mysterious 3D logical shape—slightly deformed—has been (...) rediscovered, independently from Carroll and much later, by a logician , a mathematician and a linguist studying the geometry of the ‘opposition relations’, that is, the mathematical generalisations of the ‘logical square’. We show that inside what is called equivalently ‘n-opposition theory’, ‘oppositional geometry’ or ‘logical geometry’, Carroll's first chart corresponds exactly, duly reshap.. (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)

In this publication we continue the study of fuzzy Peterson’s syllogisms. While in the previous publication we focused on verifying the validity of these syllogisms using the construction of formal proofs and semantic verification, in this publication we focus on verifying the validity of syllogisms using Peterson’s rules based on grades.