This volume honours the life and work of Solomon Feferman, one of the most prominent mathematical logicians of the latter half of the 20th century. In the collection of essays presented here, researchers examine Feferman's work on mathematical as well as specific methodological and philosophical issues that tie into mathematics. Feferman's work was largely based in mathematical logic (namely model theory, set theory, proof theory and computability theory), but also branched out into methodological and philosophical issues, making it well known beyond the borders of the mathematics community. With regard to methodological issues, Feferman supported concrete projects. On the one hand, these projects calibrate the proof theoretic strength of subsystems of analysis and set theory and provide ways of overcoming the limitations imposed by Goedel's incompleteness theorems through appropriate conceptual expansions. On the other, they seek to identify novel axiomatic foundations for mathematical practice, truth theories, and category theory. In his philosophical research, Feferman explored questions such as "What is logic?" and proposed particular positions regarding the foundations of mathematics including, for example, his "conceptual structuralism." The contributing authors of the volume examine all of the above issues. Their papers are accompanied by an autobiography presented by Feferman that reflects on the evolution and intellectual contexts of his work. The contributing authors critically examine Feferman's work and, in part, actively expand on his concrete mathematical projects. The volume illuminates Feferman's distinctive work and, in the process, provides an enlightening perspective on the foundations of mathematics and logic.

Can language change be modelled as an evolutionary process? Can notions like variation, selection and competition be fruitfully applied to facts of language development? The present volume ties together various strands of linguistic research which can bring us towards an answer to these questions. In one of the youngest and rapidly growing areas of linguistic research, mathematical models and simulations of competition based developments have been applied to instances of language change. By matching the predicted and observed developmental trends, researchers gauge existing models to the needs of linguistic applications and evaluate the fruitfulness of evolutionary models in linguistics. The present volume confronts these studies with more empirically-based studies in creolization and historical language change which bear on key concepts of evolutionary models. What does it mean for a linguistic construction to survive its competitors? How do the interacting factors in phases of creolization differ from those in ordinary language change, and how - consequently - might Creole languages differ structurally from older languages? Some of the authors, finally, also address the question how different aspects of our linguistic competence tie in with our more elementary cognitive capacities. The volume contains contributions by Brady Clark et al., Elly van Gelderen, Alain Kihm, Manfred Krifka, Wouter Kusters, Robert van Rooij, Anette Rosenbach, John McWhorter, Teresa Satterfield, Michael Tomasello and Elizabeth C. Traugott. The book brings together contributions from two areas of research: the study of language evolution by means of methods from artifical intelligence/artificial life (like computer simulations and analytic mathematical methods) on the one hand, and empirically oriented research from historical linguistics and creolisation studies that uses concepts from evolutionary theory as a heuristic tool in a qualitative way. The book is thus interesting for readers from both traditions because it supplies them with information about relevant ongoing research and useful methods and data from the other camp.

Ernst Specker has made decisive contributions towards shaping direc tions in topology, algebra, mathematical logic, combinatorics and algorith mic over the last 40 years. We have derived great pleasure from marking his seventieth birthday by editing the majority of his scientific publications, and thus making his work available in a unified form to the mathematical community. In order to convey an idea of the richness of his personality, we have also included one of his sermons. Of course, the publication of these Selecta can pay tribute only to the writings of Ernst Specker. It cannot adequately express his originality and wisdom as a person nor the fascination he exercises over his students, colleagues and friends. We can do no better than to quote from Hao Wang in the 'Festschrift' Logic and Algorithmic I: Specker was ill for an extended period before completing his formal education. He had the leisure to think over many things. This experi ence may have helped cultivating his superiority as a person. In terms of traditional Chinese categories, I would say there is a taoist trait in him in the sense of being more detached, less competitive, and more under standing. I believe he has a better sense of what is important in life and arranges his life better than most logicians. We are grateful to Birkhauser Verlag for the production of this Selecta volume. Our special thanks go to Jonas Meon for sharing with us his intimate knowledge of his friend Ernst Specker."

ThisbookdiscusseshowTypeLogicalGrammarcanbemodi?edinsuch awaythatasystematictreatmentofanaphoraphenomenabecomesp- sible without giving up the general architecture of this framework. By Type Logical Grammar, I mean the version of Categorial Grammar that arose out of the work of Lambek, 1958 and Lambek, 1961. There Ca- gorial types are analyzed as formulae of a logical calculus. In particular, the Categorial slashes are interpreted as forms of constructive impli- tion in the sense of Intuitionistic Logic. Such a theory of grammar is per se attractive for a formal linguist who is interested in the interplay between formal logic and the structure of language. What makes L- bekstyleCategorialGrammarevenmoreexcitingisthefactthat(asvan Benthem,1983pointsout)theCurry-Howardcorrespondence-acentral part of mathematical proof theory which establishes a deep connection betweenconstructivelogicsandthe?-calculus-suppliesthetypelogical syntax with an extremely elegant and independently motivated interface to model-theoretic semantics. Prima facie, anaphora does not 't very well into the Categorial picture of the syntax-semantics interface. The Curry-Howard based composition of meaning operates in a local way, and meaning ass- bly is linear, i.e., every piece of lexical meaning is used exactly once. Anaphora, on the other hand, is in principle unbounded, and it involves by de?nition the multiple use of certain semantic resources. The latter problem has been tackled by several Categorial grammarians by ass- ing su?ciently complex lexical meanings for anaphoric expressions, but the locality problem is not easy to solve in a purely lexical way.

Ernst Specker has made decisive contributions towards shaping direc tions in topology, algebra, mathematical logic, combinatorics and algorith mic over the last 40 years. We have derived great pleasure from marking his seventieth birthday by editing the majority of his scientific publications, and thus making his work available in a unified form to the mathematical community. In order to convey an idea of the richness of his personality, we have also included one of his sermons. Of course, the publication of these Selecta can pay tribute only to the writings of Ernst Specker. It cannot adequately express his originality and wisdom as a person nor the fascination he exercises over his students, colleagues and friends. We can do no better than to quote from Hao Wang in the 'Festschrift' Logic and Algorithmic I: Specker was ill for an extended period before completing his formal education. He had the leisure to think over many things. This experi ence may have helped cultivating his superiority as a person. In terms of traditional Chinese categories, I would say there is a taoist trait in him in the sense of being more detached, less competitive, and more under standing. I believe he has a better sense of what is important in life and arranges his life better than most logicians. We are grateful to Birkhauser Verlag for the production of this Selecta volume. Our special thanks go to Jonas Meon for sharing with us his intimate knowledge of his friend Ernst Specker."

Recent years witnessed an increased interest in formal pragmatics and especially the establishment of game theory as a new research methodology for the study of language use. Game and Decision Theory (GDT) are natural candidates if we look for a theoretical foundation of linguistic pragmatics. Over the last decade, a firm research community has emerged with a strong interdisciplinary character, where economists, philosophers, and social scientists meet with linguists. Within this field of research, three major currents can be distinguished: one is closely related to the Gricean paradigm and aims at a precise foundation of pragmatic reasoning, the second originates in the economic literature and is concerned with the role of game theory in the context of language use, and the third aims at language evolution seen either from a biological or from a cultural perspective. Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this volume is based on a selection of papers of two international conferences, one organised at ESSLLI in 2007 on language, games, and evolution, and the other organised at the ZAS in Berlin on games and decisions in pragmatics in 2008. This volume is rounded off by additional invited papers and now contains eight articles of leading researchers in the field which together provide a state-of-the-art survey of current research on language evolution and game theoretic approaches to pragmatics.

ThisbookdiscusseshowTypeLogicalGrammarcanbemodi?edinsuch awaythatasystematictreatmentofanaphoraphenomenabecomesp- sible without giving up the general architecture of this framework. By Type Logical Grammar, I mean the version of Categorial Grammar that arose out of the work of Lambek, 1958 and Lambek, 1961. There Ca- gorial types are analyzed as formulae of a logical calculus. In particular, the Categorial slashes are interpreted as forms of constructive impli- tion in the sense of Intuitionistic Logic. Such a theory of grammar is per se attractive for a formal linguist who is interested in the interplay between formal logic and the structure of language. What makes L- bekstyleCategorialGrammarevenmoreexcitingisthefactthat(asvan Benthem,1983pointsout)theCurry-Howardcorrespondence-acentral part of mathematical proof theory which establishes a deep connection betweenconstructivelogicsandthe?-calculus-suppliesthetypelogical syntax with an extremely elegant and independently motivated interface to model-theoretic semantics. Prima facie, anaphora does not 't very well into the Categorial picture of the syntax-semantics interface. The Curry-Howard based composition of meaning operates in a local way, and meaning ass- bly is linear, i.e., every piece of lexical meaning is used exactly once. Anaphora, on the other hand, is in principle unbounded, and it involves by de?nition the multiple use of certain semantic resources. The latter problem has been tackled by several Categorial grammarians by ass- ing su?ciently complex lexical meanings for anaphoric expressions, but the locality problem is not easy to solve in a purely lexical way.

This volume presents the proceedings of the Computer Science Logic Workshop CSL '92, held in Pisa, Italy, in September/October 1992. CSL '92 was the sixth of the series and the first one held as Annual Conference of the European Association for Computer Science Logic (EACSL). Full versions of the workshop contributions were collected after their presentation and reviewed. On the basis of 58 reviews, 26 papers were selected for publication, and appear here in revised final form. Topics covered in the volume include: Turing machines, linear logic, logic of proofs, optimization problems, lambda calculus, fixpoint logic, NP-completeness, resolution, transition system semantics, higher order partial functions, evolving algebras, functional logic programming, inductive definability, semantics of C, classes for a functional language, NP-optimization problems, theory of types and names, sconing and relators, 3-satisfiability, Kleene's slash, negation-complete logic programs, polynomial-time oracle machines, and monadic second-order properties.

This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational semantics, infinitary queries, Kleene algebra with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others.

This book constitutes the refereed proceedings of the 14th Annual Conference on Theory and Applications of Models of Computation, TAMC 2017, held in Bern, Switzerland, in April 2017. The 45 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 103 submissions. The main themes of TAMC 2017 have been computability, computer science logic, complexity, algorithms, and models of computation and systems theory.