Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
Lambek Calculus and Formal Languages
Published online by Cambridge University Press: 24 March 2017
By
Book contents
- Frontmatter
- Preface
- Plenary sessions
- Special sessions
- Contents
- The Number of Path-Components of a Compact Subset of Rn
- Intervals without Critical Triples
- Beyond Gödel's Theorem: Turing Nonrigidity Revisited
- Types and Indescernibles in Finite Models
- Model Theory of Modules
- Noninterpretability of Infinite Linear Orders
- Combinatorial Principles from Adding Cohen Reals
- Extensions of models of PV
- Convergence Laws for Random Graphs
- V=L and Maximize
- Towards a Categorical Foundation of Mathematics
- Strongly Minimal Sets and Geometry
- Computationally-Sound Proofs
- Lambek Calculus and Formal Languages
- Zil'ber's Trichotomy and o-minimal Structures
- The Higher Infinite in Proof Theory
- There May Be No Nowhere Dense Ultrafilter
- Towards Recursive Model Theory
- Accessible Segments of the Fast Growing Hierarchy
- Author Index
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Logic Colloquium '95 , pp. 269 - 272Publisher: Cambridge University PressPrint publication year: 2017
References
and
On categorial and phrase-structure grammars. Bull. Res. Council Israel Sect. F, 9F:1–16, 1960.Google Scholar
Language in Action: Categories, Lambdas and Dynamic Logic.
North-Holland, Amsterdam, (Studies in Logic 130), 1991.
Undecidability of some logical extensions of Ajdukiewicz-Lambek calculus. Studia Logica, 37:59–64, 1978.Google Scholar
Compatibility of categorial grammar with an associated category system. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 28:229–238, 1982.Google Scholar
Some decision problems in the theory of syntactic categories. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 28:539–548, 1982.Google Scholar
The equivalence of unidirectional Lambek categorial grammars and context-free grammars. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 31:369-384, 1985.Google Scholar
Completeness Results for Lambek Syntactic Calculus. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 32:13–28, 1986.Google Scholar
Generative power of categorial grammars. In
and editors, Categorial Grammars and Natural Language Structures, pages 69–94, Reidel, Dordrecht, 1988.
On generative capacity of the Lambek calculus. In editor, Logics in A I, pages 139–152, Springer, Berlin, 1991.
Syntactic Structures.
Mouton, The Hague, 1957.
Formal properties of grammars. In et al., editors, Hand-book of Mathematical Psychology, vol. 2, pages 323–418, Wiley, New York, 1963.
The equivalence of two concepts of categorial grammar. Information and Control, 10:475–484, 1967.Google Scholar
A Completeness Theorem for the Lambek Calculus of Syntactic Categories. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 31:235–241, 1985.Google Scholar
A brief survey of frames for the Lambek calculus.
Bericht 5-90, Konstanzer Berichte zur Logik und Wissenschaftstheorie, Universität Konstanz, 1990.
The mathematics of sentence structure. American Mathematical Monthly, 65(3):154–170, 1958.Google Scholar
Lambek grammars are context free. Preprint No. 8 of the Department of Math. Logic, Steklov Math. Institute, Series Logic and Computer Science, Moscow, 1992.
Lambek grammars are context free. Proceedings of the 8th Annual IEEE Symposium on Logic in Computer Science, 429–433, 1993.Google Scholar
Lambek calculus is L-complete. ILLC Prepublication Series LP–93–14, Institute for Logic, Language and Computation, University of Amsterdam, 1993.