This text is based on the chapter Domain Theory in the Handbook for Logic in Computer
Science, volume 3, edited by S. Abramsky, Dov M. Gabbay, and TS E. Maibaum, published …

This book presents a guide to the extensive literature on the topic of semirings and includes
a complete bibliography. It serves as a complement to the existing monographs and a point …

The Curry-Howard isomorphism states an amazing correspondence between systems of
formal logic as encountered in proof theory and computational calculi as found in type …

This book develops a view of logic as a theory of information-driven agency and intelligent
interaction between many agents-with conversation, argumentation and games as guiding …

An intensional model for the programming language PCF is described in which the types of
PCF are interpreted by games and the terms by certain history-free strategies. This model is …

Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where
all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) …

We show how to specify components of concurrent systems. The specification of a system is
the conjunction of its components' specifications. Properties of the system are proved by …

Proof Theory is the area of mathematics which studies the concepts of mathematical proof
and mathematical provability. Since the notion of “proof” plays a central role in mathematics …

The idea for this book was suggested by Bill Cobern. We would like to thank him for his
encouragement and support. A number of people assisted in the preparation of this book …

The term" social software" refers to the project of analyzing social procedures and processes
using the formal methods of computer science. Examples of the social procedures we have …