This book constitutes the revised selected papers from the 12th International Conference on Formal Aspects of Component Software, FACS 2015, held in Niteroi, Brazil, in October 2015. The 15 full papers and 2 invited papers presented in this volume were carefully reviewed and selected from 33 submissions. They are organized in topical sections, namely quality of service to withstand faults, component-based software development through research on mathematical models for components, composition and adaptation; rigorous approaches to verification, deployment, testing, and certification.

This Festschrift is published in honor of Yuri Gurevich's 75th birthday. Yuri Gurevich has made fundamental contributions on the broad spectrum of logic and computer science, including decision procedures, the monadic theory of order, abstract state machines, formal methods, foundations of computer science, security, and much more. Many of these areas are reflected in the 20 articles in this Festschrift and in the presentations at the "Yurifest" symposium, which was held in Berlin, Germany, on September 11 and 12, 2015. The Yurifest symposium was co-located with the 24th EACSL Annual Conference on Computer Science Logic (CSL 2015).

This book offers an original contribution to the foundations of logic and mathematics and focuses on the internal logic of mathematical theories, from arithmetic or number theory to algebraic geometry. Arithmetical logic is the term used to refer to the internal logic of classical arithmetic, here called Fermat-Kronecker arithmetic and combines Fermat's method of infinite descent with Kronecker's general arithmetic of homogeneous polynomials. The book also includes a treatment of theories in physics and mathematical physics to underscore the role of arithmetic from a constructivist viewpoint. The scope of the work intertwines historical, mathematical, logical and philosophical dimensions in a unified critical perspective; as such, it will appeal to a broad readership from mathematicians to logicians, to philosophers interested in foundational questions. Researchers and graduate students in the fields of philosophy and mathematics will benefit from the author's critical approach to the foundations of logic and mathematics.

George Gratzer's Lattice Theory: Foundation is his third book on lattice theory (General Lattice Theory, 1978, second edition, 1998). In 2009, Gratzer considered updating the second edition to reflect some exciting and deep developments. He soon realized that to lay the foundation, to survey the contemporary field, to pose research problems, would require more than one volume and more than one person. So Lattice Theory: Foundation provided the foundation. Now we complete this project with Lattice Theory: Special Topics and Applications, written by a distinguished group of experts, to cover some of the vast areas not in Foundation. This first volume is divided into three parts. Part I. Topology and Lattices includes two chapters by Klaus Keimel, Jimmie Lawson and Ales Pultr, Jiri Sichler. Part II. Special Classes of Finite Lattices comprises four chapters by Gabor Czedli, George Gratzer and Joseph P. S. Kung. Part III. Congruence Lattices of Infinite Lattices and Beyond includes four chapters by Friedrich Wehrung and George Gratzer.

Logic is often perceived as having little to do with the rest of philosophy, and even less to do with real life. In this lively and accessible introduction, Graham Priest shows how wrong this conception is. He explores the philosophical roots of the subject, explaining how modern formal logic deals with issues ranging from the existence of God and the reality of time to paradoxes of probability and decision theory. Along the way, the basics of formal logic are explained in simple, non-technical terms, showing that logic is a powerful and exciting part of modern philosophy. In this new edition Graham Priest expands his discussion to cover the subjects of algorithms and axioms, and proofs in mathematics. ABOUT THE SERIES: The Very Short Introductions series from Oxford University Press contains hundreds of titles in almost every subject area. These pocket-sized books are the perfect way to get ahead in a new subject quickly. Our expert authors combine facts, analysis, perspective, new ideas, and enthusiasm to make interesting and challenging topics highly readable.

Possible worlds models were introduced by Saul Kripke in the early 1960s. Basically, a possible world's model is nothing but a graph with labelled nodes and labelled edges. Such graphs provide semantics for various modal logics (alethic, temporal, epistemic and doxastic, dynamic, deontic, description logics) and also turned out useful for other nonclassical logics (intuitionistic, conditional, several paraconsistent and relevant logics). All these logics have been studied intensively in philosophical and mathematical logic and in computer science, and have been applied increasingly in domains such as program semantics, artificial intelligence, and more recently in the semantic web. Additionally, all these logics were also studied proof theoretically. The proof systems for modal logics come in various styles: Hilbert style, natural deduction, sequents, and resolution. However, it is fair to say that the most uniform and most successful such systems are tableaux systems. Givenlogic and a formula, they allow one to check whether there is a model in that logic. This basically amounts to trying to build a model for the formula by building a tree.

This book follows a more general approach by trying to build a graph, the advantage being that a graph is closer to a Kripke model than a tree. It provides a step-by-step introduction to possible worlds semantics (and by that to modal and other nonclassical logics) via the tableaux method. It is accompanied by a piece of software called LoTREC (www.irit.fr/Lotrec). LoTREC allows to check whether a given formula is true at a given world of a given model and to check whether a given formula is satisfiable in a given logic. The latter can be done immediately if the tableau system for that logic has already been implemented in LoTREC. If this is not yet the case LoTREC offers the possibility to implement a tableau system in a relatively easy way via a simple, graph-based, interactive language."

This book constitutes the thoroughly refereed post-conference proceedings of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2012, held in Leuven, Belgium in September 2012. The 13 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 27 submissions. Among the topics covered are specification, synthesis, verification, analysis, optimization, specialization, security, certification, applications and tools, program/model manipulation, and transformation techniques for any programming language paradigm.

This book constitutes the refereed proceedings of the 11th International Conference on Formal Concept Analysis, ICFCA 2013, held in Dresden, Germany, in May 2013. The 15 regular papers presented in this volume were carefully reviewed and selected from 46 submissions. The papers present current research from a thriving theoretical community and a rapidly expanding range of applications in information and knowledge processing including data visualization and analysis (mining), knowledge management, as well as Web semantics, and software engineering. In addition the book contains a reprint of the first publication in english describing the seminal stem-base construction by Guigues and Duquenne; and a position paper pointing out potential future applications of FCA.

New scientific paradigms typically consist of an expansion of the conceptual language with which we describe the world. Over the past decade, theoretical physics and quantum information theory have turned to category theory to model and reason about quantum protocols. This new use of categorical and algebraic tools allows a more conceptual and insightful expression of elementary events such as measurements, teleportation and entanglement operations, that were obscured in previous formalisms. Recent work in natural language semantics has begun to use these categorical methods to relate grammatical analysis and semantic representations in a unified framework for analysing language meaning, and learning meaning from a corpus. A growing body of literature on the use of categorical methods in quantum information theory and computational linguistics shows both the need and opportunity for new research on the relation between these categorical methods and the abstract notion of information flow. This book supplies an overview of how categorical methods are used to model information flow in both physics and linguistics. It serves as an introduction to this interdisciplinary research, and provides a basis for future research and collaboration between the different communities interested in applying category theoretic methods to their domain's open problems.

Since the advent of the Semantic Web, interest in the dynamics of ontologies (ontology evolution) has grown significantly. Belief revision presents a good theoretical framework for dealing with this problem; however, classical belief revision is not well suited for logics such as Description Logics.

"Belief Revision in Non-Classical Logics" presents a framework which can be applied to a wide class of logics that include - besides most Description Logics such as the ones behind OWL - Horn Logic and Intuitionistic logic, amongst others. The author also presents algorithms for the most important constructions in belief bases. Researchers and practitioners in theoretical computing will find this an invaluable resource.

A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical logic as well as practical applications through the easy to understand and use deductive systems of Semantic Tableaux and Resolution. The chapters on set theory, number theory, combinatorics and graph theory combine the necessary minimum of theory with numerous examples and selected applications. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in the accompanying solutions manual. Key Features : Suitable for a variety of courses for students in both Mathematics and Computer Science. Extensive, in-depth coverage of classical logic, combined with a solid exposition of a selection of the most important fields of discrete mathematics Concise, clear and uncluttered presentation with numerous examples. Covers some applications including cryptographic systems, discrete probability and network algorithms. Logic and Discrete Mathematics: A Concise Introduction is aimed mainly at undergraduate courses for students in mathematics and computer science, but the book will also be a valuable resource for graduate modules and for self-study.

Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to understand. The uniform use of tableaux-based techniques facilitates learning advanced logical systems based on what the student has learned from elementary systems. The logical systems presented are: propositional logic, first-order logic, resolution and its application to logic programming, Hoare logic for the verification of sequential programs, and linear temporal logic for the verification of concurrent programs. The third edition has been entirely rewritten and includes new chapters on central topics of modern computer science: SAT solvers and model checking.

Mathematical Logic and Model Theory: A Brief Introduction offers a streamlined yet easy-to-read introduction to mathematical logic and basic model theory. It presents, in a self-contained manner, the essential aspects of model theory needed to understand model theoretic algebra. As a profound application of model theory in algebra, the last part of this book develops a complete proof of Ax and Kochen's work on Artin's conjecture about Diophantine properties of p-adic number fields. The character of model theoretic constructions and results differ quite significantly from that commonly found in algebra, by the treatment of formulae as mathematical objects. It is therefore indispensable to first become familiar with the problems and methods of mathematical logic. Therefore, the text is divided into three parts: an introduction into mathematical logic (Chapter 1), model theory (Chapters 2 and 3), and the model theoretic treatment of several algebraic theories (Chapter 4). This book will be of interest to both advanced undergraduate and graduate students studying model theory and its applications to algebra. It may also be used for self-study.

Statistical data are not always precise numbers, or vectors, or categories. Real data are frequently what is called fuzzy. Examples where this fuzziness is obvious are quality of life data, environmental, biological, medical, sociological and economics data. Also the results of measurements can be best described by using fuzzy numbers and fuzzy vectors respectively. Statistical analysis methods have to be adapted for the analysis of fuzzy data. In this book, the foundations of the description of fuzzy data are explained, including methods on how to obtain the characterizing function of fuzzy measurement results. Furthermore, statistical methods are then generalized to the analysis of fuzzy data and fuzzy a-priori information. Key Features: * Provides basic methods for the mathematical description of fuzzy data, as well as statistical methods that can be used to analyze fuzzy data. * Describes methods of increasing importance with applications in areas such as environmental statistics and social science. * Complements the theory with exercises and solutions and is illustrated throughout with diagrams and examples. * Explores areas such quantitative description of data uncertainty and mathematical description of fuzzy data. This work is aimed at statisticians working with fuzzy logic, engineering statisticians, finance researchers, and environmental statisticians. It is written for readers who are familiar with elementary stochastic models and basic statistical methods.