12 found
Order:
  1.  42
    Reciprocal Expressions and the Concept of Reciprocity.Mary Dalrymple, Makoto Kanazawa, Yookyung Kim, Sam McHombo & Stanley Peters - 1998 - Linguistics and Philosophy 21 (2):159-210.
  2.  39
    Weak Vs. Strong Readings of Donkey Sentences and Monotonicity Inference in a Dynamic Setting.Makoto Kanazawa - 1994 - 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)  
     
    Export citation  
     
    My bibliography   18 citations  
  3.  17
    Singular Donkey Pronouns Are Semantically Singular.Makoto Kanazawa - 2001 - Linguistics and Philosophy 24 (3):383-403.
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  4.  14
    The Lambek Calculus Enriched with Additional Connectives.Makoto Kanazawa - 1992 - 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)  
     
    Export citation  
     
    My bibliography   7 citations  
  5.  15
    Identification in the Limit of Categorial Grammars.Makoto Kanazawa - 1996 - 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)  
     
    Export citation  
     
    My bibliography   3 citations  
  6. Quantifiers, Deduction, and Context.Makoto Kanazawa, Christopher Pinon & Henriette de Swart (eds.) - 1996 - CSLI Publications.
     
    Export citation  
     
    My bibliography   1 citation  
  7.  38
    Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars.Makoto Kanazawa - 2010 - 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 (4 more)  
     
    Export citation  
     
    My bibliography  
  8.  18
    A Note on Intensionalization.Philippe de Groote & Makoto Kanazawa - 2013 - 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)  
     
    Export citation  
     
    My bibliography  
  9.  22
    Computational Approaches to Language Acquisition, Michael R. Brent, Ed.Makoto Kanazawa - 2004 - Journal of Logic, Language and Information 13 (3):377-379.
  10.  2
    Edinburgh, Scotland July 1–4, 2008.Olivier Danvy, Anuj Dawar, Makoto Kanazawa, Sam Lomonaco, Mark Steedman, Henry Towsner & Nikolay Vereshchagin - 2008 - Bulletin of Symbolic Logic 14 (4).
  11.  2
    Computing Interpolants in Implicational Logics.Makoto Kanazawa - 2006 - Annals of Pure and Applied Logic 142 (1):125-201.
    I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like Prawitz’s, works on natural deductions rather than sequent derivations, and, unlike existing methods, always finds a ‘strongest’ interpolant under a certain restricted but reasonable notion of what counts as an ‘interpolant’.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  12.  1
    15th Workshop on Logic, Language, Information and Computation (WoLLIC 2008)-Abstracts.Sam Lomonaco & Makoto Kanazawa - 2008 - Logic Journal of the IGPL 16 (4):415-423.
    Direct download  
     
    Export citation  
     
    My bibliography