A formal theory of oppositions and opposites is proposed on the basis of a non- Fregean semantics, where opposites are negation-forming operators that shed some new light on the connection between opposition and negation. The paper proceeds as follows. After recalling the historical background, oppositions and opposites are compared from a mathematical perspective: the first occurs as a relation, the second as a function. Then the main point of the paper appears with a calculus of oppositions, by means of a (...) non-Fregean semantics that redefines the logical values of various sorts of sentences. A num- ber of topics are then addressed in the light of this algebraic semantics, namely: how to construct value-functional operators for any logical opposition, beyond the classical case of contradiction; Blanché's "closure problem", i.e., how to find a complete structure connecting the sixteen binary sentences with one another. All of this is meant to devise an abstract theory of opposition: it encompasses the relation of consequence as subalternation, while relying upon the use of a primary "proto- negation" that turns any relatum into an opposite. This results in sentential negations that proceed as intensional operators, while negation is broadly viewed as a difference-forming operator without special constraints on it. (shrink)

One of the manuscripts of Buridan’s Summulae contains three figures, each in the form of an octagon. At each node of each octagon there are nine propositions. Buridan uses the figures to illustrate his doctrine of the syllogism, revising Aristotle's theory of the modal syllogism and adding theories of syllogisms with propositions containing oblique terms (such as ‘man’s donkey’) and with ‘propositions of non-normal construction’ (where the predicate precedes the copula). O-propositions of non-normal construction (i.e., ‘Some S (some) P is (...) not’) allow Buridan to extend and systematize the theory of the assertoric (i.e., non-modal) syllogism. Buridan points to a revealing analogy between the three octagons. To understand their importance we need to rehearse the medieval theories of signification, supposition, truth and consequence. (shrink)

In this paper I propose a set-theoretical interpretation of the logical square of opposition, in the perspective opened by generalized quantifier theory. Generalized quantifiers allow us to account for the semantics of quantificational Noun Phrases, and of other natural language expressions, in a coherent and uniform way. I suggest that in the analysis of the meaning of Noun Phrases and Determiners the square of opposition may help representing some semantic features responsible to different logical properties of these expressions. I will (...) conclude with some consideration on scope interactions between quantifiers. (shrink)

The scalar approach to negative polarity item (NPI) licensing assumes that NPIs are allowable in contexts in which the introduction of the NPI leads to proposition strengthening (e.g., Kadmon & Landman 1993, Krifka 1995, Lahiri 1997, Chierchia 2006). A straightforward processing prediction from such a theory is that NPI’s facilitate inference verification from sets to subsets. Three experiments are reported that test this proposal. In each experiment, participants evaluated whether inferences from sets to subsets were valid. Crucially, we manipulated whether (...) the premises contained an NPI. In Experiment 1, participants completed a metalinguistic reasoning task, and Experiments 2 and 3 tested reading times using a self-paced reading task. Contrary to expectations, no facilitation was observed when the NPI was present in the premise compared to when it was absent. In fact, the NPI significantly slowed down reading times in the inference region. Our results therefore favor those scalar theories that predict that the NPI is costly to process (Chierchia 2006), or other, nonscalar theories (Giannakidou 1998, Ladusaw 1992, Postal 2005, Szabolcsi 2004) that likewise predict NPI processing cost but, unlike Chierchia (2006), expect the magnitude of the processing cost to vary with the actual pragmatics of the NPI. (shrink)

I try to explain the difference between three kinds of negation: external negation, negation of the predicate and privation. Further I use polygons of opposition as heuristic devices to show that a logic which contains all three mentioned kinds of negation must be a fragment of a Łukasiewicz-four-valued predicate logic. I show, further, that, this analysis can be elaborated so as to comprise additional kinds of privation. This would increase the truth-values in question and bring fragments of (more generally speaking) (...) Łukasiewicz-n-valued predicate logics into the scene. (shrink)

The square of opposition (as part of a lattice) is used as a natural way to represent different and opposite ways of who makes decisions, and in what way, in/for a group or a society. Majority logic is characterized by multiple logical squares (one for each possible majority), with the “discursive dilemma” as a consequence. Three-valued logics of majority decisions with discursive dilemma undecided, of veto, consensus, and sequential voting are analyzed from the semantic point of view. For instance, the (...) paraconsistent and paracomplete logics M3, M3veto and C3 are described. The distinction of designated and non-designated values is not used, and instead, the consequence relation is defined as a preservation of the minimum truth-value of the implying set of sentences. The consequence and opposition relations of the logics described are compared, and an ordering of the logics with respect to their opposition relations is established. (shrink)