A NOTE ON CATEGORIAL GRAMMARS

Abstract

This paper presents a technique for studying the structure and theory of categorial grammars. Grammars of the type studied by Y. Bar-Hillel and others are shown to be representable over a twosymbol alphabet. A trivial corollary is that the category sentence is decidable in all these grammars. A decision problem for normal categorial grammars, of which restricted categorial grammars are an example, is shown to be recursively undecidable. A minimal (three-category) grammar is defined and properties of sequences of categories in this grammar are discussed. Some of the linguistic motivations for this study are presented. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1961
Accession Number
AD0264997

Entities

People

  • Robert P. Mitchell

Organizations

  • Lockheed Martin Missiles and Space

Tags

DTIC Thesaurus Topics

  • Alphabets
  • Behavior And Behavior Mechanisms
  • Human Behavior
  • Motivation
  • Sequences

Fields of Study

  • Mathematics

Readers

  • Computational Linguistics
  • Mathematical Modeling and Probability Theory.