Abstract We establish adjunction and inversion of for log canonical centers arbitrary codimension in full generality.

In 2010, J. Climent Vidal and J. Soliveres Tur developed, among other things, a pair of 2-adjunctions between the 2-category of adjunctions and the 2-category of monads. One is related to the Kleisli adjunction and the other to the Eilenberg-Moore adjunction for a given monad.Since any 2-adjunction induces certain natural isomorphisms of categories, these can be used to classify bijection...

The TAG adjunction operation operates by splitting a tree at one node, which we will call the adjunction site. In the resulting structure, the subtrees above and below the adjunction site are separated by, and connected with, the auxiliary tree used in the composition. As the adjunction site is thus split into two nodes, with a copy in each subtree, a natural way of formalizing the adjunction o...

We first announce our recent result on adjunction and inversion of adjunction. Then we clarify the relationship between Hacon’s for log canonical centers arbitrary codimension.

It is shown that five apparently irreconcilable claims about the clausal syntax of Irish can be reconciled in a natural, base-generated LFG analysis that builds on the standard LFG theory of endocentricity and coheads/extended heads, the LFG projection architecture, and Toivonen’s (2001) work on nonprojecting categories and c-structure adjunction. The analysis also builds on McCloskey’s (1996) ...

Adjunction is a powerful operation that makes Tree Adjoining Grammar (TAG) useful for describing the syntactic structure of natural languages. In practice, a large part of wide coverage grammars written following the TAG formalism is formed by trees that can be combined by means of the simpler kind of adjunction defined for Tree Insertion Grammar. In this paper, we describe a parsing algorithm ...