Optionality, Scope, and Licensing: An Application of Partially Ordered Categories

Authors:
Raffaella Bernardi;Anna Szabolcsi
Affiliations:
Faculty of Computer Science, Free University of Bozen-Bolzano, Bozen-Bolzano, Italy 39100;Department of Linguistics, New York University, New York, USA 10003
Venue:
Journal of Logic, Language and Information
Year:
2008

Citing 8
Cited 0

The logic of typed feature structures

The logic of typed feature structures
On constraint-based Lambek calculi

Specifying syntactic structures
Gaggle Theory: An Abstraction of Galois Connections and Residuation with Applications to Negation, Implication, and Various Logical Operations

JELIA '90 Proceedings of the European Workshop on Logics in AI
Features and formulae

Computational Linguistics
Analyzing the Core of Categorial Grammar

Journal of Logic, Language and Information
Categorial unification grammars

COLING '86 Proceedings of the 11th coference on Computational linguistics
Types as Graphs: Continuations in Type Logical Grammar

Journal of Logic, Language and Information
Continuation semantics for symmetric categorial grammar

WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper uses a partially ordered set of syntactic categories to accommodate optionality and licensing in natural language syntax. A complex but well-studied data set pertaining to the syntax of quantifier scope and negative polarity licensing in Hungarian is used to illustrate the proposal. The presentation is geared towards both linguists and logicians. The paper highlights that the main ideas can be implemented in different grammar formalisms, and discusses in detail an implementation where the partial ordering on categories is given by the derivability relation of a calculus with residuated and Galois-connected unary operators.