The world is not enough : situations, laws and assignments in counterfactual donkey sentences

Walker, Andreas

The world is not enough : situations, laws and assignments in counterfactual donkey sentences

Dateien

Walker_0-419712.pdfGröße: 726.94 KBDownloads: 541

Datum

2017

Open Access-Veröffentlichung

Open Access Green

Sammlungen

Linguistik

Publikationstyp

Dissertation

Publikationsstatus

Published

Zusammenfassung

In this thesis, I explore the phenomenon labeled counterfactual donkey sentences in the literature (van Rooij 2006, Wang 2009). Counterfactual donkeys combine the features of classical (indicative) donkey sentences (Geach 1962) with features of counterfactual conditionals: They feature an indefinite noun phrase in the antecedent which is optionally anaphorically picked up by a pronoun in the consequent, as well as the morphological marking of counterfactual conditionals, e.g., an additional past tense in the antecedent and "would" in the consequent in English.

(1) If John had owned a donkey, he would have beaten it.

Counterfactual donkeys present a problem for similarity-based approaches to counterfactuals (Lewis 1973), because they sometimes require us to consider possibilities beyond the most similar ones, as the classical theory would have it: (1), for example, allows us to draw conclusions about John's attitude towards all donkeys, not just the ones he owns in the most similar worlds. In this thesis, I compare three different solutions to this problem: First, I discuss a combination of Dynamic Predicate Logic (Groenendijk & Stokhof 1991) with a variably strict semantics (Lewis 1973) and a dynamic strict semantics respectively (von Fintel 1999), concluding that only the latter accounts for the full set of data. Second, I consider whether this solution can be extended to D-type theories (Elbourne 2005) and conclude that this requires us to make stipulations that are not required in the dynamic framework. Third, prompted by additional data that shows the same behaviour in the absence of an overt indefinite, I explore the option of accounting for counterfactual donkeys by switching to a situation-based framework that standardly considers a larger set of possibilities (Arregui 2009), optionally restricting this set by law-like regularities in the context. In evaluating all three proposals, I suggest that there are two possible further avenues: Exploring the empirical evidence for positing covert indefinites, allowing us to continue with a dynamic framework, or working out detailed accounts of pragmatic notions like relevance and law-like regularities, in order to precisify the situation-based framework.

Fachgebiet (DDC)

400 Sprachwissenschaft, Linguistik

Schlagwörter

donkey sentences, counterfactuals, similarity, semantics

Zitieren

ISO 690

WALKER, Andreas, 2017. The world is not enough : situations, laws and assignments in counterfactual donkey sentences [Dissertation]. Konstanz: University of Konstanz

BibTex

@phdthesis{Walker2017world-39760,
  year={2017},
  title={The world is not enough : situations, laws and assignments in counterfactual donkey sentences},
  author={Walker, Andreas},
  address={Konstanz},
  school={Universität Konstanz}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/39760">
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:language>eng</dc:language>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-07T06:11:56Z</dc:date>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39760/3/Walker_0-419712.pdf"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2017-08-07T06:11:56Z</dcterms:available>
    <dc:creator>Walker, Andreas</dc:creator>
    <dc:contributor>Walker, Andreas</dc:contributor>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/39760/3/Walker_0-419712.pdf"/>
    <dcterms:abstract xml:lang="eng">In this thesis, I explore the phenomenon labeled counterfactual donkey sentences in the literature (van Rooij 2006, Wang 2009). Counterfactual donkeys combine the features of classical (indicative) donkey sentences (Geach 1962) with features of counterfactual conditionals: They feature an indefinite noun phrase in the antecedent which is optionally anaphorically picked up by a pronoun in the consequent, as well as the morphological marking of counterfactual conditionals, e.g., an additional past tense in the antecedent and "would" in the consequent in English.&lt;br /&gt;&lt;br /&gt;(1) If John had owned a donkey, he would have beaten it.&lt;br /&gt;&lt;br /&gt;Counterfactual donkeys present a problem for similarity-based approaches to counterfactuals (Lewis 1973), because they sometimes require us to consider possibilities beyond the most similar ones, as the classical theory would have it: (1), for example, allows us to draw conclusions about John's attitude towards all donkeys, not just the ones he owns in the most similar worlds. In this thesis, I compare three different solutions to this problem: First, I discuss a combination of Dynamic Predicate Logic (Groenendijk &amp; Stokhof 1991) with a variably strict semantics (Lewis 1973) and a dynamic strict semantics respectively (von Fintel 1999), concluding that only the latter accounts for the full set of data. Second, I consider whether this solution can be extended to D-type theories (Elbourne 2005) and conclude that this requires us to make stipulations that are not required in the dynamic framework. Third, prompted by additional data that shows the same behaviour in the absence of an overt indefinite, I explore the option of accounting for counterfactual donkeys by switching to a situation-based framework that standardly considers a larger set of possibilities (Arregui 2009), optionally restricting this set by law-like regularities in the context. In evaluating all three proposals, I suggest that there are two possible further avenues: Exploring the empirical evidence for positing covert indefinites, allowing us to continue with a dynamic framework, or working out detailed accounts of pragmatic notions like relevance and law-like regularities, in order to precisify the situation-based framework.</dcterms:abstract>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/39760"/>
    <dc:rights>terms-of-use</dc:rights>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/45"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/45"/>
    <dcterms:issued>2017</dcterms:issued>
    <dcterms:title>The world is not enough : situations, laws and assignments in counterfactual donkey sentences</dcterms:title>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
  </rdf:Description>
</rdf:RDF>

Prüfungsdatum der Dissertation

July 28, 2017

Hochschulschriftenvermerk

Konstanz, Univ., Diss., 2017