Scope as syntactic abstraction

Christian Barker

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    What is the logic of scope? By “scope”, I mean scopetaking in natural languages such as English, as illustrated by the sentence Ann saw everyone. In this example, the quantifier denoted by everyone takes scope over the rest of the sentence, that is, it takes the denotation of the rest of the sentence as its semantic argument: everyone(λx.saw(x)(ann)). The answer I will give here will be to provide a substructural logic whose two modes are related by a single structural postulate. This postulate can be interpreted as constituting a kind of lambda-abstraction over structures, where the abstracted structures are interpreted as delimited continuations. I discuss soundness and completeness results, as well as cut elimination. I also compare the logic to a number of alternative approaches, including the standard technique of Quantifier Raising, and mention applications to scope ambiguity and parasitic scope.

    Original languageEnglish (US)
    Title of host publicationNew Frontiers in Artificial Intelligence - JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers
    PublisherSpringer Verlag
    Pages184-199
    Number of pages16
    Volume9067
    ISBN (Print)9783662481189
    DOIs
    StatePublished - 2015
    Event6th International Symposium on Artificial Intelligence, JSAI 2014 - Kanagawa, Japan
    Duration: Oct 27 2014Oct 28 2014

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume9067
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other6th International Symposium on Artificial Intelligence, JSAI 2014
    CountryJapan
    CityKanagawa
    Period10/27/1410/28/14

    Fingerprint

    Postulate
    Syntactics
    Quantifiers
    Substructural Logics
    Logic
    Cut-elimination
    Soundness
    Natural Language
    Continuation
    Completeness
    Semantics
    Alternatives
    Syntax
    Abstraction
    Standards
    Ambiguity

    Keywords

    • Continuations
    • Natural language quantification
    • Parasitic scope
    • Quantifier raising
    • Scope
    • Substructural logic

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Barker, C. (2015). Scope as syntactic abstraction. In New Frontiers in Artificial Intelligence - JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers (Vol. 9067, pp. 184-199). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9067). Springer Verlag. https://doi.org/10.1007/978-3-662-48119-6_14

    Scope as syntactic abstraction. / Barker, Christian.

    New Frontiers in Artificial Intelligence - JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers. Vol. 9067 Springer Verlag, 2015. p. 184-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9067).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Barker, C 2015, Scope as syntactic abstraction. in New Frontiers in Artificial Intelligence - JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers. vol. 9067, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9067, Springer Verlag, pp. 184-199, 6th International Symposium on Artificial Intelligence, JSAI 2014, Kanagawa, Japan, 10/27/14. https://doi.org/10.1007/978-3-662-48119-6_14
    Barker C. Scope as syntactic abstraction. In New Frontiers in Artificial Intelligence - JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers. Vol. 9067. Springer Verlag. 2015. p. 184-199. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-662-48119-6_14
    Barker, Christian. / Scope as syntactic abstraction. New Frontiers in Artificial Intelligence - JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers. Vol. 9067 Springer Verlag, 2015. pp. 184-199 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{740c1a6d86af41deb3fd2b7dac2f5633,
    title = "Scope as syntactic abstraction",
    abstract = "What is the logic of scope? By “scope”, I mean scopetaking in natural languages such as English, as illustrated by the sentence Ann saw everyone. In this example, the quantifier denoted by everyone takes scope over the rest of the sentence, that is, it takes the denotation of the rest of the sentence as its semantic argument: everyone(λx.saw(x)(ann)). The answer I will give here will be to provide a substructural logic whose two modes are related by a single structural postulate. This postulate can be interpreted as constituting a kind of lambda-abstraction over structures, where the abstracted structures are interpreted as delimited continuations. I discuss soundness and completeness results, as well as cut elimination. I also compare the logic to a number of alternative approaches, including the standard technique of Quantifier Raising, and mention applications to scope ambiguity and parasitic scope.",
    keywords = "Continuations, Natural language quantification, Parasitic scope, Quantifier raising, Scope, Substructural logic",
    author = "Christian Barker",
    year = "2015",
    doi = "10.1007/978-3-662-48119-6_14",
    language = "English (US)",
    isbn = "9783662481189",
    volume = "9067",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "184--199",
    booktitle = "New Frontiers in Artificial Intelligence - JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers",
    address = "Germany",

    }

    TY - GEN

    T1 - Scope as syntactic abstraction

    AU - Barker, Christian

    PY - 2015

    Y1 - 2015

    N2 - What is the logic of scope? By “scope”, I mean scopetaking in natural languages such as English, as illustrated by the sentence Ann saw everyone. In this example, the quantifier denoted by everyone takes scope over the rest of the sentence, that is, it takes the denotation of the rest of the sentence as its semantic argument: everyone(λx.saw(x)(ann)). The answer I will give here will be to provide a substructural logic whose two modes are related by a single structural postulate. This postulate can be interpreted as constituting a kind of lambda-abstraction over structures, where the abstracted structures are interpreted as delimited continuations. I discuss soundness and completeness results, as well as cut elimination. I also compare the logic to a number of alternative approaches, including the standard technique of Quantifier Raising, and mention applications to scope ambiguity and parasitic scope.

    AB - What is the logic of scope? By “scope”, I mean scopetaking in natural languages such as English, as illustrated by the sentence Ann saw everyone. In this example, the quantifier denoted by everyone takes scope over the rest of the sentence, that is, it takes the denotation of the rest of the sentence as its semantic argument: everyone(λx.saw(x)(ann)). The answer I will give here will be to provide a substructural logic whose two modes are related by a single structural postulate. This postulate can be interpreted as constituting a kind of lambda-abstraction over structures, where the abstracted structures are interpreted as delimited continuations. I discuss soundness and completeness results, as well as cut elimination. I also compare the logic to a number of alternative approaches, including the standard technique of Quantifier Raising, and mention applications to scope ambiguity and parasitic scope.

    KW - Continuations

    KW - Natural language quantification

    KW - Parasitic scope

    KW - Quantifier raising

    KW - Scope

    KW - Substructural logic

    UR - http://www.scopus.com/inward/record.url?scp=84945550656&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84945550656&partnerID=8YFLogxK

    U2 - 10.1007/978-3-662-48119-6_14

    DO - 10.1007/978-3-662-48119-6_14

    M3 - Conference contribution

    AN - SCOPUS:84945550656

    SN - 9783662481189

    VL - 9067

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 184

    EP - 199

    BT - New Frontiers in Artificial Intelligence - JSAI-isAI 2014 Workshops, LENLS, JURISIN, and GABA, Revised Selected Papers

    PB - Springer Verlag

    ER -