This Festschrift volume is published in honor of Hanne Riis Nielson and Flemming Nielson on the occasion of their 60th birthdays in 2014 and 2015, respectively. The papers included in this volume deal with the wide area of calculi, semantics, and analysis. The book features contributions from colleagues, who have worked together with Hanne and Flemming through their scientific life and are dedicated to them and to their work. The papers were presented at a colloquium at the Technical University of Denmark in January 2016.

Nonclassical logics have played an increasing role in recent years in disciplines ranging from mathematics and computer science to linguistics and philosophy. Generalized Galois Logics develops a uniform framework of relational semantics to mediate between logical calculi and their semantics through algebra. This volume addresses normal modal logics such as K and S5, and substructural logics, including relevance logics, linear logic, and Lambek calculi. The authors also treat less-familiar and new logical systems with equal deftness.

Frege's invention of the predicate calculus has been the most influential event in the history of modern logic. The calculus’ place in logic is so central that many philosophers think, in fact, of it when they think of logic. This book challenges the position in contemporary logic and philosophy of language of the predicate calculus claiming that it is based on mistaken assumptions. Ben-Yami shows that the predicate calculus is different from natural language in its fundamental semantic characteristics, primarily in its treatment of reference and quantification, and that as a result the calculus is inadequate for the analysis of the semantics and logic of natural language. Ben-Yami develops both an alternative analysis of the semantics of natural language and an alternative deductive system comparable in its deductive power to first order predicate calculus but more adequate than it for the representation of the logic of natural language. Ben-Yami's book is a revolutionary challenge to classical first order predicate calculus, casting doubt on many of the central claims of modern logic.

This booklet presents a reasonably self-contained theory of predicate trans former semantics. Predicate transformers were introduced by one of us (EWD) as a means for defining programming language semantics in a way that would directly support the systematic development of programs from their formal specifications. They met their original goal, but as time went on and program derivation became a more and more formal activity, their informal introduction and the fact that many of their properties had never been proved became more and more unsatisfactory. And so did the original exclusion of unbounded nondeterminacy. In 1982 we started to remedy these shortcomings. This little monograph is a result of that work. A possible -and even likely- criticism is that anyone sufficiently versed in lattice theory can easily derive all of our results himself. That criticism would be correct but somewhat beside the point. The first remark is that the average book on lattice theory is several times fatter (and probably less self contained) than this booklet. The second remark is that the predicate transformer semantics provided only one of the reasons for going through the pains of publication.

No detailed description available for "Categorial Investigations".

In computing science design plays an eminently important role. By now, it is quite clear that the issue of proper design of programs within a formal calculus is one of the most interesting and most difficult parts of computing science. Many demanding problems have to be envisaged here such as notations, rules and calculi, and the study of semantic models. We are 'far away from comprehensive and widely accepted solutions in these areas. Discussions at the summer school have clearly shown that people have quite different perspectives and priorities with respect to these three main areas. There is a general agreement that notation is very important. Here, notation is not so much used in the sense of "syntactic sugar", but rather in the sense of abstract syntax, in the sense of language constructs. Proper notation can significantly improve our understanding of the nature of the objects that we are dealing with and simplify the formal manipulation of these objects. However, influenced by educational background, habits, and schools of thought there are quite different tastes with respect to notation. The papers in these proceedings show very clearly how different those notations can be even when talking about quite similar objects.

This book presents the author's research on automatic learning procedures for categorial grammars of natural languages. The research program spans a number of intertwined disciplines, including syntax, semantics, learnability theory, logic, and computer science. The theoretical framework employed is an extension of categorial grammar that has come to be called multimodal or type-logical grammar. The first part of the book presents an expository summary of how grammatical sentences of any language can be deduced with a specially designed logical calculus that treats syntactic categories as its formulae. Some such Universal Type Logic is posited to underlie the human language faculty, and all linguistic variation is captured by the different systems of semantic and syntactic categories which are assigned in the lexicons of different languages. The remainder of the book is devoted to the explicit formal development of computer algorithms which can learn the lexicons of type logical grammars from learning samples of annotated sentences. The annotations consist of semantic terms expressed in the lambda calculus, and may also include an unlabeled tree-structuring over the sentence. The major features of the research include the following: We show how the assumption of a universal linguistic component---the logic of language---is not incompatible with the conviction that every language needs a different system of syntactic and semantic categories for its proper description. The supposedly universal linguistic categories descending from antiquity (noun, verb, etc.) are summarily discarded. Languages are here modeled as consisting primarily of sentence trees labeled with semantic structures; a new mathematical class of such term-labeled tree languages is developed which cross-cuts the well-known Chomsky hierarchy and provides a formal restrictive condition on the nature of human languages. The human language acquisition mechanism is postulated to be biased, such that it assumes all input language samples are drawn from the above "syntactically homogeneous" class; in this way, the universal features of human languages arise not just from the innate logic of language, but also from the innate biases which govern language learning. This project represents the first complete explicit attempt to model the aquisition of human language since Steve Pinker's groundbreaking 1984 publication, "Language Learnability and Language Development."