Switch to: References

Add citations

You must login to add citations.
  1. Normal form of derivations in the nonassociative and commutative lambek calculus with product.Maciej Kandulski - 1993 - Mathematical Logic Quarterly 39 (1):103-114.
    We show that derivations in the nonassociative and commutative Lambek calculus with product can be transformed to a normal form as it is the case with derivations in noncommutative calculi. As an application we obtain that the class of languages generated by categorial grammars based on the nonassociative and commutative Lambek calculus with product is included in the class of CF-languages. MSC: 68Q50, 03D15, 03B65.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars.Maciej Kandulski - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (1):41-52.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Timing diagrams: Formalization and algorithmic verification. [REVIEW]Kathi Fisler - 1999 - Journal of Logic, Language and Information 8 (3):323-361.
    Timing diagrams are popular in hardware design. They have been formalized for use in reasoning tasks, such as computer-aided verification. These efforts have largely treated timing diagrams as interfaces to established notations for which verification is decidable; this has restricted timing diagrams to expressing only regular language properties. This paper presents a timing diagram logic capable of expressing certain context-free and context-sensitive properties. It shows that verification is decidable for properties expressible in this logic. More specifically, it shows that containment (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On arguments against the empirical adequacy of finite state grammar.Richard Daly - 1972 - Philosophy of Science 39 (4):461-475.
    In the first part of this paper, two arguments, one by Chomsky, and one by Bar-Hillel and Shamir, are examined in detail and rejected. Both arguments purport to show that the structure of English precludes its having a finite state grammar which correctly enumerates just the well formed sentences of English. In the latter part of the paper I consider the problem of supporting claims about the structure and properties of a natural language when no grammar for the language has (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The equivalence of Nonassociative Lambek Categorial Grammars and Context‐Free Grammars.Maciej Kandulski - 1988 - Mathematical Logic Quarterly 34 (1):41-52.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars.Wojcßch Buszkowski - 1985 - Mathematical Logic Quarterly 31 (24):369-384.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The meaning of mathematical expressions: Does philosophy shed any light on psychology?Paul Ernest - 1990 - British Journal for the Philosophy of Science 41 (4):443-460.
    Mathematicians and physical scientists depend heavily on the formal symbolism of mathematics in order to express and develop their theories. For this and other reasons the last hundred years has seen a growing interest in the nature of formal language and the way it expresses meaning; particularly the objective, shared aspect of meaning as opposed to subjective, personal aspects. This dichotomy suggests the question: do the objective philosophical theories of meaning offer concepts which can be applied in psychological theories of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Equivalence of Unidirectional Lambek Categorial Grammars and Context-Free Grammars.Wojcßch Buszkowski - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (24):369-384.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Prefix classes of Krom formulas.Stål O. Aanderaa & Harry R. Lewis - 1973 - Journal of Symbolic Logic 38 (4):628-642.
    Download  
     
    Export citation  
     
    Bookmark  
  • The limitations of the factor-analytical approach to psychology with special application to Cattell's research strategy.Maria Nowakowska - 1973 - Theory and Decision 4 (2):109-139.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures.Alwen Tiu, Egor Ianovski & Rajeev Goré - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 516-537.
    Download  
     
    Export citation  
     
    Bookmark   4 citations