Linguists who work on the Japanese language have disagreed about the notion of subject with resopect to Japanese; many linguists argue that there is no formal symtactic position for the subject in Japanese. Tateishi does deeper research on the surface syntax of the subject, and looks in particular at the syntax of the subject and phenomena which have been treated as S-adjunctions. These two have been identified with each other on many occasions in the history of Japanese linguistics and are of interest with respect to the debate over configurationality in the language, which has been revivedd in different forms following the emergence of the VP-Internal Subject Hypothesis, the merits of which Tateishi discusses at length. Tateishi's main claim is that despite all the non-configurational characteristics found in the language, Japanese is in a sense more configurational than the so-called configurational languages. Japanese allows more types of hierarchies to be involved in the subject-predicate relation than English allows, as Japanese does not have the same kind of restrictions on the phrase structure as the configurational languages have. Koichi Tateishi is a professor of linguistics at the Kyoto University of Foreign Studies.

Linear logic is an example of a "resource-sensitive" logic, keeping track of the number of times data of given types are used. Formulas in linear logic represent either the data themselves or data types, whereas in ordinary logic a formula is a proposition. If ordinary logic is a logic of truth, linear logic is a logic of actions. Linear logic and its implications are explored in depth in this volume. Particular attention has been given to the various formalisms for linear logic, embeddings of classical and intuitionistic logic into linear logic, the connection with certain types of categories, the "formulas-as-types" paradigm for linear logic and associated computational interpretations, and Girard's proof nets for classical linear logic as an analogue of natural deduction. It is also shown that linear logic is undecidable. A final section, contributed by D. Roorda, presents a proof of strong normalization for cut elimination in linear logic. Linear logic is of interest to logicians and computer scientists, and shows links with many other topics, such as coherence theorems in category theory, the theory of Petri nets, and abstract computing machines without garbage collection