Michael Tye responds to the problem of higher-order vagueness for his trivalent semantics by maintaining that truth-value predicates are “vaguely vague”: it’s indeterminate, on his view, whether they have borderline cases and therefore indeterminate whether every sentence is true, false, or indefinite. Rosanna Keefe objects (1) that Tye’s argument for this claim tacitly assumes that every sentence is true, false, or indefinite, and (2) that the conclusion is any case not viable. I argue – contra (1) – that (...) Tye’s argument needn’t make that assumption. A version of her objection is in fact better directed against other arguments Tye advances, though Tye can absorb this criticism without abandoning his position’s core. On the other hand, Keefe’s second objection does hit the mark: embracing ‘vaguely vague’ truth-value predicates undermines Tye’s ability to support validity claims needed to defend his position. To see this, however, we must develop Keefe’s remarks further than she does. (shrink)

(2014). Capturing the relationship between conditionals and conditional probability with a trivalent semantics. Journal of Applied Non-Classical Logics: Vol. 24, Three-Valued Logics and their Applications, pp. 144-152. doi: 10.1080/11663081.2014.911535.

A quasi-canonical Gentzen-type system is a Gentzen-type system in which each logical rule introduces either a formula of the form , or of the form , and all the active formulas of its premises belong to the set . In this paper we investigate quasi-canonical systems in which exactly one of the two classical rules for negation is included, turning the induced logic into either a paraconsistent logic or a paracomplete logic, but not both. We provide a constructive coherence criterion (...) for such systems, and show that a quasi-canonical system of the type we investigate is coherent iff it is strongly paraconsistent or strongly paracomplete (in a sense defined in the paper), iff it has a trivalent, non-deterministic semantics of a special type (also defined in the paper) for which it is sound and complete. Finally, we determine when a system of this sort admits cut-elimination, and provide a simple procedure for transforming one which does not into one which does. (shrink)

This paper explores trivalent truth conditions for indicative conditionals, examining the “defective” truth table proposed by de Finetti and Reichenbach. On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti’s table come with some problems, and highlight two ways out of the (...) predicament: one pairs de Finetti’s conditional with validity as the preservation of non-false values, but at the expense of Modus Ponens; the other modifies de Finetti’s table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti’s table proposed by Cooper and Cantwell. In Part II, we give an in-depth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties. (shrink)

ABSTRACT A trivalent theory of indicative conditionals automatically enforces Stalnaker's thesis – the equation between probabilities of conditionals and conditional probabilities. This result holds because the trivalent semantics requires, for principled reasons, a modification of the ratio definition of conditional probability in order to accommodate the possibility of undefinedness. I explain how this modification is motivated and how it allows the trivalent semantics to avoid a number of well-known triviality results, in the process clarifying why (...) these results hold for many bivalent theories. In short, the slew of triviality results published in the last 40-odd years need not be viewed as an argument against Stalnaker's thesis: it can be construed instead as an argument for abandoning the bivalent requirement that indicative conditionals somehow be assigned a truth-value in worlds in which their antecedents are false. (shrink)

We consider language models for the Lambek calculus that allow empty antecedents and enrich them with constants for the empty language and for the language containing only the empty word. No complete calculi are known with respect to these semantics, and in this paper we consider several trivalent systems that arise as fragments of these models? logics.

This paper presents a unified theory of the truth conditions and probability of indicative conditionals and their compounds in a trivalent framework. The semantics validates a Reduction Theorem: any compound of conditionals is semantically equivalent to a simple conditional. This allows us to validate Stalnaker's Thesis in full generality and to use Adams's notion of $p$-validity as a criterion for valid inference. Finally, this gives us an elegant account of Bayesian update with indicative conditionals, establishing that despite differences (...) in meaning, it is tantamount to learning a material conditional. (shrink)

Both the phenomenon of presupposition and that of vagueness have motivated the use of one form or another of trivalent logic, in which a declarative sentence can not only receive the standard values true and false , but also a third, non-standard truth-value which is usually understood as ‘undefined’ . The goal of this paper is to propose a multivalent framework which can deal simultaneously with presupposition and vagueness, and, more specifically, capture their projection properties as well as their (...) different roles in language. Now, there is a prima facie simple way of doing this, which simply consists in assimilating the two phenomena, and using an appropriate type of trivalent logic. On this view, we just need a compositional system that deals with the ‘undefined’ truth-value, and does not care about whether the source of undefinedness is ‘presuppositional’ or related to vagueness. I will argue that such a simple solution cannot succeed, and point out a number of desiderata that any successful approach must meet. I will then present and discuss two seven-valued semantics, inspired, respectively, by the Strong Kleene semantics and by supervaluationism, which meet these desiderata. (shrink)

In Part I of this paper, we identified and compared various schemes for trivalent truth conditions for indicative conditionals, most notably the proposals by de Finetti and Reichenbach on the one hand, and by Cooper and Cantwell on the other. Here we provide the proof theory for the resulting logics DF/TT and CC/TT, using tableau calculi and sequent calculi, and proving soundness and completeness results. Then we turn to the algebraic semantics, where both logics have substantive limitations: DF/TT (...) allows for algebraic completeness, but not for the construction of a canonical model, while CC/TT fails the construction of a Lindenbaum-Tarski algebra. With these results in mind, we draw up the balance and sketch future research projects. (shrink)

Thought: A Journal of Philosophy, Volume 10, Issue 1, Page 42-52, March 2021.

I argue for two theses about semantically anomalous utterances (more commonly called "category mistakes") like "sequestered slaps reel evergreen rights". First, semantic anomaly generates a unique form of semantically enforced quantifier domain restriction. Second, the best explanation for why anomaly interacts with quantifiers in this way is that anomalous utterances are truth-valueless. After arguing for these points, I trace out two consequences these theses have in semantics and logic. First, I argue they motivate a trivalent semantics on (...) which truth-valueless material has an unsual positive role to play in the compositional semantics of truth-evaluable utterances. Second, I argue that the interaction of anomaly with quantifiers generates a unique form of classical inference failure, and also provides special motivations for reconceptualizing our logical consequence relations. (shrink)

斯特劳逊 （Strawson）的语义预设概念在语义学和语言哲学研究上颇有建树。尽管如此，语义预设概念一直遭受来自各方面的批判。概要说来，对语义预设概念之批判主要来自两个方面：其一，试图抽去语义预设概念的逻辑基础 ，即非真值概念 (the notion of truthvaluelessness)，从而达到间接地拒斥语义预设概念之目的。其二，直接批判语义预设概念本身。他们或者论证此概念在理论上不自恰或微不足道，或者断定即使此概念本身在理论上自恰，但实为一空 洞无物之概念。因为我们根本找任何一个语义预设的具体例证。所以，语义预设概念不具任何真正的哲学意义。它只是一个当代神话，理应拒斥。 -/- 玻尔(S. Ber)和莱肯(W. Lycan)对语义预设概念的批判集中代表了以上两个方面。据我所知，迄今不曾有人对他们的批判予以全面和公正的反驳，以致于许多人人云亦云，使得他们的论点至今颇有影响。给予玻尔和莱恩的批判以全面反驳乃本文初 衷。于此相关，我以为很有必要澄清对语义预设概念的诸多误解，从而确立一个理论上自恰，实际上可行，和确有实质性内容的语义预设概念。基于以上考虑，我对语义预设概念批判之反驳包括正 反两个方面。在第二节，我试图建立一个自恰，完备，非庸俗的语义预设概念。基于这一概念，第三节对玻尔和莱恩反对语义预设的两个核心批判予以全面反驳。第四节着重辩护非真值概念。本文的最后结论是：各种批判并未损 伤斯特劳逊的语义预设概念的精髓。语 义预设概念非但不是一个当代神话，而且具有重大哲学意义。 .

Heim 1983 suggested that the analysis of presupposition projection requires that the classical notion of meanings as truth conditions be replaced with a dynamic notion of meanings as Context Change Potentials. But as several researchers (including Heim herself) later noted, the dynamic framework is insufficiently predictive: although it allows one to state that, say, the dynamic effect of F and G is to first update a Context Set C with F and then with G (i.e., C[F and G] = C[F][G]), (...) it fails to explain why there couldn’t be a ‘deviant’ conjunction and* which performed these operations in the opposite order (i.e., C[F and* G] = C[G][F]). We provide a formal introduction to a competing framework, the Transparency theory, which addresses this problem. Unlike dynamic semantics, our analysis is fully classical, i.e., bivalent and static. And it derives the projective behavior of connectives from their bivalent meaning and their syntax. We concentrate on the formal properties of a simple version of the theory, and we prove that (i) full equivalence with Heim’s results is guaranteed in the propositional case (Theorem 1), and that (ii) the equivalence can be extended to the quantificational case (for any generalized quantifiers), but only when certain conditions are met (Theorem 2). (shrink)

Regarding the famous Sea Battle Argument, which Aristotle presents in De Interpretatione 9, there has never been a general agreement not only about its correctness but also, and mainly, about what the argument really is. According to the most natural reading of the chapter, the argument appeals to a temporal concept of truth and concludes that not every statement is always either true or false. However, many of Aristotle’s followers and commentators have not adopted this reading. I believe that it (...) has faced so much resistance for reasons of hermeneutic charity: denying the law of universal bivalence seems to be overly disruptive to logical orthodoxy – the kind of logical orthodoxy represented by what we now call classical propositional logic, much of which Aristotle clearly supports in many texts. I intend to show that the logical-semantic theses that the traditional reading finds in De Interpretatione 9 are much more conservative than they may seem to be at first glance. First, I will show that they complement, and do not contradict in any way, the orthodox definitions of the concepts of truth and statement that Aristotle advances in other texts. Second, by resorting in an anachronistic vein to concepts and methods peculiar to contemporary logic, I will show that a trivalent modal semantics conforming to those theses can be built for a standard formal language of the classical propositional calculus. It is remarkable that reasonable concepts of logical truth and logical consequence that may be defined on the basis of this trivalent modal semantics are coextensive with their orthodox counterparts, the concepts of tautology and tautological consequence of classical bivalent and extensional semantics. (shrink)

This paper develops a trivalent semantics for the truth conditions and the probability of the natural language indicative conditional. Our framework rests on trivalent truth conditions first proposed by Cooper (1968) and Belnap (1973) and it yields two logics of conditional reasoning: (i) a logic C of certainty-preserving inference; and (ii) a logic U for uncertain reasoning that preserves the probability of the premises. We show systematic correspondences between trivalent and probabilistic representations of inferences in either (...) framework, and we use the distinction between the two systems to cast light on the validity of inferences such as Modus Ponens, Or-To-If, and Conditional Excluded Middle. Specifically, the conditional behaves monotonically in C, but non-monotonically in U; Modus Ponens is valid in C, but valid in U only for non-nested conditionals. The result is a unified account of the semantics and epistemology of indicative conditionals that can be fruitfully applied to analyzing the validity of conditional inferences. (shrink)

The material conditional and the suppositional analysis of the indicative conditional are based on different philosophical foundations and they leave important successes of their competitor unexplained. This paper unifies both accounts within a truth-functional, trivalent model of the suppositional analysis. In this model, we observe that the material and the suppositional conditional exhibit the same logical behavior while they have different truth conditions and different probabilities. The result is a unified semantic analysis that closes an important gap in the (...) suppositional story and explains the persistent appeal of the material conditional analysis for philosophers and psychologists of reasoning. (shrink)

This paper offers a unification and systematization of the grounding approaches to truth, denotation, classes and abstraction. Its main innovation is a method for “kleenifying” bivalent semantics so as to ensure that the trivalent semantics used for various linguistic elements are perfectly analogous to the semantics used by Kripke, rather than relying on intuition to achieve similarity. The focus is on generalizing strong Kleene semantics, but one section is devoted to supervaluation, and the unification method (...) also extends to weak Kleene semantics. (shrink)

Kripke’s theory of truth succeeded in providing a trivalent semantics for a language that contains its own truth predicate and means of self-reference; but it did so by radically restricting the expressive power of the logic. In Kripke’s analysis, the Liar (e.g. This very sentence is not true) receives the indeterminate truth value; but the logic cannot express the fact that the Liar is something other than true: in order to do so, a weak negation not* would be (...) needed, but it would also make the logic inconsistent (because the ‘Super Liar’ This very sentence is not* true could not be assigned any truth value). Taking a hint from the quantificational form of the problematic sentences (… is something other than true), we define a hierarchy of negations which each quantifies over a domain of truth values, assimilated to ordinals. The resulting logic has as many negations and truth values as there are ordinals. Unlike Kripke’s logic, it enjoys a form of expressive completeness. And although the logic is not monotonic, we show that under broad conditions we can construct a variety of fixed points; one of them emulates Kripke’s ‘least fixed point’, while another one assigns a different truth value to each Super Liar. (shrink)

Draft of a paper for the Sinn und Bedeutung 14 conference. Explains how to capture the link between conditionals the probability of indicative conditionals and conditional probability using a classical semantics for conditionals. (Note: some introductory material is shared with a twin paper, "Capturing the Relationship Between Conditionals and Conditional Probability with a Trivalent Semantics".).

It has been argued that an objectual semantics for plurals falls victim to Russell’s paradox, and that a nominalistic semantics should therefore be preferred (Boolos 1984); similar considerations have sometimes been extended to other types of abstract reference, in particular to property talk. We suggest that this line of argument is mistaken: deeply entrenched features of ordinary language guarantee that property and plural talk do give rise to paradoxes. In the case of properties, the grammar of English is (...) untyped, which makes it straightforward to generate a paradox. In the case of plurals, it is badly typed, which means that paradoxes can be generated, but in complicated ways. In both cases, the problem is not to avoid paradoxes but to model them. We conclude that an objectual semantics is entirely in order, but that it must be developed within a trivalent semantics suited to a paradoxical object language. (shrink)

This article starts off with the observation that in certain cases, presuppositions triggered by an element inside a question nucleus may fail to project. In fact, in what looks like coordinated structures involving polar questions, presupposition projection patterns are exactly parallel to what is observed when the corresponding assertions are coordinated. The article further shows that these facts do not fall out straightforwardly from existing theories of polar questions, (apparent) coordinations of questions, and presupposition projection. It then proposes a (...) class='Hi'>trivalent extension of inquisitive semantics such that the observed pattern can be understood in terms of existing theories of presupposition projection. The proposal has the following properties: (a) apparent coordinations of questions are indeed coordinations of questions, and (b) the semantic denotation of polar questions is asymmetric with respect to the “yes” and “no” answers. (shrink)

Since Fodor 1970, negation has worn a Homogeneity Condition to the effect that homogeneous predicates, ) denote homogeneously—all or nothing —to characterize the meaning of – when uttered out-of-the blue, in contrast to –:The mirrors are smooth. The mirrors are not smooth. The mirrors circle the telescope’s reflector. The mirrors do not circle the telescope’s reflector. It has been a problem for philosophical logic and for the semantics of natural language that – appear to defy the Principle of Excluded (...) Middle while – do not—Smooth ¬Smooth Circle ¬Circle. An impoverished logical form – has been the occasion to embellish all else—Boolean algebra, lexical presuppositions, Strongest Meaning Hypothesis, trivalence, supervaluation, double strengthening, etc., enriching the semantics and pragmatics with what remains a special theory of negation, which may be dismissed when the logical syntax and semantics of negation reflects that negated sentences are also tensed sentences. (shrink)

The prime purpose of this paper is, first, to restore to discourse-bound occasion sentences their rightful central place in semantics and secondly, taking these as the basic propositional elements in the logical analysis of language, to contribute to the development of an adequate logic of occasion sentences and a mathematical foundation for such a logic, thus preparing the ground for more adequate semantic, logical and mathematical foundations of the study of natural language. Some of the insights elaborated in this (...) paper have appeared in the literature over the past thirty years, and a number of new developments have resulted from them. The present paper aims atproviding an integrated conceptual basis for this new development in semantics. In Section 1 it is argued that the reduction by translation of occasion sentences to eternal sentences, as proposed by Russell and Quine, is semantically and thus logically inadequate. Natural language is a system of occasion sentences, eternal sentences being merely boundary cases. The logic hasfewer tasks than is standardly assumed, as it excludes semantic calculi, which depend crucially on information supplied by cognition and context and thus belong to cognitive psychology rather than to logic. For sentences to express a proposition and thus be interpretable and informative, they must first be properly anchored in context. A proposition has a truth value when it is, moreover, properly keyed in the world, i.e. is about a situation in the world. Section 2 deals with the logical properties of natural language. It argues that presuppositional phenomena require trivalence and presents the trivalent logic PPC3, with two kinds of falsity and two negations. It introduces the notion of -space for a sentence A as the basis of logical model theory, and the notion of P A /, functioning as a `private' subuniverse for A/A. The trivalent Kleene calculus is reinterpreted as a logical account of vagueness, rather than of presupposition. PPC3 and the Kleene calculus are refinements of standard bivalent logic and can be combined into one logical system. In Section 3 the adequacy of PPC3 as a truth-functional model of presupposition is considered more closely and given a Boolean foundation. In a noncompositional extended Boolean algebra, three operators are defined: 1a for the conjoined presuppositions of a, ã for the complement of a within 1a, and â for the complement of 1a within Boolean 1. The logical properties of this extended Boolean algebra are axiomatically defined and proved for all possible models. Proofs are provided of the consistency and the completeness of the system. Section 4 is a provisional exploration of the possibility of using the results obtained for a new discourse-dependent account of the logic of modalities in natural language. The overall result is a modified and refined logical and model-theoretic machinery, which takes into account both the discourse-dependency of natural language sentences and the necessity of selecting a key in the world before a truth value can be assigned. (shrink)

This paper is a response to Enguehard (Natural Language Semantics 29(4):527–578, 2021 ), who observes that presuppositions project in the same way from coordinations of declaratives and coordinations of polar questions, but existing mechanisms of projection from declaratives (e.g. Schlenker in Theoretical Linguistics 34(3):157–212, 2008, Semantics and Pragmatics 2:1–78, 2009 ) fail to scale to questions. His solution involves specifying a trivalent inquisitive semantics for (coordinations of) questions that bakes the various asymmetries of presupposition projection into (...) the lexical entry of conjunction/disjunction. However, we argue that such a move faces both theoretical and empirical issues. Instead, we show that the data can be handled without moving to such an asymmetric inquisitive denotation, by adapting the novel pragmatic theory of _Limited Symmetry_ (Kalomoiros in Proceedings of the 52nd annual meeting of the North East linguistic society, GLSA, Amherst, 2022 ) to an inquisitive framework in a way that leaves the underlying semantics for conjunction symmetric and bivalent, while deriving the projection data. (shrink)

Although it was traditionally thought that self-reference is a crucial ingredient of semantic paradoxes, Yablo (1993, 2004) showed that this was not so by displaying an infinite series of sentences none of which is self-referential but which, taken together, are paradoxical. Yablo's paradox consists of a countable series of linearly ordered sentences s(0), s(1), s(2),... , where each s(i) says: For each k > i, s(k) is false (or equivalently: For no k > i is s(k) true). We generalize Yablo's (...) results along two dimensions. First, we study the behavior of generalized Yablo-series in which each sentence s(i) has the form: For Q k > i, s(k) is true, where Q is a generalized quantifier (e.g., no, every, infinitely many, etc). We show that under broad conditions all the sentences in the series must have the same truth value, and we derive a characterization of those values of Q for which the series is paradoxical. Second, we show that in the Strong Kleene trivalent logic Yablo's results are a special case of a more general fact: under certain conditions, any semantic phenomenon that involves self-reference can be emulated without self-reference. Various translation procedures that eliminate self-reference from a non-quantificational language are defined and characterized. An Appendix sketches an extension to quantificational languages, as well as a new argument that Yablo's paradox and the translations we offer do not involve self-reference. (shrink)

The present study reiterates one of the main ideas that we exposed in 1983, in the paper “Din fals rezultă orice” (“From False Follows Anything”), published in the volume Întemeieri raţionale în filosofia ştiinţei (Rational Foundations in the Philosophy of Science) when we referred to the notion of semi-truth, as a third alethic value, placed between „truth” and „falsehood”, thus contributing to the functionality of the trivalent logic. Now we analyze the conceptions of Petre Botezatu, Mario Bunge, Karl R. (...) Popper and Nicholas Rescher, in order to argue that it is important not to identify the epistemological term „probable” (= uncertain) with the semantic term „partial” or „approximate”, when we speak about the concept of truth. (shrink)

Saul Kripke’s work on the semantics of modal logics is well known, unlike his work on Anderson and Belnap’s system E of Entailment (a modal relevance logic), which included his proof of the decidability of its implicational fragment E_>, and also a counterexample to the conjecture of Belnap that E_> is the intersection of the implicational fragments of the relevance logic R and the modal logic S4. This led to Storrs McCall’s suggesting that the “mingle” axiom might be added (...) to E_>, and that this system might be used instead of S4_>. We give a counterexample to this conjecture. We also disprove the conjecture Anderson and Belnap attribute to McCall, in which “restricted mingle” is added to E_>. We use a modal extension of the lattice M_0 and follow ideas of Meyer. In the 1970s, Dunn showed that RM (R with the mingle axiom) can be modeled using a binary accessibility relation, like the accessibility relation in Kripke’s semantics for normal modal logics and his semantics for intuitionistic logic. Dunn also gave a variant interpretation for EM (E with the mingle axiom). We explore some other variations of these binary relational semantics. (shrink)

Psychological research on people’s understanding of natural language connectives has traditionally used truth table tasks, in which participants evaluate the truth or falsity of a compound sentence given the truth or falsity of its components in the framework of propositional logic. One perplexing result concerned the indicative conditional if A then C which was often evaluated as true when A and C are true, false when A is true and C is false but irrelevant“ (devoid of value) when A is (...) false (whatever the value of C). This was called the “psychological defective table of the conditional.” Here we show that far from being anomalous the “defective” table pattern reveals a coherent semantics for the basic connectives of natural language in a trivalent framework. This was done by establishing participants’ truth tables for negation, conjunction, disjunction, conditional, and biconditional, when they were presented with statements that could be certainly true, certainly false, or neither. We review systems of three-valued tables from logic, linguistics, foundations of quantum mechanics, philosophical logic, and artificial intelligence, to see whether one of these systems adequately describes people’s interpretations of natural language connectives. We find that de Finetti’s (1936/1995) three-valued system is the best approximation to participants’ truth tables. (shrink)

The prime purpose of this paper is, first, to restore to discourse-bound occasion sentences their rightful central place in semantics and secondly, taking these as the basic propositional elements in the logical analysis of language, to contribute to the development of an adequate logic of occasion sentences and a mathematical (Boolean) foundation for such a logic, thus preparing the ground for more adequate semantic, logical and mathematical foundations of the study of natural language. Some of the insights elaborated in (...) this paper have appeared in the literature over the past thirty years, and a number of new developments have resulted from them. The present paper aims at providing an integrated conceptual basis for this new development in semantics. In Section 1 it is argued that the reduction by translation of occasion sentences to eternal sentences, as proposed by Russell and Quine, is semantically and thus logically inadequate. Natural language is a system of occasion sentences, eternal sentences being merely boundary cases. The logic has fewer tasks than is standardly assumed, as it excludes semantic calculi, which depend crucially on information supplied by cognition and context and thus belong to cognitive psychology rather than to logic. For sentences to express a proposition and thus be interpretable and informative, they must first be properly anchored in context. A proposition has a truth value when it is, moreover, properly keyed in the world, i.e. is about a situation in the world. Section 2 deals with the logical properties of natural language. It argues that presuppositional phenomena require trivalence and presents the trivalent logic ${\rm PPC}_{3}$ , with two kinds of falsity and two negations. It introduces the notion of Σ-space for a sentence A (or / A /, the set of situations in which A is true) as the basis of logical model theory, and the notion of / ${\bf P}^{A}$ / (the Σ-space of the presuppositions of A), functioning as a 'private' subuniverse for / A /. The trivalent Kleene calculus is reinterpreted as a logical account of vagueness, rather than of presupposition. ${\rm PPC}_{3}$ and the Kleene calculus are refinements of standard bivalent logic and can be combined into one logical system. In Section 3 the adequacy of ${\rm PPC}_{3}$ as a truth-functional model of presupposition is considered more closely and given a Boolean foundation. In a noncompositional extended Boolean algebra, three operators are defined: $1_{a}$ for the conjoined presuppositions of a, ã for the complement of a within $1_{a}$ , and â for the complement of $1_{a}$ within Boolean 1. The logical properties of this extended Boolean algebra are axiomatically defined and proved for all possible models. Proofs are provided of the consistency and the completeness of the system. Section 4 is a provisional exploration of the possibility of using the results obtained for a new discourse-dependent account of the logic of modalities in natural language. The overall result is a modified and refined logical and model-theoretic machinery, which takes into account both the discourse-dependency of natural language sentences and the necessity of selecting a key in the world before a truth value can be assigned. (shrink)

In this paper, we use antecedent-final conditionals to formulate two problems for parsing-based theories of presupposition projection and triviality of the kind given in Schlenker 2009. We show that, when it comes to antecedent-final conditionals, parsing-based theories predict filtering of presuppositions where there is in fact projection, and triviality judgments for sentences which are in fact felicitous. More concretely, these theories predict that presuppositions triggered in the antecedent of antecedent-final conditionals will be filtered (i.e. will not project) if the negation (...) of the consequent entails the presupposition. But this is wrong: John isn’t in Paris, if he regrets being in France intuitively presupposes that John is in France, contrary to this prediction. Likewise, parsing-based approaches to triviality predict that material entailed by the negation of the consequent will be redundant in the antecedent of the conditional; but John isn’t in Paris, if he’s in France and Mary is with him is intuitively felicitous, contrary to these predictions. Importantly, given that the trigger appears in sentence-final position, both incremental (left-to-right) and symmetric versions of such theories make the same predictions. These data constitute a challenge to the idea that presupposition projection and triviality should be computed on the basis of parsing. This issue is important because it relates to the more general question as to whether presupposition and triviality calculation should be thought of as a pragmatic post-compositional phenomenon or as part of compositional semantics (as in the more traditional dynamic approaches). We discuss a solution which allows us to maintain the parsing-based pragmatic approach; it is based on an analysis of conditionals which incorporates a presupposition that their antecedent is compatible with the context, together with a modification to Schlenker’s (2009) algorithm for calculating local contexts so that it takes into account presupposed material. As we will discuss, this solution works within a framework broadly similar to that of Schlenker’s (2009), but it doesn’t extend in an obvious way to other parsing-based accounts (e.g. parsing-based trivalent approaches). We conclude that a parsing-based theory can be maintained, but only if we adopt a substantial change of perspective on the framework. (shrink)

The paper’s novelty is in combining two comparatively new fields of research: non-transitive logic and the proof method of correspondence analysis. To be more detailed, in this paper the latter is adapted to Weir’s non-transitive trivalent logic \({\mathbf{NC}}_{\mathbf{3}}\). As a result, for each binary extension of \({\mathbf{NC}}_{\mathbf{3}}\), we present a sound and complete Lemmon-style natural deduction system. Last, but not least, we stress the fact that Avron and his co-authors’ general method of obtaining _n_-sequent proof systems for any _n_-valent (...) logic with deterministic or non-deterministic matrices is not applicable to \({\mathbf{NC}}_{\mathbf{3}}\) and its binary extensions. (shrink)

In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classical notion, and two dual notions simultaneously defined in terms (...) of it, which we call tolerant truth and strict truth. We characterize the space of consequence relations definable in terms of those and discuss the kind of solution this gives to the sorites paradox. We discuss some applications of the framework to the pragmatics and psycholinguistics of vague predicates, in particular regarding judgments about borderline cases. (shrink)

In this dissertation, I argue that vagueness is a metaphysical phenomenon---that properties and objects can be vague---and propose a trivalent theory of vagueness meant to account for the vagueness in the world. In the first half, I argue against the theories that preserve classical logic. These theories include epistemicism, contextualism, and semantic nihilism. My objections to these theories are independent of considerations of the possibility that vagueness is a metaphysical phenomenon. However, I also argue that these theories are not (...) capable of accommodating metaphysical vagueness. As I move into my positive theory, I first argue for the possibility of metaphysical vagueness and respond to objections that charge that the world cannot be vague. One of these objections is Gareth Evans' much-disputed argument that vague identities are impossible. I then describe what I call the logic of states of affairs. The logic of states of affairs has as its atomic elements states of affairs that can obtain, unobtain, or be indeterminate. Finally, I argue that the logic of states of affairs is a better choice for a theory of vagueness than other logics that could accommodate metaphysical vagueness such as supervaluationism and degree theories. Preference should be given to the logic of states of affairs because it provides a better explanation of higher-order vagueness and does a better job of matching our ordinary understandings of logical operators than supervaluationism does and because it provides a more general account of indeterminacy than the account given by degree theories. Advisor: Reina Hayaki. (shrink)