13 found
Sort by:
Disambiguations:
Makoto Kanazawa [12]M. Kanazawa [2]
  1. Philippe de Groote & Makoto Kanazawa (2013). A Note on Intensionalization. Journal of Logic, Language and Information 22 (2):173-194.
    Building on Ben-Avi and Winter’s (2007) work, this paper provides a general “intensionalization” procedure that turns an extensional semantics for a language into an intensionalized one that is capable of accommodating “truly intensional” lexical items without changing the compositional semantic rules. We prove some formal properties of this procedure and clarify its relation to the procedure implicit in Montague’s (1973) PTQ.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  2. Makoto Kanazawa (2010). Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars. Journal of Logic, Language and Information 19 (2):137-161.
    Second-order abstract categorial grammars (de Groote in Association for computational linguistics, 39th annual meeting and 10th conference of the European chapter, proceedings of the conference, pp. 148–155, 2001) and hyperedge replacement grammars (Bauderon and Courcelle in Math Syst Theory 20:83–127, 1987; Habel and Kreowski in STACS 87: 4th Annual symposium on theoretical aspects of computer science. Lecture notes in computer science, vol 247, Springer, Berlin, pp 207–219, 1987) are two natural ways of generalizing “context-free” grammar formalisms for string and tree (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Olivier Danvy, Anuj Dawar, Makoto Kanazawa, Sam Lomonaco, Mark Steedman, Henry Towsner & Nikolay Vereshchagin (2008). Edinburgh, Scotland July 1–4, 2008. Bulletin of Symbolic Logic 14 (4).
    Direct download  
     
    My bibliography  
     
    Export citation  
  4. Sam Lomonaco & Makoto Kanazawa (2008). 15th Workshop on Logic, Language, Information and Computation (WoLLIC 2008)-Abstracts. Logic Journal of the Igpl 16 (4):415-423.
    No categories
     
    My bibliography  
     
    Export citation  
  5. Makoto Kanazawa (2006). Computing Interpolants in Implicational Logics. Annals of Pure and Applied Logic 142 (1):125-201.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. M. Kanazawa (2005). On the Lumping Semantics of Counterfactuals. Journal of Semantics 22 (2):129-151.
    Kratzer (1981) discussed a naïve premise semantics of counterfactual conditionals, pointed to an empirical inadequacy of this interpretation, and presented a modification—partition semantics—which Lewis (1981) proved equivalent to Pollock's (1976) version of his ordering semantics. Subsequently, Kratzer (1989) proposed lumping semantics, a different modification of premise semantics, and argued it remedies empirical failings of ordering semantics as well as of naïve premise semantics. We show that lumping semantics yields truth conditions for counterfactuals that are not only different from what she (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  7. Makoto Kanazawa (2004). Computational Approaches to Language Acquisition, Michael R. Brent, Ed. Journal of Logic, Language and Information 13 (3):377-379.
  8. Makoto Kanazawa (2001). Singular Donkey Pronouns Are Semantically Singular. Linguistics and Philosophy 24 (3):383-403.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  9. Mary Dalrymple, Makoto Kanazawa, Yookyung Kim, Sam McHombo & Stanley Peters (1998). Reciprocal Expressions and the Concept of Reciprocity. Linguistics and Philosophy 21 (2):159-210.
  10. Makoto Kanazawa (1996). Identification in the Limit of Categorial Grammars. Journal of Logic, Language and Information 5 (2):115-155.
    It is proved that for any k, the class of classical categorial grammars that assign at most k types to each symbol in the alphabet is learnable, in the Gold (1967) sense of identification in the limit from positive data. The proof crucially relies on the fact that the concept known as finite elasticity in the inductive inference literature is preserved under the inverse image of a finite-valued relation. The learning algorithm presented here incorporates Buszkowski and Penn's (1990) algorithm for (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. Makoto Kanazawa, Christopher Pinon & Henriette de Swart (eds.) (1996). Quantifiers, Deduction, and Context. Csli.
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  12. Makoto Kanazawa (1994). Weak Vs. Strong Readings of Donkey Sentences and Monotonicity Inference in a Dynamic Setting. Linguistics and Philosophy 17 (2):109 - 158.
    In this paper, I show that the availability of what some authors have called the weak reading and the strong reading of donkey sentences with relative clauses is systematically related to monotonicity properties of the determiner. The correlation is different from what has been observed in the literature in that it concerns not only right monotonicity, but also left monotonicity (persistence/antipersistence). I claim that the reading selected by a donkey sentence with a double monotone determiner is in fact the one (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Makoto Kanazawa (1992). The Lambek Calculus Enriched with Additional Connectives. Journal of Logic, Language and Information 1 (2):141-171.
    Some formal properties of enriched systems of Lambek calculus with analogues of conjunction and disjunction are investigated. In particular, it is proved that the class of languages recognizable by the Lambek calculus with added intersective conjunction properly includes the class of finite intersections of context-free languages.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation