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 constitutes the thoroughly refereed post-workshop proceedings of the 10th International Workshop on Automated Deduction in Geometry, ADG 2014, held in Coimbra, Portugal, in July 2014. The 11 revised full papers presented in this volume were carefully selected from 20 submissions. The papers show the trend set of current research in automated reasoning in geometry.

This book provides an argumentation model for means end-reasoning, a distinctive type of reasoning used for problem-solving and decision-making. Means end-reasoning is modelled as goal-directed argumentation from an agent's goals and known circumstances, and from an action selected as a means, to a decision to carry out the action. Goal-based Reasoning for Argumentation provides an argumentation model of this kind of reasoning showing how it is employed in settings of intelligent deliberation where agents try to collectively arrive at a conclusion on what they should do to move forward in a set of circumstances. The book explains how this argumentation model can help build more realistic computational systems of deliberation and decision-making, and shows how such systems can be applied to solve problems posed by goal-based reasoning in numerous fields, from social psychology and sociology, to law, political science, anthropology, cognitive science, artificial intelligence, multi-agent systems, and robotics.

This is the first volume of a collection of papers in honor of the fiftieth birthday of Jean-Yves Beziau. These 25 papers have been written by internationally distinguished logicians, mathematicians, computer scientists, linguists and philosophers, including Arnon Avron, John Corcoran, Wilfrid Hodges, Laurence Horn, Lloyd Humbertsone, Dale Jacquette, David Makinson, Stephen Read, and Jan Wolenski. It is a state-of-the-art source of cutting-edge studies in the new interdisciplinary field of universal logic. The papers touch upon a wide range of topics including combination of logic, non-classical logic, square and other geometrical figures of opposition, categorical logic, set theory, foundation of logic, philosophy and history of logic (Aristotle, Avicenna, Buridan, Schroeder, MacColl). This book offers new perspectives and challenges in the study of logic and will be of interest to all students and researchers interested the nature and future of logic.

This collection of articles, originating from a short course held at the University of Manchester, explores the ideas behind Pila's proof of the Andre-Oort conjecture for products of modular curves. The basic strategy has three main ingredients: the Pila-Wilkie theorem, bounds on Galois orbits, and functional transcendence results. All of these topics are covered in this volume, making it ideal for researchers wishing to keep up to date with the latest developments in the field. Original papers are combined with background articles in both the number theoretic and model theoretic aspects of the subject. These include Martin Orr's survey of abelian varieties, Christopher Daw's introduction to Shimura varieties, and Jacob Tsimerman's proof via o-minimality of Ax's theorem on the functional case of Schanuel's conjecture.

An important figure in the development of modern mathematical logic and abstract algebra, Augustus De Morgan (1806-71) was also a witty writer who made a hobby of collecting evidence of paradoxical and illogical thinking from historical sources as well as contemporary pamphlets and periodicals. Based on articles that had appeared in The Athenaeum during his lifetime, this work was edited by his widow and published in book form in 1872. It parades all varieties of crackpot, from circle-squarers to inventors of perpetual motion machines, all for the reader's entertainment and education. Filled with anecdotes, personal opinions and 'squibs' of every kind, the book remains enjoyable reading for those who are amused rather than appalled by the human condition. Also reissued in the Cambridge Library Collection are the Memoir of Augustus De Morgan (1882), prepared by his wife, and his ambitious Formal Logic (1847).

Formal languages are widely regarded as being above all mathematical objects and as producing a greater level of precision and technical complexity in logical investigations because of this. Yet defining formal languages exclusively in this way offers only a partial and limited explanation of the impact which their use (and the uses of formalisms more generally elsewhere) actually has. In this book, Catarina Dutilh Novaes adopts a much wider conception of formal languages so as to investigate more broadly what exactly is going on when theorists put these tools to use. She looks at the history and philosophy of formal languages and focuses on the cognitive impact of formal languages on human reasoning, drawing on their historical development, psychology, cognitive science and philosophy. Her wide-ranging study will be valuable for both students and researchers in philosophy, logic, psychology and cognitive and computer science.

Few mathematical results capture the imagination like Georg Cantor's groundbreaking work on infinity in the late nineteenth century. This opened the door to an intricate axiomatic theory of sets which was born in the decades that followed. Written for the motivated novice, this book provides an overview of key ideas in set theory, bridging the gap between technical accounts of mathematical foundations and popular accounts of logic. Readers will learn of the formal construction of the classical number systems, from the natural numbers to the real numbers and beyond, and see how set theory has evolved to analyse such deep questions as the status of the continuum hypothesis and the axiom of choice. Remarks and digressions introduce the reader to some of the philosophical aspects of the subject and to adjacent mathematical topics. The rich, annotated bibliography encourages the dedicated reader to delve into what is now a vast literature.

The Annual European Meeting of the Association for Symbolic Logic, also known as the Logic Colloquium, is among the most prestigious annual meetings in the field. The current volume, Logic Colloquium 2007, with contributions from plenary speakers and selected special session speakers, contains both expository and research papers by some of the best logicians in the world. This volume covers many areas of contemporary logic: model theory, proof theory, set theory, and computer science, as well as philosophical logic, including tutorials on cardinal arithmetic, on Pillay's conjecture, and on automatic structures. This volume will be invaluable for experts as well as those interested in an overview of central contemporary themes in mathematical logic.

This book continues from where the authors' previous book, Structural Proof Theory, ended. It presents an extension of the methods of analysis of proofs in pure logic to elementary axiomatic systems and to what is known as philosophical logic. A self-contained brief introduction to the proof theory of pure logic is included that serves both the mathematically and philosophically oriented reader. The method is built up gradually, with examples drawn from theories of order, lattice theory and elementary geometry. The aim is, in each of the examples, to help the reader grasp the combinatorial behaviour of an axiom system, which typically leads to decidability results. The last part presents, as an application and extension of all that precedes it, a proof-theoretical approach to the Kripke semantics of modal and related logics, with a great number of new results, providing essential reading for mathematical and philosophical logicians.

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 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.

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.

This volume takes its name from a popular series of intensive mathematics workshops hosted at institutions in Appalachia and surrounding areas. At these meetings, internationally prominent set theorists give one-day lectures that focus on important new directions, methods, tools and results so that non-experts can begin to master these and incorporate them into their own research. Each chapter in this volume was written by the workshop leaders in collaboration with select student participants, and together they represent most of the meetings from the period 2006-2012. Topics covered include forcing and large cardinals, descriptive set theory, and applications of set theoretic ideas in group theory and analysis, making this volume essential reading for a wide range of researchers and graduate students.

Formal languages are widely regarded as being above all mathematical objects and as producing a greater level of precision and technical complexity in logical investigations because of this. Yet defining formal languages exclusively in this way offers only a partial and limited explanation of the impact which their use (and the uses of formalisms more generally elsewhere) actually has. In this book, Catarina Dutilh Novaes adopts a much wider conception of formal languages so as to investigate more broadly what exactly is going on when theorists put these tools to use. She looks at the history and philosophy of formal languages and focuses on the cognitive impact of formal languages on human reasoning, drawing on their historical development, psychology, cognitive science and philosophy. Her wide-ranging study will be valuable for both students and researchers in philosophy, logic, psychology and cognitive and computer science.

How strongly should you believe the various propositions that you can express?
That is the key question facing Bayesian epistemology. Subjective Bayesians hold that it is largely (though not entirely) up to the agent as to which degrees of belief to adopt. Objective Bayesians, on the other hand, maintain that appropriate degrees of belief are largely (though not entirely) determined by the agent's evidence. This book states and defends a version of objective Bayesian epistemology. According to this version, objective Bayesianism is characterized by three norms:
DT Probability - degrees of belief should be probabilities
DT Calibration - they should be calibrated with evidence
DT Equivocation - they should otherwise equivocate between basic outcomes
Objective Bayesianism has been challenged on a number of different fronts. For example, some claim it is poorly motivated, or fails to handle qualitative evidence, or yields counter-intuitive degrees of belief after updating, or suffers from a failure to learn from experience. It has also been accused of being computationally intractable, susceptible to paradox, language dependent, and of not being objective enough.
Especially suitable for graduates or researchers in philosophy of science, foundations of statistics and artificial intelligence, the book argues that these criticisms can be met and that objective Bayesianism is a promising theory with an exciting agenda for further research.

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.

This concise introduction to model theory begins with standard notions and takes the reader through to more advanced topics such as stability, simplicity and Hrushovski constructions. The authors introduce the classic results, as well as more recent developments in this vibrant area of mathematical logic. Concrete mathematical examples are included throughout to make the concepts easier to follow. The book also contains over 200 exercises, many with solutions, making the book a useful resource for graduate students as well as researchers.