We prove Steinebrunner's conjecture on the biequivalence between (colored) properads and labelled cospan categories. The main part of work is to establish a 1-categorical, strict version conjecture, showing that category equivalent categories via symmetric monoidal envelope functor.

I have just released Version 2.00 of my Japanese [P]m system. J e m m is a freeware package containing everything needed to typeset beautiful Japanese text. You should, of course, already have a Japanese text editor, mJ and METAFONT. Turbo-Pascal sources and executables are included for DOS computers. UNIX users are now supplied with a C program (gcc) so they too can enjoy J e m w . If you are ...

1 Introduction There is no agreement among researchers in the area of automated deduction about which features (besides computational efficiency) a suitable theorem proving system for non-classical (in particular modal) logics should have. In our opinion, such a system should (A) avoid ad hoc manipulation of the modal formulas; (B) provide a simple and uniform treatment of a wide variety of mod...

The paper addresses the problem of representing ambiguities in a way that allows for monotonic disambiguation and for direct de-ductive computation. The paper focuses on an extension of the formalism of underspeciied DRSs to ambiguities introduced by plural NPs. It deals with the collective/distributive distinction, and also with generic and cumulative readings. In addition it provides a system...