Switch to: Citations

Add references

You must login to add references.
  1. An Introduction to Substructural Logics.Greg Restall - 1999 - New York: Routledge.
    This book introduces an important group of logics that have come to be known under the umbrella term 'susbstructural'. Substructural logics have independently led to significant developments in philosophy, computing and linguistics. _An Introduction to Substrucural Logics_ is the first book to systematically survey the new results and the significant impact that this class of logics has had on a wide range of fields.The following topics are covered: * Proof Theory * Propositional Structures * Frames * Decidability * Coda Both (...)
    Download  
     
    Export citation  
     
    Bookmark   202 citations  
  • Language in action.Johan Van Benthem - 1991 - Journal of Philosophical Logic 20 (3):225-263.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • Models for the Lambek calculus.Mati Pentus - 1995 - Annals of Pure and Applied Logic 75 (1-2):179-213.
    We prove that the Lambek calculus is complete w.r.t. L-models, i.e., free semigroup models. We also prove the completeness w.r.t. relativized relational models over the natural linear order of integers.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Completeness Results for Lambek Syntactic Calculus.Wojciech Buszkowski - 1986 - Mathematical Logic Quarterly 32 (1‐5):13-28.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • (1 other version)Lambek calculus and its relational semantics: Completeness and incompleteness. [REVIEW]Hajnal Andréka & Szabolcs Mikulás - 1994 - Journal of Logic, Language and Information 3 (1):1-37.
    The problem of whether Lambek Calculus is complete with respect to (w.r.t.) relational semantics, has been raised several times, cf. van Benthem (1989a) and van Benthem (1991). In this paper, we show that the answer is in the affirmative. More precisely, we will prove that that version of the Lambek Calculus which does not use the empty sequence is strongly complete w.r.t. those relational Kripke-models where the set of possible worlds,W, is a transitive binary relation, while that version of the (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • (1 other version)An Introduction to Substructural Logics (review).Kosta Došen - 2001 - Bulletin of Symbolic Logic 7 (4):527-530.
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • (1 other version)A brief survey of frames for the Lambek calculus.Kosta Došen - 1992 - Mathematical Logic Quarterly 38 (1):179-187.
    Models for the Lambek calculus of syntactic categories surveyed here are based on frames that are in principle of the same type as Kripke frames for intuitionistic logic. These models are extracted from the literature on models for relevant logics, in particular the ternary relationed models introduced in the early seventies. The purpose of this brief survey is to locate some open completeness problems for variants of the Lambek calculus in the context of completeness results based on various types of (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Three uses of the herbrand-Gentzen theorem in relating model theory and proof theory.William Craig - 1957 - Journal of Symbolic Logic 22 (3):269-285.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • (1 other version)A brief survey of frames for the Lambek calculus.Kosta Došen - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):179-187.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • (1 other version)Completeness Results for Lambek Syntactic Calculus.Wojciech Buszkowski - 1986 - Mathematical Logic Quarterly 32 (1-5):13-28.
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • A program for syntax.P. T. Geach - 1970 - Synthese 22 (1-2):3 - 17.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Geach’s Categorial Grammar.Lloyd Humberstone - 2004 - Linguistics and Philosophy 28 (3):281 - 317.
    Geach’s rich paper ‘A Program for Syntax’ introduced many ideas into the arena of categorial grammar, not all of which have been given the attention they warrant in the thirty years since its first publication. Rather surprisingly, one of our findings (Section 3 below) is that the paper not only does not contain a statement of what has widely come to be known as “Geach’s Rule”, but in fact presents considerations which are inimical to the adoption of the rule in (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes.Wojciech Zielonka - 1981 - Mathematical Logic Quarterly 27 (13‐14):215-224.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (1 other version)Axiomatizability of Ajdukiewicz-Lambek Calculus by Means of Cancellation Schemes.Wojciech Zielonka - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (13-14):215-224.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • On axiomatizability within a system.William Craig - 1953 - Journal of Symbolic Logic 18 (1):30-32.
    Download  
     
    Export citation  
     
    Bookmark   104 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   20 citations  
  • Compatibility of a Categorial Grammar With an Associated Category System.Wojciech Buszkowski - 1982 - Mathematical Logic Quarterly 28 (14-18):229-238.
    Download  
     
    Export citation  
     
    Bookmark   10 citations