5 found
Carl Pollard [3]Carl J. Pollard [2]
  1.  47
    Carl Pollard (2015). Agnostic Hyperintensional Semantics. Synthese 192 (3):535-562.
    A hyperintensional semantics for natural language is proposed which is agnostic about the question of whether propositions are sets of worlds or worlds are sets of propositions. Montague’s theory of intensional senses is replaced by a weaker theory, written in standard classical higher-order logic, of fine-grained senses which are in a many-to-one correspondence with intensions; Montague’s theory can then be recovered from the proposed theory by identifying the type of propositions with the type of sets of worlds and adding an (...)
    Direct download (2 more)  
    Export citation  
    My bibliography  
  2.  25
    Scott Martin & Carl Pollard (2012). A Higher-Order Theory of Presupposition. Studia Logica 100 (4):727-751.
    So-called 'dynamic' semantic theories such as Kamp's discourse representation theory and Heim's file change semantics account for such phenomena as cross-sentential anaphora, donkey anaphora, and the novelty condition on indefinites, but compare unfavorably with Montague semantics in some important respects (clarity and simplicity of mathematical foundations, compositionality, handling of quantification and coordination). Preliminary efforts have been made by Muskens and by de Groote to revise and extend Montague semantics to cover dynamic phenomena. We present a new higher-order theory of discourse (...)
    Direct download (5 more)  
    Export citation  
    My bibliography  
  3. Carl J. Pollard & Drew Moshier (1990). Unifying Partial Descriptions of Sets. In Philip P. Hanson (ed.), Information, Language and Cognition. University of British Columbia Press. pp. 1--285.
    No categories
    Export citation  
    My bibliography   1 citation  
  4.  20
    Chris Fox, Shalom Lappin & Carl Pollard, First-Order, Curry-Typed Logic for Natural Language Semantics.
    The paper presents Property Theory with Curry Typing where the language of terms and well-formed formulæ are joined by a language of types. In addition to supporting fine-grained intensionality, the basic theory is essentially first-order, so that implementations using the theory can apply standard first-order theorem proving techniques. The paper sketches a system of tableau rules that implement the theory. Some extensions to the type theory are discussed, including type polymorphism, which provides a useful analysis of conjunctive terms. Such terms (...)
    Direct download  
    Export citation  
    My bibliography  
  5.  9
    M. Andrew Moshier & Carl J. Pollard (1994). The Domain of Set-Valued Feature Structures. Linguistics and Philosophy 17 (6):607-631.
    It is well-known that feature structures can be fruitfully viewed as forming a Scott domain. Once a linguistically motivated notion of set value in feature structures is countenanced, however, this is no longer possible inasmuch as unification of set values in general fails to yield a unique result. In Pollard and Moshier 1990 it was shown that, while falling short of forming a Scott domain, the set of feature structures possibly containing set values satisfies the weaker condition of forming a (...)
    Direct download (6 more)  
    Export citation  
    My bibliography