This Festschrift volume, published in honor of Samson Abramsky, contains contributions written by some of his colleagues, former students, and friends. In celebration of the 60th birthday of Samson Abramsky, a conference was held in Oxford, UK, during May 28-30, 2010. The papers in this volume represent his manifold contributions to semantics, logic, games, and quantum mechanics.

The study of information-based actions and processes has been a vibrant - terface between logic and computer science for several decades now. Indeed, several natural perspectives come together here. On the one hand, logical s- tems may be used to describe the dynamics of arbitrary computational p- cesses as in the many sophisticated process logics available today. But also, key logical notions such as model checking or proof search are themselves informational processes involving agents with goals. The interplay between these descriptive and dynamic aspects shows even in our ordinary language. A word like proof hdenotes both a static certificate of truth, and an activity which humans or machines engage in. Increasing our understanding of l- ics of this sort tells us something about computer science, and about cognitive actions in general. The individual chapters of this book show the state of the art in current - vestigations of process calculi such as linear logic, and with mainly two major paradigms at work, namely, linear logic and modal logic. These techniques are applied to the title themes of concurrency and synchronisation, but there are also many repercussions for topics such as the geometry of proofs, categorial semantics, and logics of graphs. Viewed - gether, the chapters also offer exciting glimpses of future integration, as the reader moves back and forth through the book."

This book constitutes the refereed proceedings of the 12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013, held in Milan, Italy, in July 2013. The 30 papers (28 full papers, 8 poster papers, and 2 invited papers) were carefully reviewed and selected from 46 submissions. The topics of the volume include: quantum, cellular, molecular, neural, DNA, membrane, and evolutionary computing; cellular automata; computation based on chaos and dynamical systems; massive parallel computation; collective intelligence; computation based on physical principles such as relativistic, optical, spatial, collision-based computing; amorphous computing; physarum computing; hypercomputation; fuzzy and rough computing; swarm intelligence; artificial immune systems; physics of computation; chemical computation; evolving hardware; the computational nature of self-assembly, developmental processes, bacterial communication, and brain processes.

This book constitutes the proceedings of the 17th International Conference on Developments in Language Theory, DLT 2013, held in Marne-la-Vallee, France, in June 2013. The 34 full papers presented in this volume were carefully reviewed and selected from 63 submissions. The scope of the conference includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphs, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; cellular automata; bio-inspired computing; and quantum computing.

Mountaineers use pitons to protect themselves from falls. The lead climber wears a harness to which a rope is tied. As the climber ascends, the rope is paid out by a partner on the ground. As described thus far, the climber receives no protection from the rope or the partner. However, the climber generally carries several spike-like pitons and stops when possible to drive one into a small crack or crevice in the rock face. After climbing just above the piton, the climber clips the rope to the piton, using slings and carabiners. A subsequent fall would result in the climber hanging from the piton if the piton stays in the rock, the slings and carabiners do not fail, the rope does not break, the partner is holding the rope taut and secure, and the climber had not climbed too high above the piton before falling. The climber's safety clearly depends on all of the components of the system. But the piton is distinguished because it connects the natural to the artificial. In 1987 I designed an assembly-level language for Warren Hunt's FM8501 verified microprocessor. I wanted the language to be conveniently used as the object code produced by verified compilers. Thus, I envisioned the language as the first software link in a trusted chain from verified hardware to verified applications programs. Thinking of the hardware as the "rock" I named the language "Piton."

Change, Choice and Inference unifies lively and significant strands of research in logic, philosophy, economics and artificial intelligence.

This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics are closely related. In particular, proving lower bounds on the lengths of proofs in propositional proof systems is equivalent to constructing certain extensions of models of bounded arithmetic. This offers a clean and coherent framework for thinking about lower bounds for proof lengths, and it has proved quite successful in the past. This book outlines a brand new method for constructing models of bounded arithmetic, thus for proving independence results and establishing lower bounds for proof lengths. The models are built from random variables defined on a sample space which is a non-standard finite set and sampled by functions of some restricted computational complexity. It will appeal to anyone interested in logical approaches to fundamental problems in complexity theory.

Paolo Mancosu presents a series of innovative studies in the history and the philosophy of logic and mathematics in the first half of the twentieth century. The Adventure of Reason is divided into five main sections: history of logic (from Russell to Tarski); foundational issues (Hilbert's program, constructivity, Wittgenstein, Goedel); mathematics and phenomenology (Weyl, Becker, Mahnke); nominalism (Quine, Tarski); semantics (Tarski, Carnap, Neurath). Mancosu exploits extensive untapped archival sources to make available a wealth of new material that deepens in significant ways our understanding of these fascinating areas of modern intellectual history. At the same time, the book is a contribution to recent philosophical debates, in particular on the prospects for a successful nominalist reconstruction of mathematics, the nature of finitist intuition, the viability of alternative definitions of logical consequence, and the extent to which phenomenology can hope to account for the exact sciences.

In this 1987 text Professor Jech gives a unified treatment of the various forcing methods used in set theory, and presents their important applications. Product forcing, iterated forcing and proper forcing have proved powerful tools when studying the foundations of mathematics, for instance in consistency proofs. The book is based on graduate courses though some results are also included, making the book attractive to set theorists and logicians.

Relational mathematics is to operations research and informatics what numerical mathematics is to engineering: it is intended to help modelling, reasoning, and computing. Its applications are therefore diverse, ranging from psychology, linguistics, decision aid, and ranking to machine learning and spatial reasoning. Although many developments have been made in recent years, they have rarely been shared amongst this broad community of researchers. This comprehensive 2010 overview begins with an easy introduction to the topic, assuming a minimum of prerequisites; but it is nevertheless theoretically sound and up to date. It is suitable for applied scientists, explaining all the necessary mathematics from scratch using a multitude of visualised examples, via matrices and graphs. It ends with tangible results on the research level. The author illustrates the theory and demonstrates practical tasks in operations research, social sciences and the humanities.

Introduction to Mathematical Proofs helps students develop the necessary skills to write clear, correct, and concise proofs. Unlike similar textbooks, this one begins with logic since it is the underlying language of mathematics and the basis of reasoned arguments. The text then discusses deductive mathematical systems and the systems of natural numbers, integers, rational numbers, and real numbers. It also covers elementary topics in set theory, explores various properties of relations and functions, and proves several theorems using induction. The final chapters introduce the concept of cardinalities of sets and the concepts and proofs of real analysis and group theory. In the appendix, the author includes some basic guidelines to follow when writing proofs. This new edition includes more than 125 new exercises in sections titled More Challenging Exercises. Also, numerous examples illustrate in detail how to write proofs and show how to solve problems. These examples can serve as models for students to emulate when solving exercises. Several biographical sketches and historical comments have been included to enrich and enliven the text. Written in a conversational style, yet maintaining the proper level of mathematical rigor, this accessible book teaches students to reason logically, read proofs critically, and write valid mathematical proofs. It prepares them to succeed in more advanced mathematics courses, such as abstract algebra and analysis.

In recent years, Artificial Intelligence researchers have largely focused their efforts on solving specific problems, with less emphasis on 'the big picture' - automating large scale tasks which require human-level intelligence to undertake. The subject of this book, automated theory formation in mathematics, is such a large scale task. Automated theory formation requires the invention of new concepts, the calculating of examples, the making of conjectures and the proving of theorems. This book, representing four years of PhD work by Dr. Simon Colton demonstrates how theory formation can be automated. Building on over 20 years of research into constructing an automated mathematician carried out in Professor Alan Bundy's mathematical reasoning group in Edinburgh, Dr. Colton has implemented the HR system as a solution to the problem of forming theories by computer. HR uses various pieces of mathematical software, including automated theorem provers, model generators and databases, to build a theory from the bare minimum of information - the axioms of a domain. The main application of this work has been mathematical discovery, and HR has had many successes. In particular, it has invented 20 new types of number of sufficient interest to be accepted into the Encyclopaedia of Integer Sequences, a repository of over 60,000 sequences contributed by many (human) mathematicians.

This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.

This comprehensive two-volume work is devoted to the most general beginnings of mathematics. It goes back to Hausdorff's classic Set Theory (2nd ed., 1927), where set theory and the theory of functions were expounded as the fundamental parts of mathematics in such a way that there was no need for references to other sources. Along the lines of Hausdorff's initial work (1st ed., 1914), measure and integration theory is also included here as the third fundamental part of contemporary mathematics.The material about sets and numbers is placed in Volume 1 and the material about functions and measures is placed in Volume 2. Contents Fundamentals of the theory of classes, sets, and numbers Characterization of all natural models of Neumann - Bernays - Godel and Zermelo - Fraenkel set theories Local theory of sets as a foundation for category theory and its connection with the Zermelo - Fraenkel set theory Compactness theorem for generalized second-order language

Gert H. Muller The growth of the number of publications in almost all scientific areas, as in the area of (mathematical) logic, is taken as a sign of our scientifically minded culture, but it also has a terrifying aspect. In addition, given the rapidly growing sophistica- tion, specialization and hence subdivision of logic, researchers, students and teachers may have a hard time getting an overview of the existing literature, partic- ularly if they do not have an extensive library available in their neighbourhood: they simply do not even know what to ask for! More specifically, if someone vaguely knows that something vaguely connected with his interests exists some- where in the literature, he may not be able to find it even by searching through the publications scattered in the review journals. Answering this challenge was and is the central motivation for compiling this Bibliography. The Bibliography comprises (presently) the following six volumes (listed with the corresponding Editors): I. Classical Logic W. Rautenberg 11. Non-classical Logics W. Rautenberg 111. Model Theory H. -D. Ebbinghaus IV. Recursion Theory P. G. Hinman V. Set Theory A. R. Blass VI. ProofTheory; Constructive Mathematics J. E. Kister; D. van Dalen & A. S. Troelstra.

Kurt Goedel (1906-1978) did groundbreaking work that transformed logic and other important aspects of our understanding of mathematics, especially his proof of the incompleteness of formalized arithmetic. This book on different aspects of his work and on subjects in which his ideas have contemporary resonance includes papers from a May 2006 symposium celebrating Goedel's centennial as well as papers from a 2004 symposium. Proof theory, set theory, philosophy of mathematics, and the editing of Goedel's writings are among the topics covered. Several chapters discuss his intellectual development and his relation to predecessors and contemporaries such as Hilbert, Carnap, and Herbrand. Others consider his views on justification in set theory in light of more recent work and contemporary echoes of his incompleteness theorems and the concept of constructible sets.

This book constitutes the refereed proceedings of the 33rd International Conference on Applications and Theory of Petri Nets and Concurrency, PETRI NETS 2012, held in Hamburg, Germany, in June 2012. The 18 regular papers and 3 tool papers presented were carefully reviewed and selected from 55 submissions. The book also contains 2 invited talks. All current issues on research and development in the area of Petri nets and related models of concurrent systems are addressed.

Gert H. Muller The growth of the number of publications in almost all scientific areas,* as in the area of (mathematical) logic, is taken as a sign of our scientifically minded culture, but it also has a terrifying aspect. In addition, given the rapidly growing sophistica- tion, specialization and hence subdivision of logic, researchers, students and teachers may have a hard time getting an overview ofthe existing literature, partic- ularly if they do not have an extensive library available in their neighbourhood: they simply do not even know what to ask for! More specifically, if someone vaguely knows that something vaguely connected with his interests exists some- where in the literature, he may not be able to find it even by searching through the publications scattered in the review journals. Answering this challenge was and is the central motivation for compiling this Bibliography. The Bibliography comprises (presently) the following six volumes (listed with the corresponding Editors): I. Classical Logic W. Rautenberg II. Non-c1assical Logics W. Rautenberg IH. Model Theory H. -D. Ebbinghaus IV. Recursion Theory P. G. Hinman V. Set Theory A. R. Blass VI. ProofTheory; Constructive Mathematics J. E. Kister; D. van Dalen & A. S. Troelstra.

This book presents methods and results from the theory of Zariski structures and discusses their applications in geometry as well as various other mathematical fields. Its logical approach helps us understand why algebraic geometry is so fundamental throughout mathematics and why the extension to noncommutative geometry, which has been forced by recent developments in quantum physics, is both natural and necessary. Beginning with a crash course in model theory, this book will suit not only model theorists but also readers with a more classical geometric background.

This book treats bounded arithmetic and propositional proof complexity from the point of view of computational complexity. The first seven chapters include the necessary logical background for the material and are suitable for a graduate course. Associated with each of many complexity classes are both a two-sorted predicate calculus theory, with induction restricted to concepts in the class, and a propositional proof system. The complexity classes range from AC0 for the weakest theory up to the polynomial hierarchy. Each bounded theorem in a theory translates into a family of (quantified) propositional tautologies with polynomial size proofs in the corresponding proof system. The theory proves the soundness of the associated proof system. The result is a uniform treatment of many systems in the literature, including Buss's theories for the polynomial hierarchy and many disparate systems for complexity classes such as AC0, AC0(m), TC0, NC1, L, NL, NC, and P.

Dealing with uncertainty, moving from ignorance to knowledge, is the focus of cognitive processes. Understanding these processes and modelling, designing, and building artificial cognitive systems have long been challenging research problems.

This book describes the theory and methodology of a new, scientifically well-founded general approach, and its realization in the form of intelligent systems applicable in disciplines ranging from social sciences, such as cognitive science and sociology, through natural sciences, such as life sciences and chemistry, to applied sciences, such as medicine, education, and engineering.

The main subject developed in the book is cognitive reasoning investigated at three levels of abstraction: conceptual, formal, and realizational. The authors offer a model of a cognizing agent for the conceptual theory of cognitive reasoning, and they also present a logically well-founded formal cognitive reasoning framework to handle the various plausible reasoning methods. They conclude with an object model of a cognitive engine.

The book is suitable for researchers, scientists, and graduate students working in the areas of artificial intelligence, mathematical logic, and philosophy.

Agents act on the basis of their beliefs and these beliefs change as they interact with other agents. In this book the authors propose and explain general logical tools for handling change. These tools include preferential reasoning, theory revision, and reasoning in inheritance systems, and the authors use these tools to examine nonmonotonic logic, deontic logic, counterfactuals, modal logic, intuitionistic logic, and temporal logic.

This book will be of benefit to researchers engaged with artificial intelligence, and in particular agents, multiagent systems and nonmonotonic logic.

Lattice theory evolved as part of algebra in the nineteenth century through the work of Boole, Peirce and Schroder, and in the first half of the twentieth century through the work of Dedekind, Birkhoff, Ore, von Neumann, Mac Lane, Wilcox, Dilworth, and others. In Semimodular Lattices, Manfred Stern uses successive generalizations of distributive and modular lattices to outline the development of semimodular lattices from Boolean algebras. He focuses on the important theory of semimodularity, its many ramifications, and its applications in discrete mathematics, combinatorics, and algebra. The author surveys and analyzes Birkhoff's concept of semimodularity and the various related concepts in lattice theory, and he presents theoretical results as well as applications in discrete mathematics group theory and universal algebra. Special emphasis is given to the combinatorial aspects of finite semimodular lattices and to the connections between matroids and geometric lattices, antimatroids and locally distributive lattices. The book also deals with lattices that are "close" to semimodularity or can be combined with semimodularity, for example supersolvable, admissible, consistent, strong, and balanced lattices. Researchers in lattice theory, discrete mathematics, combinatorics, and algebra will find this book valuable.

Fuzzy Algorithms for Control gives an overview of the research results of a number of European research groups that are active and play a leading role in the field of fuzzy modeling and control. It contains 12 chapters divided into three parts. Chapters in the first part address the position of fuzzy systems in control engineering and in the AI community. State-of-the-art surveys on fuzzy modeling and control are presented along with a critical assessment of the role of these methodologists in control engineering. The second part is concerned with several analysis and design issues in fuzzy control systems. The analytical issues addressed include the algebraic representation of fuzzy models of different types, their approximation properties, and stability analysis of fuzzy control systems. Several design aspects are addressed, including performance specification for control systems in a fuzzy decision-making framework and complexity reduction in multivariable fuzzy systems. In the third part of the book, a number of applications of fuzzy control are presented. It is shown that fuzzy control in combination with other techniques such as fuzzy data analysis is an effective approach to the control of modern processes which present many challenges for the design of control systems. One has to cope with problems such as process nonlinearity, time-varying characteristics for incomplete process knowledge. Examples of real-world industrial applications presented in this book are a blast furnace, a lime kiln and a solar plant. Other examples of challenging problems in which fuzzy logic plays an important role and which are included in this book are mobile robotics and aircraft control. The aim of this book is to address both theoretical and practical subjects in a balanced way. It will therefore be useful for readers from the academic world and also from industry who want to apply fuzzy control in practice.

This book celebrates the work of Don Pigozzi on the occasion of his 80th birthday. In addition to articles written by leading specialists and his disciples, it presents Pigozzi's scientific output and discusses his impact on the development of science. The book both catalogues his works and offers an extensive profile of Pigozzi as a person, sketching the most important events, not only related to his scientific activity, but also from his personal life. It reflects Pigozzi's contribution to the rise and development of areas such as abstract algebraic logic (AAL), universal algebra and computer science, and introduces new scientific results. Some of the papers also present chronologically ordered facts relating to the development of the disciplines he contributed to, especially abstract algebraic logic. The book offers valuable source material for historians of science, especially those interested in history of mathematics and logic.