Many competent speakers initially judge that (i) is true and (ii) is false, though they know that (iii) is true. (i) Superman leaps more tall buildings than Clark Kent. (ii) Superman leaps more tall buildings than Superman. (iii) Superman is identical with Clark Kent. Semantic explanations of these intuitions say that (i) and (ii) really can differ in truthvalue. Pragmatic explanations deny this, and say that the intuitions are due to misleading implicatures. This paper argues that both explanations are incorrect. (...) (i) and (ii) cannot differ in truth-value, yet the intuitions are not due to implicatures, but rather to mistakes in evaluating (i) and (ii). (shrink)

I discuss what I call practical Moore sentences: sentences like ‘You must close your door, but I don’t know whether you will’, which combine an order together with an avowal of agnosticism about whether the order will be obeyed. I show that practical Moore sentences are generally infelicitous. But this infelicity is surprising: it seems like there should be nothing wrong with giving someone an order while acknowledging that you do not know whether it will obeyed. I (...) suggest that this infelicity points to a striking psychological fact, with potentially broad ramifications concerning the structure of norms of speech acts: namely, when giving an order, we must act as if we believe we will be obeyed. (shrink)

Substitution and simple sentences -- Simple sentences and semantics -- Simple sentences and implicatures -- The enlightenment problem and a common assumption -- Abandoning (EOI) -- Beyond matching propositions -- App. A : extending the account -- App. B : belief reporting.

Conventionalism about mathematics claims that mathematical truths are true by linguistic convention. This is often spelled out by appealing to facts concerning rules of inference and formal systems, but this leads to a problem: since the incompleteness theorems we’ve known that syntactic notions can be expressed using arithmetical sentences. There is serious prima facie tension here: how can mathematics be a matter of convention and syntax a matter of fact given the arithmetization of syntax? This challenge has been pressed (...) in the literature by Hilary Putnam and Peter Koellner. In this paper I sketch a conventionalist theory of mathematics, show that this conventionalist theory can meet the challenge just raised , and clarify the type of mathematical pluralism endorsed by the conventionalist by introducing the notion of a semantic counterpart. The paper’s aim is an improved understanding of conventionalism, pluralism, and the relationship between them. (shrink)

We propose a model for belief which is free of presuppositions. Current models for belief suffer from two difficulties. One is the well known problem of logical omniscience which tends to follow from most models. But a more important one is the fact that most models do not even attempt to answer the question what it means for someone to believe something, and justwhatit is that is believed. We provide a flexible model which allows us to give meaning to beliefs (...) in general contexts, including the context of animal belief (where action is usually our only clue to a belief), and of human belief which is expressed in language. (shrink)

Is it morally acceptable to use artificial intelligence (AI) in the form of computer-driven algorithms in the determination of sentences on those who have broken the law? If so, how should such algorithms be used? This book is the first collective work devoted exclusively to the ethical and penal theoretical considerations of the use of AI at sentencing. It deals with a wide range of highly pertinent issues, such as the following: Should algorithmic-based decision-making be transparent? If so, what (...) does this mean and why is it important? Does a conflict between algorithmic transparency and algorithmic accuracy always constitute a moral dilemma? What does it mean to require that algorithmic sentencing decisions should be fair? When should an algorithm be regarded as discriminatory? Is it acceptable to use algorithms to produce risk assessments of future criminal conduct? Can algorithms ever be used in the exercise of mercy? Should AI only be used to guide judicial decision-making or could it ever be justified to replace a human sentencing judge with a robojudge? (shrink)

This paper argues for the hypothesis of direct compositionality (as in, e.g., Montague 1974), according to which the combinatory syntactic rules specify a set of well-formed expressions while the semantic combinatory rules work in tandem to directly supply a model-theoretic interpretation to each expression as it is "built" in the syntax. (This thus obviates the need for any level like LF and, concomitantly, for any rules mapping surface structures to such a level.) I focus here on one related group of (...) phenomena: the interaction of "paycheck" pronouns with Weak Crossover effects and i-within-i effects. These interactions were studied in Jacobson (1977) as they show up in Back-Peters sentences. There I argued that these interactions show that paycheck pronouns have a complex representation at LF; here I show that all of the observations in this earlier work are compatible with the hypothesis of direct compositionality. The key tool is the adoption of a variation-free semantics (a semantics which makes no use of variables as part of the semantic machinery). In addition to the general consequences for the syntax/semantics interface, there are two other main results. First, I provide new arguments for a variable-free semantics. For example, it will be shown that under this view the paycheck reading of a pronoun comes for free; most other theories posit additional mechanisms and/or an additional lexical meaning for pronouns, and thus paycheck and regular pronouns are only accidentally homophonous. Second, I reiterate one of the central points in Jacobson (1977): this is that the first pronoun in a Bach-Peters sentence is indeed a paycheck pronoun, and hence nothing special needs to be said about these sentences nor does any new machinery need to be invoked for them. (shrink)

We study the relationships between two clusters of axiomatizations of Kripke’s fixed-point models for languages containing a self-applicable truth predicate. The first cluster is represented by what we will call ‘\-like’ theories, originating in recent work by Halbach and Horsten, whose axioms and rules are all valid in fixed-point models; the second by ‘\-like’ theories first introduced by Solomon Feferman, that lose this property but reflect the classicality of the metatheory in which Kripke’s construction is carried out. We show that (...) to any natural system in one cluster—corresponding to natural variations on induction schemata—there is a corresponding system in the other proving the same sentences true, addressing a problem left open by Halbach and Horsten and accomplishing a suitably modified version of the project sketched by Reinhardt aiming at an instrumental reading of classical theories of self-applicable truth. (shrink)

Michael Dummett has nicely expressed a rather widespread doctrine about the primacy of sentences. He writes: "you cannot DO anything with a word — cannot effect any conventional act by uttering it — save by uttering some sentence containing that word...". In this paper we argue that this doctrine is mistaken: it is not only sentences, but also ordinary words and phrases which can be used in isolation. The argument involves two steps. First: we show — using Sperber (...) and Wilson's relevance theory — that an utterance of "John's father" could COMMUNICATE a proposition. Second: we point out that, in this context, this proposition would be asserted rather than merely implicated. Because there is nothing importantly idiosyncratic about the phrase "John's father", we infer that words and phrases generally can be used in isolation to make assertions. (shrink)

There are many analogies between medical and judicial practice. This article explores one such analogy, between “medicalization” and “criminalization.” Specifically, drawing on an analogy between a judge’s speech act of delivering a verdict and a physician’s speech act of giving a diagnosis, it suggests a novel account of the phenomenon of “overdiagnosis.” Using this approach, we can make some headway in understanding debates over the early detection of cancer. The final section outlines the relationship between this approach and familiar debates (...) in philosophy of medicine on the nature of disease and in philosophy of science on the “value-free ideal.”. (shrink)

We calculate the complexity of Scott sentences of scattered linear orders. Given a countable scattered linear order L of Hausdorff rank $\alpha $ we show that it has a ${d\text {-}\Sigma _{2\alpha +1}}$ Scott sentence. It follows from results of Ash [2] that for every countable $\alpha $ there is a linear order whose optimal Scott sentence has this complexity. Therefore, our bounds are tight. We furthermore show that every Hausdorff rank 1 linear order has an optimal ${\Pi ^{\mathrm (...) {c}}_{3}}$ or ${d\text {-}\Sigma ^{\mathrm {c}}_{3}}$ Scott sentence and give a characterization of those linear orders of rank $1$ with ${\Pi ^{\mathrm {c}}_{3}}$ optimal Scott sentences. At last we show that for all countable $\alpha $ the class of Hausdorff rank $\alpha $ linear orders is $\boldsymbol {\Sigma }_{2\alpha +2}$ complete and obtain analogous results for index sets of computable linear orders. (shrink)

This paper challenges defenders/advocates of the semantic-completeness route towards gluts to explain, in simple and plausible terms, why the ‘trivializer paradox’, framed in terms of closure relatives on theories, fails to undermine their argument.

In this paper, we study the employment of $\Sigma _1$ -sentences with certificates, i.e., $\Sigma _1$ -sentences where a number of principles is added to ensure that the witness is sufficiently number-like. We develop certificates in some detail and illustrate their use by reproving some classical results and proving some new ones. An example of such a classical result is Vaught’s theorem of the strong effective inseparability of $\mathsf {R}_0$. We also develop the new idea of a theory (...) being $\mathsf {R}_{0\mathsf {p}}$ -sourced. Using this notion, we can transfer a number of salient results from $\mathsf {R}_0$ to a variety of other theories. (shrink)

This paper defends scientific realism from the pessimistic meta-induction from past reference failure. It allows that a descriptive theory of reference implies that scientific terms characteristically fail of determinate reference. But it argues that a descriptive theory of reference also implies an equivalence between scientific theories and quantificational claims in the style of Ramsey. Since these quantificational claims do not use any of the referentially suspect scientific terms, they can be approximately true even when those terms fail to refer determinately.Keywords: (...) Science; Realism; Ramsey sentences; Approximate truth; Reference. (shrink)

This paper is concerned with the relationship between the semantics of specificational and predicational sentences and the Connectivity effects they display. It discusses the advantages and disadvantages of semantic and syntactic approaches to Connectivity (the ‘unconstrained-be theory’, the ‘question-in-disguise theory’, and the ‘unclefting theory’), concluding that a semantic theory of Connectivity is not only preferable, but necessary. The paper also discusses the implications of such a move regarding Binding phenomena (i.e., Principle A, B, and C effects): adopting a semantic (...) theory of Connectivity requires a theory of Binding which is different from the standard GB Binding Theory. (shrink)

Intuitionistic dependence logic was introduced by Abramsky and Väänänen [1] as a variant of dependence logic under a general construction of Hodges’ (trump) team semantics. It was proven that there is a translation from intuitionistic dependence logic sentences into second order logic sentences. In this paper, we prove that the other direction is also true, therefore intuitionistic dependence logic is equivalent to second order logic on the level of sentences.

This paper is concerned with notions of consequence. On the one hand, we study admissible consequence, specifically for substitutions of Σ 1 0 -sentences over Heyting arithmetic . On the other hand, we study preservativity relations. The notion of preservativity of sentences over a given theory is a dual of the notion of conservativity of formulas over a given theory. We show that admissible consequence for Σ 1 0 -substitutions over HA coincides with NNIL -preservativity over intuitionistic propositional (...) logic . Here NNIL is the class of propositional formulas with no nestings of implications to the left . The identical embedding of IPC -derivability into a consequence relation has in many cases a left adjoint. The main tool of the present paper will be an algorithm to compute this left adjoint in the case of NNIL -preservativity. In the last section, we employ the methods developed in the paper to give a characterization the closed fragment of the provability logic of HA. (shrink)

Equative sentences like Hesperus is Phosphorus are interesting not only because they convey information about identity but also because of the atypical linguistic means they employ to do so. An equative sentence appears to be composed of a pair of referential singular terms (grammatical arguments) and to lack a logical predicate. Yet in the absence of such a predicate, how can equatives constitute well-formed, meaningful sentences? This rarely acknowledged “problem of symmetry” is assumed to have an obvious predicativist (...) solution, according to which equatives would actually contain some predicative constituent(s). We expose the problem of symmetry, critically review various predicativist solutions, and outline an alternative hypothesis according to which equatives are distinctive both syntactically, by virtue of their symmetrical [DP DP] structure, and semantically, by virtue of their meaning corresponding to an instruction to perform a mental act of identification rather than to a traditional predication (the ascription of a property or relation). (shrink)

Words stand for things of various kinds and for various kinds of things. Because words do this, the sentences made up of words mean what they do, and are capable of expressing our thoughts, our beliefs and conjectures, desires and wishes. This simple idea seems right to me, but it flies in the face of formidable authority. In a famous passage in “Reality without Reference,” Donald Davidson criticizes what he calls the “building-block theory:”.

In the present paper I want to do two things. First, I want to discuss Ramsey’s own views of Ramsey-sentences. This, it seems to me, is an important issue not just (or mainly) because of its historical interest. It has a deep philosophical significance. Addressing it will enable us to see what Ramsey’s lasting contribution in the philosophy of science was as well as what its relevance to today’s problems is. Since the 1950s, where the interest in Ramsey’s views (...) has mushroomed, there have been a number of different ways to read Ramsey’s views and to reconstruct Ramsey’s project. The second aim of the present paper is to discuss the most significant and controversial of this reconstruction, viz., structuralism. After some discussion of the problems of structuralism in the philosophy of science, as this was exemplified in Bertrand Russell’s and Grover Maxwell’s views and has re-appeared in Elie Zahar’s and John Worrall’s thought, I will argue that, for good reasons, Ramsey did not see his Ramsey-sentences as part of some sort of structuralist programme. I will close with an image of scientific theories that Ramsey might have found congenial. I will call it Ramseyan humility. (shrink)

The paper proposes the first unified account of deictic/sentence-external and sentence-internal readings of singular different. The empirical motivation for such an account is provided by a cross-linguistic survey and an analysis of the differences in distribution and interpretation between singular different, plural different and same (singular or plural) in English. The main proposal is that distributive quantification temporarily makes available two discourse referents within its nuclear scope, the values of which are required by sentence-internal uses of singular different to be (...) distinct, much as its deictic uses require the values of two discourse referents to be distinct. Thus, we take sentence-internal readings to be a form of ‘association with distributivity’ that is similar to association with focus. The contrast between singular different, plural different and same is explained in terms of several kinds of quantificational distributors that license their internal readings. The analysis is executed in a stack-based dynamic system couched in type logic, so we get compositionality in the usual Montagovian way. Quantificational subordination and dependent indefinites in various languages provide additional motivation for the account. Investigating the connections between items with sentence-internal readings and the quantificational licensors of these readings opens up a larger project of formally investigating (i) the typology of quantificational distributors and distributivity-dependent items and (ii) the fine-grained contexts of evaluation needed to capture this typological variation. (shrink)

We prove that every quasi-Hopfian finitely presented structure _A_ has a _d_- \(\Sigma _2\) Scott sentence, and that if in addition _A_ is computable and _Aut_(_A_) satisfies a natural computable condition, then _A_ has a computable _d_- \(\Sigma _2\) Scott sentence. This unifies several known results on Scott sentences of finitely presented structures and it is used to prove that other not previously considered algebraic structures of interest have computable _d_- \(\Sigma _2\) Scott sentences. In particular, we show (...) that every right-angled Coxeter group of finite rank has a computable _d_- \(\Sigma _2\) Scott sentence, as well as any strongly rigid Coxeter group of finite rank. Finally, we show that the free projective plane of rank 4 has a computable _d_- \(\Sigma _2\) Scott sentence, thus exhibiting a natural example where the assumption of quasi-Hopfianity is used (since this structure is not Hopfian). (shrink)

A search for the terms ‘acceptability judgment tasks’ & ‘language’ and ‘grammaticality judgment tasks’ & ‘language’ produces results which report findings that are based on the exact same elicitation technique. Although certain scholars have argued that acceptability and grammaticality are two separable notions that refer to different concepts, there are contexts in which the two terms are used interchangeably. The present work shows that these two notions and their scales do not coincide: there are sentences that are acceptable, even (...) though they are ungrammatical, and sentences that are unacceptable, despite being grammatical. First we adduce a number of examples for both cases, including grammatical illusions, violations of Identity Avoidance, and sentences that involve a level of processing complexity that overloads the cognitive parser and tricks it into (un)acceptability. We then discuss whether the acceptability of grammatically ill-formed sentences entails that we actually assign a meaning to them. Last, it is shown that there are n ways of unacceptability, and two ways of ungrammaticality, in the absolute and the relative sense. Since the use of the terms ‘acceptable’ and ‘grammatical’ is often found in experiments that constitute the core of the evidential base of linguistics, disentangling their various uses is likely to aid the field reach a better level of terminological clarity. (shrink)

A formal system is studied having both sentences and diagrams as well-formed representations. Proofs in the system allow inference back and forth between sentences and diagrams, as well as between diagrams and diagrams, and between sentences and sentences. This sort of heterogeneous system is of interest because external representations other than linguistic ones occur commonly in actual reasoning in conjunction with language. Syntax, semantics, and rules of inference for the system are given and it is shown (...) to be sound and complete. (shrink)

We study possible Scott sentence complexities of linear orderings using two approaches. First, we investigate the effect of the Friedman–Stanley embedding on Scott sentence complexity and show that it only preserves $\Pi ^{\mathrm {in}}_{\alpha }$ complexities. We then take a more direct approach and exhibit linear orderings of all Scott sentence complexities except $\Sigma ^{\mathrm {in}}_{3}$ and $\Sigma ^{\mathrm {in}}_{\lambda +1}$ for $\lambda $ a limit ordinal. We show that the former cannot be the Scott sentence complexity of a linear (...) ordering. In the process we develop new techniques which appear to be helpful to calculate the Scott sentence complexities of structures. (shrink)

The influential proposal that the analytical component of a theory is captured by its ‘Carnap sentence’ is critically scrutinized. A counterexample which makes the suggestion problematic is presented.

We seem to talk about repeatable artworks, like symphonies, films, and novels, all the time. We say things like, "The Moonlight Sonata has three movements" and "Duck Soup makes me laugh". How are these sentences to be understood? We argue against the simple subject/predicate view, on which the subjects of the sentences refer to individuals and the sentences are true iff the referents of the subjects have the properties picked out by the predicates. We then consider two (...) alternative responses that involve reading these sentences as generics, similar to "The polar bear has four paws". The first response takes these sentences to be about kinds, and the second takes the relevant noun-phrases to act as predicates. We reject these accounts, but offer a third alternative which is informed by both, and which enables us to deny the existence of repeatable artworks while endorsing the truth of sentences seemingly about them. (shrink)

It is often thought that questions of reference are crucial in assessing scientific realism, construed as the view that successful theories are at least approximately true descriptions of the unobservable; realism is justified only if terms in empirically successful theories generally refer to genuinely existing entities or properties. In this paper this view is questioned. First, it is argued that there are good reasons to think that questions of realism are largely decided by convention and carry no epistemic significance. An (...) alternative conception of realism is then proposed, which focuses on the Ramsey sentences of scientific theories, constructed in the manner of David Lewis's 'How to define theoretical terms'. It is argued that because the Ramsey sentence of a theory preserves the epistemically significant part of the theory's content without generating commitments to any particular conclusions about reference, the realism issue is better addressed by asking whether Ramsey sentences of theories, rather than the theories themselves, are approximately true. (shrink)

Mandarin Chinese exhibits two paradigms of conditionals with indefinite wh-words that have the semantics of donkey sentences, represented by ‘bare conditionals’ on the one hand and ruguo- and dou-conditionals on the other. The bare conditionals require multiple occurrences of wh-words, disallowing the use of overt or covert anaphoric elements in the consequent clause, whereas the ruguo- and dou-conditionals present a completely opposite pattern. We argue that the bare conditionals are cases of unselective binding par excellence (Heim 1982, Kamp 1981) (...) while the ruguo- and dou-conditionals are most naturally accounted for with the traditional E-type pronoun strategy of Evans (1980). We thus argue partly for a return to the E-type strategy (along with Heim 1990) but maintain the need for unselective binding in UG (cf. Kratzer 1989, Chierchia 1992). It is further shown that these two paradigms do not differ with respect to the proportion problem and the distribution of symmetric and asymmetric readings of Kadmon (1987), though they differ with respect to ∀ and ∃ readings (discussed in Chierchia 1992) in a non-trivial way that provides further support for the proposed approach. Finally, evidence is given that the bare conditionals should be kept apart from correlative constructions in languages like Hindi, and treated differently from the latter. (shrink)

For a computable structure A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{A}}$$\end{document}, there may not be a computable infinitary Scott sentence. When there is a computable infinitary Scott sentence φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varphi}$$\end{document}, then the complexity of the index set I\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${I}$$\end{document} is bounded by that of φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varphi}$$\end{document}. There are results giving “optimal” Scott sentences (...) for structures of various familiar kinds. These results have been driven by the thesis that the complexity of the index set should match that of an optimal Scott sentence. In this note, it is shown that the thesis does not always hold. For a certain subgroup of Q\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{Q}}$$\end{document}, there is no computable d-Σ2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma_2}$$\end{document} Scott sentence, even though the index set is d-Σ20\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma^0_2}$$\end{document}. (shrink)

The American Sign Language Sentence Reproduction Test (ASL-SRT) requires the precise reproduction of a series of ASL sentences increasing in complexity and length. Error analyses of such tasks provides insight into working memory and scaffolding processes. Data was collected from three groups expected to differ in fluency: deaf children, deaf adults and hearing adults, all users of ASL. Quantitative (correct/incorrect recall) and qualitative error analyses were performed. Percent correct on the reproduction task supports its sensitivity to fluency as test (...) performance clearly differed across the three groups studied. A linguistic analysis of errors further documented differing strategies and bias across groups. Subjects' recall projected the affordance and constraints of deep linguistic representations to differing degrees, with subjects resorting to alternate processing strategies when they failed to recall the sentence correctly. A qualitative error analysis allows us to capture generalizations about the relationship between error pattern and the cognitive scaffolding, which governs the sentence reproduction process. Highly fluent signers and less-fluent signers share common chokepoints on particular words in sentences. However, they diverge in heuristic strategy. Fluent signers, when they make an error, tend to preserve semantic details while altering morpho-syntactic domains. They produce syntactically correct sentences with equivalent meaning to the to-be-reproduced one, but these are not verbatim reproductions of the original sentence. In contrast, less-fluent signers tend to use a more linear strategy, preserving lexical status and word ordering while omitting local inflections, and occasionally resorting to visuo-motoric imitation. Thus, whereas fluent signers readily use top-down scaffolding in their working memory, less fluent signers fail to do so. Implications for current models of working memory across spoken and signed modalities are considered. (shrink)

Is native speaker variation in understanding complex sentences due to individual differences in working memory capacity or in syntactic competence? The answer to this question has very important consequences for both theoretical and applied concerns in linguistics and education. This book is distinctive in giving an historical and interdisciplinary perspective on the rule- based and experience-based debate and in supporting an integrated account. In the study reported here, variation was found to be due to differences in syntactic competence and (...) the author argues that sentence comprehension is a learned skill, displaying many of the general characteristics of cognitive skills. The book will be stimulating reading for psycholinguists, theoretical linguists, applied linguists and educators. (shrink)

This paper is about sentences of form To be human is to be an animal, To live is to fight, etc. I call them ‘infinitive sentences’. I define an augmented propositional language able to express them and give a matrix-based semantics for it. I also give a tableau proof system, called IL for Infinitive Logic. I prove soundness, completeness and a few basic theorems.

Two key questions that have plagued philosophical and linguistic debates on the meanings of conditionals are: (i) do conditionals have truth conditions? And if so, (ii) what are these truth conditions? This chapter begins by revisiting familiar arguments against the material conditional as a psychologically plausible basis for the semantics of conditionals. It also defends the assumption that conditionals lend themselves to a truth-conditional treatment, thus rejecting the no-truth value account of conditionals, arguing against those views that combat the psychological (...) plausibility of applying truth conditions to counterfactual conditionals. It then moves to current mainstream views on the semantics of conditionals, including the more philosophically-oriented Lewis-Stalnaker truth conditions using possible-worlds semantics, and the view most dominantly followed in linguistics, the ‘restrictor view’ from Kratzer. It settles on adopting Stalnakerian truth conditions for their flexibility in operating at different levels of representation, before finishing by reflecting on the scope of analysis of each of the main contenders. (shrink)