This paper sets forth a new theory of quantifiers and term connectives, called shadow theory , which should help simplify various semantic theories of natural language by greatly reducing the need of Montagovian proper names, type-shifting, and λ-conversion. According to shadow theory, conjunctive, disjunctive, and negative noun phrases such as John and Mary , John or Mary , and not both John and Mary , as well as determiner phrases such as every man , some woman , and the boys (...) , are all of semantic type e and denote individual-like objects, called shadows — conjunctive , disjunctive , or negative shadows, such as John-and-Mary, John-or-Mary, and not-(John-and-Mary). There is no essential difference between quantification and denotation: quantification is nothing but denotation of shadows. Individuals and shadows constitute a Boolean structure. Formal language LSD (Language for Shadows with Distributivity), which takes compound terms to denote shadows, is investigated. Expansions and enrichments of LSD are also considered toward the end of the paper. (shrink)

In this paper, I argue that the temporal connective prima (‘before’) is a comparative adverb. The argument is based on a number of grammatical facts from Italian, showing that there is an asymmetry between prima and dopo (‘after’). On the ground of their divergent behaviour, I suggest that dopo has a different grammatical status from prima. I propose a semantic treatment for prima that is based on an independently motivated analysis of comparatives which can be traced back to Seuren (in: (...) Kiefer and Ruwet (eds.) Generative grammar in Europe, 1973). Dopo is analyzed instead as an atomic two-place predicate which contributes a binary relation over events to the sentence meaning. The different semantic treatments of the two connectives provide an explanation for the grammatical asymmetries considered at the outset; interestingly, they also shed some light on other asymmetries between prima and dopo, which are known to hold for the English temporal connectives before and after as well: these asymmetries are related to the veridicality properties, the distribution of NPIs, and the logical properties of these connectives first described in Anscombe (Philos Rev 73:3–24, 1964). (shrink)

We provide a semantic analysis of respective readings, including butnot limited to the interpretation of examples containing the adverbrespectively, which accounts for a number of facts that haveeither proven difficult for previous studies or heretofore goneunnoticed in the literature. The analysis introduces the new notionsof property sum and proposition sum which integrate smoothly with existing analyses of plurals and distributivity. The analysis also admits of a straightforward account of previouslyunacknowledged examples involving filler-gap dependencies that areproblematic for contemporary syntactic theories. Ramifications (...) anddirections for future research are discussed. (shrink)

We consider algebras on binary relations with two main operators: relational composition and dynamic negation. Relational composition has its standard interpretation, while dynamic negation is an operator familiar to students of Dynamic Predicate Logic (DPL) (Groenendijk and Stokhof, 1991): given a relation R its dynamic negation R is a test that contains precisely those pairs (s,s) for which s is not in the domain of R. These two operators comprise precisely the propositional part of DPL.This paper contains a finite equational (...) axiomatization for these dynamic relation algebras. The completenessresult uses techniques from modal logic. We also lookat the variety generated by the class of dynamic relation algebras and note that there exist nonrepresentable algebras in this variety, ones which cannot be construedas spaces of relations. These results are also proved for an extension to a signature containing atomic tests and union. (shrink)

We consider the variety of Dynamic Relation Algebras V(DRA). We show that the monoid of an algebra in this variety determines dynamic negation uniquely.

A formal, computational, semantically clean representation of natural language is presented. This representation captures the fact that logical inferences in natural language crucially depend on the semantic relation of entailment between sentential constituents such as determiner, noun, adjective, adverb, preposition, and verb phrases.The representation parallels natural language in that it accounts for human intuition about entailment of sentences, it preserves its structure, it reflects the semantics of different syntactic categories, it simulates conjunction, disjunction, and negation in natural language by computable (...) operations with provable mathematical properties, and it allows one to represent coordination on different syntactic levels. (shrink)

(2) Peter wollte Potsdam nicht verlassen bevor das Projekt in ruhigem Fahrwasser war. There are other well-known examples of non-interpreted negation, viz. cases of so-called negative concord in Slavic and Romance languages, but also in dialects of German and English. But arguably, in those cases the “superfluous” negation has to be present for grammatical reasons, which is not the case here. I will show that the negation is in fact interpreted, and that, due to a complex interplay of semantic and (...) pragmatic factors, we do get truth conditions for the two sentences that are not quite identical, but very similar. (shrink)

Argues for an assimilation of sentential and predicate conjunction to collective conjunction, based on modification of predicates by adverbs such as 'alternately'.

At least since [Frege, 1960] and [Geach, 1965], there has been some consensus about the relation between negation, the speech act of denial, and the attitude of rejection: a denial, the consensus has had it, is the assertion of a negation, and a rejection is a belief in a negation. Recently, though, there have been notable deviations from this orthodox view. Rejectivists have maintained that negation is to be explained in terms of denial or rejection, rather than vice versa. Some (...) other theorists have maintained that negation is a separate phenomenon from denial, and that neither is to be explained in terms of the other. In this paper, I present and consider these heterodox theories of the relation between negation, denial, and rejection. (shrink)

Suppose Alice asserts p, and the Caterpillar wants to disagree. If the Caterpillar accepts classical logic, he has an easy way to indicate this disagreement: he can simply assert ¬p. Sometimes, though, things are not so easy. For example, suppose the Cheshire Cat is a paracompletist who thinks that p ∨ ¬p fails (in familiar (if possibly misleading) language, the Cheshire Cat thinks p is a gap). Then he surely disagrees with Alice's assertion of p, but should himself be unwilling (...) to assert ¬p. So he cannot simply use the classical solution. Dually, suppose the Mad Hatter is a dialetheist who thinks that p ∧ ¬p holds (that is, he thinks p is a glut). Then he may assert ¬p, but it should not be taken to indicate that he disagrees with Alice; he doesn't. So he too can't use the classical solution. The Cheshire Cat and the Mad Hatter, then, have a common problem, and philosophers with opinions like theirs have adopted a common solution to this problem: appeal to denial. Denial, these philosophers suppose, is a speech act like assertion, but it is not to be understood as in any way reducing to assertion. Importantly, denial is something different from the assertion of a negation; this is what allows it to work even in cases where assertion of negation does not. Just as importantly, denial must express disagreement, since this is the job it's being enlisted to do. (shrink)

I introduce a formal language called the language of informational independence (IL-language, for short) that extends an ordinary first-order language in a natural way. This language is interpreted in terms of semantical games of imperfect information. In this language, one can define two negations: (i) strong or dual negation, and (ii) weak or contradictory negation. The latter negation, unlike the former, can occur only sentence-initially. Then I argue that, to a certain extent, the two negations match the distinction existing in (...) natural languages between sentential and constituent negation. As a corollary, I derive the fact that there are no mechanical rules for forming the contradictory negation of an English sentence. (shrink)

T?s?, a thirteenth century logician writing in Arabic, uses two logical connectives to build up molecular propositions: ?if-then?, and ?either-or?. By referring to a dichotomous Tree, T?s? shows how to choose the proper disjunction relative to the terms in the disjuncts. He also discusses the disjunctive propositions which follow from a conditional proposition.

The central topic of this inquiry is a cross-linguistic contrast in the interaction of conjunction and negation. In Hungarian (Russian, Serbian, Italian, Japanese), in contrast to English (German), negated definite conjunctions are naturally and exclusively interpreted as `neither’. It is proposed that Hungarian-type languages conjunctions simply replicate the behavior of plurals, their closest semantic relatives. More puzzling is why English-type languages present a different range of interpretations. By teasing out finer distinctions in focus on connectives, syntactic structure, and context, the (...) paper tracks down missing readings and argues that it is eventually not necessary to postulate a radical cross-linguistic semantic difference. In the course of making that argument it is observed that negated conjunctions on the `neither’ reading carry the expectation that the predicate hold of both conjuncts. The paper investigates several hypotheses concerning the source of this expectation. (shrink)

This paper uses the strengthened liar paradox as a springboard to illuminate two more general topics: i) the negation operator and the speech act of denial among speakers of English and ii) some ways the potential for acceptable language change is constrained by linguistic meaning. The general and special problems interact in reciprocally illuminating ways. The ultimate objective of the paper is, however, less to solve certain problems than to create others, by illustrating how the issues that form the topic (...) of this paper are more intricate than previously realised, and that they are related in delicate and somewhat surprising ways. (shrink)

In this paper, I explore the potential of systematically studying the linguistic surface of discourse for the purposes of identifying markers of argumentative moves and other related categories, such as types of arguments and argumentative strategies. Such a list of argumentative markers can prove useful for the (semi)automatic treatment of a large corpus of texts. After reviewing literature on the linguistic realization of argumentative moves as well as literature on the subject of discourse markers, it becomes clear that the search (...) for representative items of argumentative markers cannot be restricted to those elements marking relations but that it should also include elements that signal a certain function that is of pertinence to argumentative analysis. In this view, argumentative markers can be any single or complex lexical expression as well as a discursive configuration whose presence in a given utterance marks that utterance or the one preceding/following it, or a larger piece of discourse as having a certain argumentative function (as an argumentative move, a type of argument or an argumentative strategy). Examples taken from a French corpus on the controversy surrounding the development and applications of nanotechnology currently under study are used to illustrate the different types of argumentative markers proposed. (shrink)

This paper examines a recent attempt to provide anegative answer to the question of the existence of illocutionary negations. It argues that the attempt is unsuccessful both because it presupposes amisinterpretation of the question''s theoretical import and because, even granting that misinterpretation, it bases its proposed answer on certain assumptions that can independently be shown to be untenable.

G. H. von Wright proposed that a temporal interval exemplifies a real contradiction if at least one part of any division of this interval involves the presence of contradictorily related (though non-simultaneous) states. In connection with intervals, two negations must be discerned: 'does not hold at an interval' and 'fails throughout an interval'. Von Wright did not distinguish the two. As a consequence, he made a mistake in indicating how to use his logical symbolism to express the notion of real (...) contradiction. The present paper aims to reconstruct and philosophically motivate von Wright's argument for the possibility of real contradictions. (shrink)

The paper is devoted to the contributions of Helena Rasiowa to the theory of non-classical negation. The main results of Rasiowa in this area concerns–constructive logic with strong (Nelson) negation.

Constructive logic with Nelson negation is an extension of the intuitionistic logic with a special type of negation expressing some features of constructive falsity and refutation by counterexample. In this paper we generalize this logic weakening maximally the underlying intuitionistic negation. The resulting system, called subminimal logic with Nelson negation, is studied by means of a kind of algebras called generalized N-lattices. We show that generalized N-lattices admit representation formalizing the intuitive idea of refutation by means of counterexamples (...) giving in this way a counterexample semantics of the logic in question and some of its natural extensions. Among the extensions which are near to the intuitionistic logic are the minimal logic with Nelson negation which is an extension of the Johansson's minimal logic with Nelson negation and its in a sense dual version — the co-minimal logic with Nelson negation. Among the extensions near to the classical logic are the well known 3-valued logic of Lukasiewicz, two 12-valued logics and one 48-valued logic. Standard questions for all these logics — decidability, Kripke-style semantics, complete axiomatizability, conservativeness are studied. At the end of the paper extensions based on a new connective of self-dual conjunction and an analog of the Lukasiewicz middle value ½ have also been considered. (shrink)

In this paper we address some central problems of combination of logics through the study of a very simple but highly informative case, the combination of the logics of disjunction and conjunction. At first it seems that it would be very easy to combine such logics, but the following problem arises: if we combine these logics in a straightforward way, distributivity holds. On the other hand, distributivity does not arise if we use the usual notion of extension between consequence relations. (...) A detailed discussion about this phenomenon, as well as some possible solutions for it, are given. (shrink)

ABSTRACT: The 3rd BCE Stoic logician "Chrysippus says that the number of conjunctions constructible from ten propositions exceeds one million. Hipparchus refuted this, demonstrating that the affirmative encompasses 103,049 conjunctions and the negative 310,952." After laying dormant for over 2000 years, the numbers in this Plutarch passage were recently identified as the 10th (and a derivative of the 11th) Schröder number, and F. Acerbi showed how the 2nd BCE astronomer Hipparchus could have calculated them. What remained unexplained is why Hipparchus’ (...) logic differed from Stoic logic, and consequently, whether Hipparchus actually refuted Chrysippus. This paper closes these explanatory gaps. (1) I reconstruct Hipparchus’ notions of conjunction and negation, and show how they differ from Stoic logic. (2) Based on evidence from Stoic logic, I reconstruct Chrysippus’ calculations, thereby (a) showing that Chrysippus’ claim of over a million conjunctions was correct; and (b) shedding new light on Stoic logic and – possibly – on 3rd century BCE combinatorics. (3) Using evidence about the developments in logic from the 3rd to the 2nd centuries, including the amalgamation of Peripatetic and Stoic theories, I explain why Hipparchus, in his calculations, used the logical notions he did, and why he may have thought they were Stoic. (shrink)

In this paper we study the relations between the fragment L of classical logic having just conjunction and disjunction and the variety D of distributive lattices, within the context of Algebraic Logic. We prove that these relations cannot be fully expressed either with the tools of Blok and Pigozzi's theory of algebraizable logics or with the use of reduced matrices for L. However, these relations can be naturally formulated when we introduce a new notion of model of a sequent calculus. (...) When applied to a certain natural calculus for L, the resulting models are equivalent to a class of abstract logics (in the sense of Brown and Suszko) which we call distributive. Among other results, we prove that D is exactly the class of the algebraic reducts of the reduced models of L, that there is an embedding of the theories of L into the theories of the equational consequence (in the sense of Blok and Pigozzi) relative to D, and that for any algebra A of type (2,2) there is an isomorphism between the D-congruences of A and the models of L over A. In the second part of this paper (which will be published separately) we will also apply some results to give proofs with a logical flavour for several new or well-known lattice-theoretical properties. (shrink)

This is a comprehensive study of the English word 'or', and the logical operators variously proposed to present its meaning. Although there are indisputably disjunctive uses of or in English, it is a mistake to suppose that logical disjunction represents its core meaning. 'Or' is descended from the Anglo-Saxon word meaning second, a form which survives in such expressions as "every other day." Its disjunctive uses arise through metalinguistic applications of an intermediate adverbial meaning which is conjunctive rather than disjunctive (...) in character. These conjunctive uses have puzzled philosophers and logicians, and have been discussed extensively under such headings as "free choice permission." This study examines the textbook myths that have clouded our understanding of how or and other "logical" vocabulary comes to have something approaching its logical meaning in natural languages. It considers the various historical conceptions of disjunction and its place in logic from the Stoics to the present day. (shrink)

I argue that the conjunctive distribution of permissibility over or, which is a puzzling feature of free-choice permission is just one instance of a more general class of conjunctive occurrences of the word, and that these conjunctive uses are more directly explicable by the consideration that or is a descendant of oper than by reference to the disjunctive occurrences which logicalist prejudices may tempt us to regard as semantically more fundamental. I offer an account of how the disjunctive uses of (...) or may have come about through an intermediate discourse-adverbial use of or, drawing a parallel with but, which, etymologically, is disjunctive rather than conjunctive and whose conjunctive uses seem to represent just such a discourse-adverbial application. (shrink)

In the first part of this article, we show that, contrary to the Gricean tradition, inter-clausal and is not semantically equivalent to logical conjunction and, contrary to temporal approaches such as Bar-Levand Palacas 1980, it is not temporallyloaded. We then explore a commonsenseidea – namely that while sentence juxtaposition might be interpreted either as discourse coordination or subordination, and indicates coordination. SDRT already includes notions of coordinating and subordinating discourse relations (cf. Lascarides and Asher 1993, Asher 1993), and the meaning (...) of and is related to this distinction. Similar distinctions that play a crucial role in anaphora resolution have also appeared in AI – cf. Scha and Polanyi 1988, or Webber 1991. However, this discourse-structure-based distinction has not been well defined yet, and our approach provides independent motivation for it. This paper argues that the semantics of and includes a notion of coordination expressed as the requirement of a Coordinated Discourse Topic (CDT).CDT characterizes aclass of discourse relations, among which are Narration and Result.Once the basic semanticcontribution of and is isolated, effects related to its presence such as changes in temporal structure, blocking of a Discourse Relation, or conditional meanings are shown to follow from the defeasiblearchitecture set up by SDRT. (shrink)

The quantum logical `or' is analyzed from a physical perspective. We show that it is the existence of EPR-like correlation states for the quantum mechanical entity under consideration that make it nonequivalent to the classical situation. Specifically, the presence of potentiality in these correlation states gives rise to the quantum deviation from the classical logical `or'. We show how this arises not only in the microworld, but also in macroscopic situations where EPR-like correlation states are present. We investigate how application (...) of this analysis to concepts could alleviate some well known problems in cognitive science. (shrink)

In this paper we address some central problems of combination of logics through the study of a very simple but highly informative case, the combination of the logics of disjunction and conjunction. At first it seems that it would be very easy to combine such logics, but the following problem arises: if we combine these logics in a straightforward way, distributivity holds. On the other hand, distributivity does not arise if we use the usual notion of extension between consequence relations. (...) A detailed discussion about this phenomenon, as well as some possible solutions for it, are given. (shrink)

This study is concerned with the properties of the disjunction operator, or, and the acquisition of these properties by English-speaking children. Previous research has concluded that adult truth conditions for logical connectives are acquired relatively late in the course of language development. With particular reference to disjunction, the results of several studies have led to two claims. First, it has been argued that the full range of truth-conditions associated with inclusive-or is not initially available to children; instead, children are supposed (...) to interpret disjunction using the truth conditions that are associated with exclusive-or (e.g., Beilin and Lust 1975; Braine and Rumain 1981, 1983; Paris 1973). A second, related claim is that even when children respond as if they have access to the complete range of truth conditions, their responses result from the failure to distinguish or from and (Paris, 1973). (shrink)

This paper investigates scalar implicatures and downward entailment in child English. In previous experimental work we have shown that adults’ computation of scalar implicatures is sensitive to entailment relations. For instance, when the disjunction operator or occurs in positive contexts, an implicature of exclusivity arises. By contrast when the disjunction operator occurs within the scope of a downward entailing linguistic expression, no implicature of exclusivity is computed. Investigations on children’s computation of scalar implicatures in the same contexts have led to (...) a slightly different picture. In particular it has proven difficult to demonstrate that children compute scalar implicatures (in non- downward entailing contexts) using the Truth Value Judgment task, a technique that has been used successfully in showing children’s sensitivity to other semantic phenomena. Adopting a different experimental technique called the Felicity Judgment task, however, we demonstrated children’s knowledge of the prerequisites to the computation of scalar implicatures (Chierchia, Crain, Guasti, Gualmini and Meroni, 2001). (shrink)

Poverty -of-stimulus arguments have taken new ground recently, augmented by experimental findings from th e study of child language. In this paper, we briefly review two variants of the poverty-of-stimulus argument that have received empirical support from studies of child language; then we examine a third argument of this kind in more detail. The case under discussion involves the structural notion of c-command as it pertains to children’s interpretation of disjunction in the scope of negation.

This paper investigates young children's knowledge of scalar implicatures and downward entailment. In previous experimental work, we have shown that young children access the full range of truth-conditions associated with logical words in classical logic, including the disjunction operator, as well as the indefinite article. The present study extends this research in three ways, taking disjunction as a case study. Experiment 1 draws upon the observation that scalar implicatures (SIs) are cancelled (or reversed) in downward entailing (DE) linguistic environments, e.g., (...) in the scope of negation (Chierchia, 2000). Experiment 2 was designed to determine if scalar implicatures are used by children, like adults, to influence the interpretation of disjunction in non-DE contexts, yielding an implicature of exclusivity for disjunction. Whereas adult controls always rejected assertions of the form A or B in positive (non-DE) contexts in which assertions of the form A and B were also true, many children accepted assertions with disjunction in such contexts. To provide an interpretation to the findings from Experiment 2, a new experimental technique was devised and used in Experiment 3. The new technique presents pairs of assertions to children, who are asked to judge which assertion is a ‘better’ description of the context. The findings from Experiment 3 demonstrated children's awareness that A and B is more informative than A or B in positive contexts, where both statements are true. Taken together, the findings of Experiments 2 and 3 are compatible with the view that some children lack the computational resources to apply scalar implicatures when a single assertion is presented alone (see Reinhart, 1999). (shrink)

This study is concerned with the acquisition of the disjunction operator, or, in English. Two mutually inconsistent claims have been made about the acquisition of disjunction. One claim is that the acquisition of the adult truth conditions for logical connectives, including disjunction, is a late and not fully universal, achievement. With particular reference to disjunction, the findings from several studies are interpreted as showing that only the truth conditions associated with exclusive-or are available to young children (e.g., Beilin and Lust (...) 1975; Braine and Rumain 1981, 1983; Paris 1973). There is a related claim, that even when children respond as if they have access to a broader range of truth conditions, namely those associated with inclusive-or, children's adult-like responses are the result of a failure to distinguish or from and (Paris 1973). (shrink)

We present a series of arguments for logical nativism, focusing mainly on the meaning of disjunction in human languages. We propose that all human languages are logical in the sense that the meaning of linguistic expressions corresponding to disjunction (e.g. English or , Chinese huozhe, Japanese ka ) conform to the meaning of the logical operator in classical logic, inclusive- or . It is highly implausible, we argue, that children acquire the (logical) meaning of disjunction by observing how adults use (...) disjunction. Findings from studies of child language acquisition and from cross-linguistic research invite the conclusion that children do not learn to be logical—it comes naturally to them. (shrink)

In this paper we study the relations between the fragment L of classical logic having just conjunction and disjunction and the variety D of distributive lattices, within the context of Algebraic Logic. We prove that these relations cannot be fully expressed either with the tools of Blok and Pigozzi's theory of algebraizable logics or with the use of reduced matrices for L. However, these relations can be naturally formulated when we introduce a new notion of model of a sequent calculus. (...) When applied to a certain natural calculus for L, the resulting models are equivalent to a class of abstract logics (in the sense of Brown and Suszko) which we call distributive. Among other results, we prove that D is exactly the class of the algebraic reducts of the reduced models of L, that there is an embedding of the theories of L into the theories of the equational consequence (in the sense of Blok and Pigozzi) relative to D, and that for any algebra A of type (2,2) there is an isomorphism between the D-congruences of A and the models of L over A. In the second part of this paper (which will be published separately) we will also apply some results to give proofs with a logical flavour for several new or well-known lattice-theoretical properties. (shrink)

Two quite simple identities for exclusive disjunction and the biconditional are proven by mathematical induction. This proof is independently reprised in R.E. Jennings' /The Genealogy of Disjunction/ (OUP, 1994) pp. 6-7, esp. p. 7 which points out the consequences for the biconditional of the proof that runs from pages 6-7.

This is a comprehensive study of the English word 'or', and the logical operators variously proposed to present its meaning. Although there are indisputably disjunctive uses of or in English, it is a mistake to suppose that logical disjunction represents its core meaning. 'Or' is descended from the Anglo-Saxon word meaning second, a form which survives in such expressions as "every other day." Its disjunctive uses arise through metalinguistic applications of an intermediate adverbial meaning which is conjunctive rather than disjunctive (...) in character. These conjunctive uses have puzzled philosophers and logicians, and have been discussed extensively under such headings as "free choice permission." This study examines the textbook myths that have clouded our understanding of how or and other "logical" vocabulary comes to have something approaching its logical meaning in natural languages. It considers the various historical conceptions of disjunction and its place in logic from the Stoics to the present day. (shrink)

I argue that the conjunctive distribution of permissibility over or, which is a puzzling feature of free-choice permission is just one instance of a more general class of conjunctive occurrences of the word, and that these conjunctive uses are more directly explicable by the consideration that or is a descendant of oper than by reference to the disjunctive occurrences which logicalist prejudices may tempt us to regard as semantically more fundamental. I offer an account of how the disjunctive uses of (...) or may have come about through an intermediate discourse-adverbial use of or, drawing a parallel with but, which, etymologically, is disjunctive rather than conjunctive and whose conjunctive uses seem to represent just such a discourse-adverbial application. (shrink)

This paper investigates young children's knowledge of scalar implicatures and downward entailment. In previous experimental work, we have shown that young children access the full range of truth-conditions associated with logical words in classical logic, including the disjunction operator, as well as the indefinite article. The present study extends this research in three ways, taking disjunction as a case study. Experiment 1 draws upon the observation that scalar implicatures (SIs) are cancelled (or reversed) in downward entailing (DE) linguistic environments, e.g., (...) in the scope of negation (Chierchia, 2000). Experiment 2 was designed to determine if scalar implicatures are used by children, like adults, to influence the interpretation of disjunction in non-DE contexts, yielding an implicature of exclusivity for disjunction. Whereas adult controls always rejected assertions of the form A or B in positive (non-DE) contexts in which assertions of the form A and B were also true, many children accepted assertions with disjunction in such contexts. To provide an interpretation to the findings from Experiment 2, a new experimental technique was devised and used in Experiment 3. The new technique presents pairs of assertions to children, who are asked to judge which assertion is a ‘better’ description of the context. The findings from Experiment 3 demonstrated children's awareness that A and B is more informative than A or B in positive contexts, where both statements are true. Taken together, the findings of Experiments 2 and 3 are compatible with the view that some children lack the computational resources to apply scalar implicatures when a single assertion is presented alone (see Reinhart, 1999). (shrink)

The connective or can be treated as an inclusive disjunction or else as an exclusive disjunction. Although researchers are aware of this distinction, few have examined the conditions under which each interpretation should be anticipated. Based on linguistic-pragmatic analyses, we assume that interpretations are initially inclusive before either (a) remaining so, or (b) becoming exclusive by way of an implicature ( but not both ). We point to a class of situations that ought to predispose disjunctions to inclusive interpretations and (...) to situations that encourage exclusive interpretations. A disjunction's ultimate interpretation is based on its potential informativeness, where the interpretation of the disjunctive utterance having the smallest number of true conditions is considered most informative. Our investigation leads to five experiments employing arbitrary materials. Among the problems expected to encourage inclusive interpretations are those that present disjunctions in the antecedents of conditionals and in question forms. The best candidates to produce implicatures are those disjunctions that underdetermine an expected conjunctive conclusion, although other disjunctive utterances that are more informative as exclusive are discussed and tested. (shrink)

There is a requirement which a disjunction must satisfy in order to constitute a felicitous contribution to an ordinary conversation: its disjuncts must be interpretable as relevant alternatives. When such an interpretation is not available, the disjunction is highly anomalous. The disjuncts of sentence (1), for example, appear unrelated to one another, and the disjunction is concomitantly odd. The effect is similar when the disjuncts are related but do not constitute distinct alternatives, perhaps by virtue of one disjunct entailing another, (...) as in (2). (shrink)

Mandy Simons. On The Felicity Conditions of Disjunctive Sentences.

Hurford’s Constraint (Hurford, Foundations of Language, 11, 409–411, 1974) states that a disjunction is infelicitous if its disjuncts stand in an entailment relation: #John was born in Paris or in France. Gazdar (Pragmatics, Academic Press, NY, 1979) observed that scalar implicatures can obviate the constraint. For instance, sentences of the form (A or B) or (Both Aand B) are felicitous due to the exclusivity implicature of the first disjunct: A or B implicates ‘not (A and B)’. Chierchia, Fox, and Spector (...) (Handbook of semantics, 2008) use the obviation of Hurford’s Constraint in these cases to argue for a theory of local implicature. I present evidence indicating that the constraint needs to be modified in two ways. First, implicatures can obviate Hurford’s Constraint only in earlier disjuncts, not later ones: #(Both A and B) or (A or B). Second, the constraint rules out not only disjuncts that stand in an entailment relation, but also disjuncts that are even mutually consistent: #John is from Russia or Asia. I propose to make sense of these facts by providing an incremental evaluation procedure which checks that each new disjunct to the right is inconsistent with the information to its left, before the disjunct can be strengthened by local implicature. (shrink)

In this paper Grice’s requirements for assertability are imposed on the disjunction of Classical Logic. Defining material implication in terms of negation and disjunction supplemented by assertability conditions, results in the disappearance of the most important paradoxes of material implication. The resulting consequence relation displays a very strong resemblance to Schurz’s conclusion-relevant consequence relation.

This paper is a contribution to the program of constructing formal representations of pragmatic aspects of human reasoning. We propose a formalization within the framework of Adaptive Logics of the exclusivity implicature governing the connective ‘or’.Keywords: exclusivity implicature, Adaptive Logics.

This article answers two questions (posed in the literature), each concerning the guaranteed existence of proofs free of double negation. A proof is free of double negation if none of its deduced steps contains a term of the formn(n(t)) for some term t, where n denotes negation. The first question asks for conditions on the hypotheses that, if satisfied, guarantee the existence of a double-negation-free proof when the conclusion is free of double negation. The second question asks about the existence (...) of an axiom system for classical propositional calculus whose use, for theorems with a conclusion free of double negation, guarantees the existence of a double-negation-free proof. After giving conditions that answer the first question, we answer the second question by focusing on the Lukasiewicz three-axiom system. We then extend our studies to infinite-valued sentential calculus and to intuitionistic logic and generalize the notion of being double-negation free. The double-negation proofs of interest rely exclusively on the inference rule condensed detachment, a rule that combines modus ponens with an appropriately general rule of substitution. The automated reasoning program Otter played an indispensable role in this study. (shrink)

What I hope to achieve in this paper is some rather deeper understanding of the semantic and pragmatic properties of utterances which are said to involve the phenomenon of metalinguistic negation[FN1]. According to Laurence Horn, who has been primarily responsible for drawing our attention to it, this is a special non-truthfunctional use of the negation operator, which can be glossed as 'I object to U' where U is a linguistic utterance. This is to be distinguished from descriptive truthfunctional negation which (...) operates over a proposition. (shrink)

Poverty -of-stimulus arguments have taken new ground recently, augmented by experimental findings from th e study of child language. In this paper, we briefly review two variants of the poverty-of-stimulus argument that have received empirical support from studies of child language; then we examine a third argument of this kind in more detail. The case under discussion involves the structural notion of c-command as it pertains to children’s interpretation of disjunction in the scope of negation.

We explored the influence of negation on cognitive dynamics, measured using mouse-movement trajectories, to test the classic notion that negation acts as an operator on linguistic processing. In three experiments, participants verified the truth or falsity of simple statements, and we tracked the computer-mouse trajectories of their responses. Sentences expressing these facts sometimes contained a negation. Such negated statements could be true (e.g., “elephants are not small”) or false (e.g., “elephants are not large”). In the first experiment, as predicted by (...) the classic notion of negation, we found that negation caused more discreteness in the mouse trajectory of a response. The second experiment induced a simple context for these statements, yet negation still increased discreteness in trajectories. A third experiment enhanced the pragmatic context of sentences, and the discreteness was substantially diminished, with one primary measure no longer significantly showing increased discreteness at all. Traditional linguistic theories predict rapid shifts in cognitive dynamics occur due to the nature of negation: It is an operator that reverses the truth or falsity of an interpretation. We argue that these results support both propositional and contextual accounts of negation present in the literature, suggesting that contextual factors are crucial for determining the kind of cognitive dynamics displayed. We conclude by drawing broader lessons about theories of cognition from the case of negation. (shrink)

In this paper, we identify a paradigm of metalinguistic comparatives in Greek headed by the preposition para. Para clauses are lexically distinct from other comparatives clauses in Greek (headed by apo, apoti). Building on earlier intuitions, we propose a semantics of metalinguistic MORE as a contrast between two propositions in terms of how appropriate of preferred they are by some individual. Syntactically, metalinguistic comparison appears to behave like a co-ordinate structure with ellipsis in the para-clause. Our account is extended to (...) metalinguistic negation, lexicalized by oxi in Greek, which, on a par with metalinguistic comparison, is defined as a binary operator, also contrasting two propositions. (shrink)

The paper argues that the theory of Implicit Definition cannot give an account of knowledge of logical principles. According to this theory, the meanings of certain expressions are determined such that they make certain principles containing them true; this is supposed to explain our knowledge of the principles as derived from our knowledge of what the expressions mean. The paper argues that this explanation succeeds only if Implicit Definition can account for our understanding of the logical constants, and that fully (...) understanding a logical constant in turn requires the ability to apply it correctly in particular cases. It is shown, however, that Implicit Definition cannot account for this ability, even if it draws on introduction rules for the logical constants. In particular, Implicit Definition cannot account for our ability to apply negation in particular cases. Owing to constraints relating to the unique characterisation of logical constants, invoking the notion of rejection does not remedy the situation. Given its failure to explain knowledge of logic, the prospects of Implicit Definition to explain other kinds of a priori knowledge are even worse. (shrink)

C I Lewis showed up Down Under in 2005, in e-mails initiated by Allen Hazen of Melbourne. Their topic was the system Hazen called FL (a Funny Logic), axiomatized in passing in Lewis 1921. I show that FL is the system MEN of material equivalence with negation. But negation plays no special role in MEN. Symbolizing equivalence with → and defining ∼A inferentially as A→f, the theorems of MEN are just those of the underlying theory ME of pure material equivalence. (...) This accords with the treatment of negation in the Abelian l-group logic A of Meyer and Slaney (Abelian logic. Abstract, Journal of Symbolic Logic 46, 425–426, 1981), which also defines ∼A inferentially with no special conditions on f. The paper then concentrates on the pure implicational part AI of A, the simple logic of Abelian groups. The integers Z were known to be characteristic for AI, with every non-theorem B refutable mod some Zn for finite n. Noted here is that AI is pre-tabular, having the Scroggs property that every proper extension SI of AI, closed under substitution and detachment, has some finite Zn as its characteristic matrix. In particular FL is the extension for which n = 2 (Lewis, The structure of logic and its relation to other systems. The Journal of Philosophy 18, 505–516, 1921; Meyer and Slaney, Abelian logic. Abstract. Journal of Symbolic Logic 46, 425–426, 1981; This is an abstract of the much longer paper finally published in 1989 in G. G. Priest, R. Routley and J. Norman, eds., Paraconsistent logic: essays on the inconsistent, Philosophica Verlag, Munich, pp. 245–288, 1989). (shrink)

The paper is concerned with negation in artificial and natural languages. "Negation" is an ambiguous word. It can mean three different things: An operation(negating), an operator (a sign of negation), the result of an operation. The threethings, however, are intimately linked. An operation such as negation, is realizedthrough an operator of negation, i.e. consists in adding a symbol of negation to an entity to obtain an entity of the same type; and which operation it is dependson what it applies to (...) and on what results from its application.I argue that negation is not an operation on linguistic acts but rather anoperation on the objects of linguistic acts, namely sentences. And I assume that the negation of a sentence is a sentence that contradicts it. If so, the negation of a sentence may be obtained, in case the sentence is molecular, by applying the operation of negation not to the sentence itself but to a constituent sentence. To put it in a succinct and paradoxically sounding way we could say that in order to negate a sentence it is sufficient but not necessary to negate it.However that negation applies to sentences is true only for artificial languages, in which the sign of negation is a monadic sentential connective. In natural language, negation applies to expressions other than sentences, namely word sand non-sentential phrases. Still words and not sentential phrases are interesting and valuable only as ultimate or immediate constituents of sentences, as a means of saying (something that can be true or false) and the concern with negation is ultimately the concern with the negation of sentences. So the problem is what sub-sentential and non sentential expressions negation should apply to in order to obtain the negation of the containing sentence. The standard answer is that the negation of a natural language sentence is equivalent to the negation of its predicate. Yet, I argue, predicate negation is necessary but not sufficient, due to the existence of molecular sentences.Finally I notice that if to apply negation to an artificial sentence is to put the negation sign in front of it, to negate the predicate of a natural language sentencemay or may not be to put the negation sign in front of it. (shrink)

Two experiments (N1 = 141, N2 = 40) investigate two versions of Aristotle’s Thesis for the first time. Aristotle’s Thesis is a negated conditional, which consists of one propositional variable with a negation either in the antecedent (version 1) or in the consequent (version 2). This task allows to infer if people interpret indicative conditionals as material conditionals or as conditional events. In the first experiment I investigate between-participants the two versions of Aristotle’s Thesis crossed with abstract versus concrete task (...) material. The modal response for all four groups is consistent with the conditional event and inconsistent with the material conditional interpretation. This observation is replicated in the second experiment. Moreover, the second experiment rules out scope ambiguities of the negation of conditionals. Both experiments provide new evidence against the material conditional interpretation of conditionals and support the conditional event interpretation. Finally, I discuss implications for modeling indicative conditionals and the relevance of this work for experimental philosophy. (shrink)

Dialetheism is the view that some contradictions are true. This is a view which runs against orthodoxy in logic and metaphysics since Aristotle, and has implications for many of the core notions of philosophy. Doubt Truth to Be a Liar explores these implications for truth, rationality, negation, and the nature of logic, and develops further the defense of dialetheism first mounted in Priest's In Contradiction, a second edition of which is also available.

Of the various accounts of negation that have been offered by logicians in the history of Western logic, that of negation as cancellation is a very distinctive one, quite different from the explosive accounts of modern "classical" and intuitionist logics, and from the accounts offered in standard relevant and paraconsistent logics. Despite its ancient origin, however, a precise understanding of the notion is still wanting. The first half of this paper offers one. Both conceptually and historically, the account of negation (...) as cancellation is intimately connected with connexivist principles such as ¬( ¬). Despite this, standard connexivist logics incorporate quite different accounts of negation. The second half of the paper shows how the cancellation account of negation of the first part gives rise to a semantics for a simple connexivist logic. (shrink)

As we’ve seen in the last chapter, there is good linguistic reason to categorize negations (and negative operators in general) by which De Morgan laws they support. The weakest negative operators (merely downward monotonic) support only two De Morgan laws;1 medium-strength negative operators support a third;2 and strong negative operators support all four. As we’ve also seen, techniques familiar from modal logic are of great use in giving unifying theories of negative operators. In particular, Dunn’s (1990) distributoid theory allows us (...) to generate relational semantics for many negations. However, the requirements of distributoid theory are a bit too strict for use in modeling the weakest negations. For a relational semantics to work, an operator must either distribute or antidistribute over either conjunction or disjunction; but the merely downward monotonic operators do not. Thus, a unifying semantics cannot be had in distributoid theory. In the (more familiar) study of positive modalities, there is a parallel result. Normal necessities distribute over conjunction, and normal possibilities over disjunction. When these distributions break down, a relational semantics is no longer appropriate. Here, there is a somewhat familiar solution: neighborhood semantics. In this chapter, I’ll adapt neighborhood semantics to the less familiar case of negative modalities, showing how it can be used to give a single semantic framework appropriate to all the pertinent sorts of negative operators. (shrink)

Studies 6, 1–15. Korean has three forms that express negation: short-form negation, long-form negation and inherently lexical verbs. The goal of this paper is to argue that there are three separate notions related to the expression and interpretation of negation in Korean, which must be kept separate. They are the notions of a negative clause, of the surface c-command domain of a negative element, and of the semantic scope of a negative element. The main arguments derive from the interactions of (...) the negative-sensitive adverb yekan with different forms of negation, and of the interaction of examples with both yekan and a negative-sensitive item like awmu-to (‘anyone’). (Stanford University). (shrink)

This paper advances three necessary conditions on a successful account of sentential negation. First, the ability to explain the constancy of sentential meaning across negated and unnegated contexts (the Fregean Condition). Second, the ability to explain why sentences and their negations are inconsistent, and inconsistent in virtue of the meaning of negation (the Semantic Condition). Third, the ability of the account to generalize regardless of the topic of the negated sentence (the Generality Condition). The paper discusses three accounts of negation (...) available to moral expressivists. The first—the dominant commitment account—fails to meet the Fregean Condition. The two remaining accounts—commitment semantics and the expression account—satisfy all three conditions. A recent argument that the dominant commitment account is the only option available to expressivists is considered and rejected. (shrink)

Classically, truth and falsehood are opposite, and so are logical truth and logical falsehood. In this paper we imagine a situation in which the opposition is so pervasive in the language we use as to threaten the very possibility of telling truth from falsehood. The example exploits a suggestion of Ramsey’s to the effect that negation can be expressed simply by writing the negated sentence upside down. The difference between ‘p’ and ‘~~p’ disappears, the principle of double negation becomes trivial, (...) and the truth/falsehood opposition is up for grabs. Our moral is that this indeterminacy undermines the idea of inferential role semantics. (shrink)

We explore the technical details and historical evolution of Charles Peirce's articulation of a truth table in 1893, against the background of his investigation into the truth-functional analysis of propositions involving implication. In 1997, John Shosky discovered, on the verso of a page of the typed transcript of Bertrand Russell's 1912 lecture on ?The Philosophy of Logical Atomism? truth table matrices. The matrix for negation is Russell's, alongside of which is the matrix for material implication in the hand of Ludwig (...) Wittgenstein. It is shown that an unpublished manuscript identified as composed by Peirce in 1893 includes a truth table matrix that is equivalent to the matrix for material implication discovered by John Shosky. An unpublished manuscript by Peirce identified as having been composed in 1883?1884 in connection with the composition of Peirce's ?On the Algebra of Logic: A Contribution to the Philosophy of Notation? that appeared in the American Journal of Mathematics in 1885 includes an example of an indirect truth table for the conditional. (shrink)

This article discusses what is sometimes called the third paradox of material implication. Readers choosing to download this piece should please be so kind as to respect the author's wishes and download the published corrigendum as well, which is available via the "other links" tab.

Two quite simple identities for exclusive disjunction and the biconditional are proven by mathematical induction. This proof is independently reprised in R.E. Jennings' /The Genealogy of Disjunction/ (OUP, 1994) pp. 6-7, esp. p. 7 which points out the consequences for the biconditional of the proof that runs from pages 6-7.

This piece lays the groundwork for the three 2006 pieces on "Abstracts from Logical Form" (two in /Journal of Pragmatics/, one in /RASK/). The brief introduction to classical logic, propositional and predicate, was inserted at the behest of the referees. Finally, Asimov's conjecture is solved--i.e., formalized--incorrectly here. A corrected version of this paper appeared in the 3rd Volume of /International Journal of Intelligent Systems/, with, as well, a somewhat different emphasis, and /sans/ the introduction to classical logic. However, although that (...) piece /does/ show that Asimov was correct, it does so on a textbook-type example of no intrinsic interest. For the correct solution (formalization) to Asimov's conjecture on Asimov's own story line see "The Logic of 'Double Talk': A Case Study in Diplomatic Deception" (/Journal of Literary Semantics/, 20(1): 53-55.). (shrink)

We note that there are certain uses of both 'and' and 'or' that cannot be explained on their normal truth-table meanings (even when supplemented with sophisticated pragmatic tools). These include examples such as the following: 1) The cops show up, and a fight will break out. = If the cops show up, a fight will break out. 2) I have no friends, or I would throw a party. = I have no friends. If I did have friends, I would throw (...) a party. To explain these uses we give an analysis of what we call the 'dynamic' effects of connectives, which arise even when they have their normal truth-table meaning. We argue that the special uses in 1) and 2) are instances where the connectives have just their dynamic effects without having their truth-table meaning. (shrink)

C I Lewis showed up Down Under in 2005, in e-mails initiated by Allen Hazen of Melbourne. Their topic was the system Hazen called FL (a Funny Logic), axiomatized in passing in Lewis 1921. I show that FL is the system MEN of material equivalence with negation. But negation plays no special role in MEN. Symbolizing equivalence with → and defining ∼A inferentially as A→f, the theorems of MEN are just those of the underlying theory ME of pure material equivalence. (...) This accords with the treatment of negation in the Abelian l-group logic A of Meyer and Slaney (Abelian logic. Abstract, Journal of Symbolic Logic 46, 425–426, 1981), which also defines ∼A inferentially with no special conditions on f. The paper then concentrates on the pure implicational part AI of A, the simple logic of Abelian groups. The integers Z were known to be characteristic for AI, with every non-theorem B refutable mod some Zn for finite n. Noted here is that AI is pre-tabular, having the Scroggs property that every proper extension SI of AI, closed under substitution and detachment, has some finite Zn as its characteristic matrix. In particular FL is the extension for which n = 2 (Lewis, The structure of logic and its relation to other systems. The Journal of Philosophy 18, 505–516, 1921; Meyer and Slaney, Abelian logic. Abstract. Journal of Symbolic Logic 46, 425–426, 1981; This is an abstract of the much longer paper finally published in 1989 in G. G. Priest, R. Routley and J. Norman, eds., Paraconsistent logic: essays on the inconsistent, Philosophica Verlag, Munich, pp. 245–288, 1989). (shrink)

In introductory logic courses the authors often limit their considerations to the truth-value operators. Then they write that conditionals and biconditionals of natural language ("if" and "if and only if") may be represented as material implications and equivalences ("⊃" and "≡"), respectively. Yet material implications are not suitable for conditionals. Lewis' strict implications are much better for this purpose. Similarly, strict equivalences are better for representing biconditionals (than material equivalences). In this paper we prove that the methods from standard first (...) courses in logic can be used for testing arguments with strict implications, strict equivalences and other operators which may represent connectives from natural language. (shrink)

In the first part of this article, we show that, contrary to the Gricean tradition, inter-clausal and is not semantically equivalent to logical conjunction and, contrary to temporal approaches such as Bar-Levand Palacas 1980, it is not temporallyloaded. We then explore a commonsenseidea – namely that while sentence juxtaposition might be interpreted either as discourse coordination or subordination, and indicates coordination. SDRT already includes notions of coordinating and subordinating discourse relations (cf. Lascarides and Asher 1993, Asher 1993), and the meaning (...) of and is related to this distinction. Similar distinctions that play a crucial role in anaphora resolution have also appeared in AI – cf. Scha and Polanyi 1988, or Webber 1991. However, this discourse-structure-based distinction has not been well defined yet, and our approach provides independent motivation for it. This paper argues that the semantics of and includes a notion of coordination expressed as the requirement of a Coordinated Discourse Topic (CDT).CDT characterizes aclass of discourse relations, among which are Narration and Result.Once the basic semanticcontribution of and is isolated, effects related to its presence such as changes in temporal structure, blocking of a Discourse Relation, or conditional meanings are shown to follow from the defeasiblearchitecture set up by SDRT. (shrink)

Two experiments were conducted to show that the IF … THEN … rules used in the different versions of Wason's (1966) selection task are not psychologically—though they are logically—equivalent. Some of these rules are considered by the participants as strict logical conditionals, whereas others are interpreted as expressing a biconditional relationship. A deductive task was used jointly with the selection task to show that the original abstract rule is quite ambiguous in this respect, contrary to deontic rules: the typical “error” (...) made by most people may indeed be explained by the fact that they consider the abstract rule as a biconditional. Thus, there is no proper error or bias in the selection task as it is still argued, but a differential interpretation of the rule. The need for taking into account a pragmatic component in the process of reasoning is illustrated by the experiments. (shrink)