Switch to: Citations

References in:

Language, Lambdas, and Logic

In R. Oehrle & J. Kruijff (eds.), Resource Sensitivity, Binding, and Anaphora (Studies in Linguistics and Philosophy 80). Dordrecht: Kluwer Academic Publishers. pp. 23--54 (2003)

Add references

You must login to add references.
  1. Lectures on Linear Logic.A. S. Troelstra - 1991
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • The Proper Treatment of Quantification in Ordinary English.Richard Montague - 1973 - In Patrick Suppes, Julius Moravcsik & Jaakko Hintikka (eds.), Approaches to Natural Language. Dordrecht. pp. 221--242.
    Download  
     
    Export citation  
     
    Bookmark   160 citations  
  • Categorial Grammar and Lexical-Functional Grammar.Reinhard Muskens - 2001 - In Miriam Butt & Tracey Holloway King (eds.), Proceedings of the LFG01 Conference, University of Hong Kong. Stanford, CA: CSLI Publications. pp. 259-279.
    This paper introduces λ-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, λ-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of linear combinators, closed pure λ-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Lambda Grammars and the Syntax-Semantics Interface.Reinhard Muskens - 2001 - In Robert Van Rooij & Martin Stokhof (eds.), Proceedings of the Thirteenth Amsterdam Colloquium. Amsterdam: ILLC. pp. 150-155.
    In this paper we discuss a new perspective on the syntax-semantics interface. Semantics, in this new set-up, is not ‘read off’ from Logical Forms as in mainstream approaches to generative grammar. Nor is it assigned to syntactic proofs using a Curry-Howard correspondence as in versions of the Lambek Calculus, or read off from f-structures using Linear Logic as in Lexical-Functional Grammar (LFG, Kaplan & Bresnan [9]). All such approaches are based on the idea that syntactic objects (trees, proofs, fstructures) are (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Term-Labeled Categorial Type Systems.Richard T. Oehrle - 1994 - Linguistics and Philosophy 17 (6):633 - 678.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • A First-Order Axiomatization of the Theory of Finite Trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
    We provide first-order axioms for the theories of finite trees with bounded branching and finite trees with arbitrary (finite) branching. The signature is chosen to express, in a natural way, those properties of trees most relevant to linguistic theories. These axioms provide a foundation for results in linguistics that are based on reasoning formally about such properties. We include some observations on the expressive power of these theories relative to traditional language complexity classes.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Towards a Variable-Free Semantics.Pauline Jacobson - 1999 - Linguistics and Philosophy 22 (2):117-185.
    The Montagovian hypothesis of direct model-theoretic interpretation of syntactic surface structures is supported by an account of the semantics of binding that makes no use of variables, syntactic indices, or assignment functions & shows that the interpretation of a large portion of so-called variable-binding phenomena can dispense with the level of logical form without incurring equivalent complexity elsewhere in the system. Variable-free semantics hypothesizes local interpretation of each surface constituent; binding is formalized as a type-shifting operation on expressions that denote (...)
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
  • Language in Action.Johan Benthem - 1991 - Journal of Philosophical Logic 20 (3):225 - 263.
    A number of general points behind the story of this paper may be worth setting out separately, now that we have come to the end.There is perhaps one obvious omission to be addressed right away. Although the word “information” has occurred throughout this paper, it must have struck the reader that we have had nothing to say on what information is. In this respect, our theories may be like those in physics: which do not explain what “energy” is (a notion (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Talking About Trees and Truth-Conditions.Reinhard Muskens - 1991 - Journal of Logic, Language and Information 10 (4):417-455.
    We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus truth-conditions as a model, it completely specifies thatgrammatical (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • From Discourse to Logic.Hans Kamp & Uwe Reyle - 1993 - Dordrecht: Kluwer Academic Publishers.
    Preface This book is about semantics and logic. More specifically, it is about the semantics and logic of natural language; and, even more specifically than ...
    Download  
     
    Export citation  
     
    Bookmark   311 citations  
  • Labelled Deductive Systems.Dov M. Gabbay - 1996 - Oxford University Press.
    This important book provides a new unifying methodology for logic. It replaces the traditional view of logic as manipulating sets of formulas with the notion of structured families of labelled formulas with algebraic structures. This approach has far reaching consequences for the methodology of logics and their semantics, and the book studies the main features of such systems along with their applications. It will interest logicians, computer scientists, philosophers and linguists.
    Download  
     
    Export citation  
     
    Bookmark   37 citations