Non-associative Lambek Categorial Grammar in Polynomial Time

We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial time, this proves that a sentence generated by any non-associative Lambek categorial grammar can be recognized in polynomial time.     

A necessary condition forBSI-stability

This paper gives a negative result onBSI-stability for the Lobatto IIIC-methods with more than two stages. We also give a necessary condition forBSI-stability.     

Cuprophilic and pi-stacking interactions in the formation of supramolecular stacks from dicoordinate organocopper complexes

The unsupported organocopper pyridine complexes C6F5Cu(py) (2) and [C6F5Cu]2(4,4'-bipy) (3) form supramolecular structures that are unprecedented in organocopper chemistry; one-dimensional chains of copper atoms with Cu...Cu distances of 2.8924(3) angstroms in the blue-luminescent complex are likely associated with cuprophilic interactions, whereas multiple perfluoroarene-arene interactions dominate in the supramolecular assembly of 3.