Show simple item record Bahramian, Hamidreza Nematollahi, Narges Sabry, Amr 2017-11-17T17:05:49Z 2017-11-17T17:05:49Z 2017
dc.description preprint en
dc.description.abstract This paper applies homotopy type theory to formal semantics of natural languages and proposes a new model for the linguistic phenomenon of copredication. Copredication refers to sentences where two predicates which assume different requirements for their arguments are asserted for one single entity, e.g., “the lunch was delicious but took forever”. This paper is particularly concerned with copredication sentences with quantification, i.e., cases where the two predicates impose distinct criteria of quantification and individuation, e.g., “Fred picked up and mastered three books.” In our solution developed in homotopy type theory and using the rule of existential closure following Heim analysis of indefinites, common nouns are modeled as identifications of their aspects using HoTT identity types, e.g., the common noun book is modeled as identifications of its physical and informational aspects. The previous treatments of copredication in systems of semantics which are based on simple type theory and dependent type theories make the correct predictions but at the expense of ad hoc extensions (e.g., partial functions, dot types and coercive subtyping). The model proposed here, also predicts the correct results but using a conceptually simpler foundation and no ad hoc extensions. The proofs in the proposal have been formalized using Agda. en
dc.language.iso en en
dc.subject homotopy type theory en
dc.subject formal semantics of natural languages en
dc.subject programming and proving in Agda en
dc.subject computational semantics en
dc.subject copredication en
dc.title Copredication in homotopy type theory en
dc.type Article en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search IUScholarWorks

Advanced Search


My Account