Recent years have seen the development of powerful tools for verifying hardware and software systems, as companies worldwide realise the need for improved means of validating their products. There is increasing demand for training in basic methods in formal reasoning so that students can gain proficiency in logic-based verification methods. The second edition of this successful textbook addresses both those requirements, by continuing to provide a clear introduction to formal reasoning which is both relevant to the needs of modern computer science and rigorous enough for practical application. Improvements to the first edition have been made throughout, with extra and expanded sections on SAT solvers, existential/universal second-order logic, micro-models, programming by contract and total correctness. The coverage of model-checking has been substantially updated. Further exercises have been added. Internet support for the book includes worked solutions for all exercises for teachers, and model solutions to some exercises for students.

This volume presents the papers contributed to ?EON 2008, the 9th Inter- tional Conference on Deontic Logic in Computer Science, held in Luxembourg, July 16–18, 2008. This biennial conference series is designed to promote int- national cooperation amongst scholars who are interested in deontic logic and its use in computer science. The scope of the conference is interdisciplinary, and includes research that links the formal-logical study of normative concepts and normative systems with computer science, arti?cial intelligence, philosophy, - ganization theory, and law. The ?EON website, http://www.deonticlogic.org, contains links to previous conferences and their papers. This history reveals a vibrant interdisciplinary research program. Papers for these conferences might address such general themes as the - velopment of formal systems of deontic logic and related areas of logic, such as logics of action and agency, or the formal analysis of all sorts of normative concepts, such as the notions of rule, role, regulation, authority, power, rights, responsibility, etc., or the formal representation of legal knowledge. They might also be concerned with applications, such as the formal speci?cation of n- mative multiagent systems, the speci?cation of systems for the management of bureaucratic processes in public or private administration, or the speci?cation of database integrity constraints or computer security protocols, and more. Of particular interest is the interaction between computer systems and their users.

This volume presents the refereed proceedings of the 10th International Conference on Deontic Logic in Computer Science, DEON 2010, held in Fiesole, Italy, in July 2010. The 18 revised papers included in the volume were carefully reviewed and selected from 34 submissions. Topics covered include connections preferences, deontic logic and contrary-to-duties, the use of input/output logic, the study of norm dynamics, models of agents and institutions, argumentation, compliance, and various alternative analyses of deontic notions.

This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations of logic programming. The classic text is replete with illustrative examples and exercises. It presents applications and themes of computer science research such as resolution, automated deduction, and logic programming in a rigorous but readable way. The style and scope of the work, rounded out by the inclusion of exercises, make this an excellent textbook for an advanced undergraduate course in logic for computer scientists.

This is a mathematics textbook with theorems and proofs. The choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. In order to provide a balanced treatment of logic, tableaux are related to deductive proof systems. The book presents various logical systems and contains exercises. Still further, Prolog source code is available on an accompanying Web site. The author is an Associate Professor at the Department of Science Teaching, Weizmann Institute of Science.

This book illustrates linear logic in the application of proof theory to computer science.

The Annual Conference of the European Association for Computer Science Logic, CSL 2002, was held in the Old College of the University of Edinburgh on 22–25 September 2002. The conference series started as a programme of Int- national Workshops on Computer Science Logic, and then in its sixth meeting became the Annual Conference of the EACSL. This conference was the sixteenth meeting and eleventh EACSL conference; it was organized by the Laboratory for Foundations of Computer Science at the University of Edinburgh. The CSL 2002 Programme Committee considered 111 submissions from 28 countries during a two week electronic discussion; each paper was refereed by at least three reviewers. The Committee selected 37 papers for presentation at the conference and publication in these proceedings. The Programme Committee invited lectures from Susumu Hayashi, Frank Neven, and Damian Niwinski; ́ the papers provided by the invited speakers appear at the front of this volume. In addition to the main conference, two tutorials – ‘Introduction to Mu- Calculi’ (Julian Brad?eld) and ‘Parametrized Complexity’ (Martin Grohe) – were given on the previous day.

This book constitutes the proceedings of the 23rd International Workshop on Computer Science Logic, CSL 2009, held in Coimbra, Portugal, in September 2009. The 34 papers presented together with 5 invited talks were carefully reviewed and selected from 89 full paper submissions. All current aspects of logic in computer science are addressed, ranging from foundational and methodological issues to application issues of practical relevance. The book concludes with a presentation of this year's Ackermann award, the EACSL Outstanding Dissertation Award for Logic in Computer Science.

This book constitutes the joint refereed proceedings of the 17th International Workshop on Computer Science Logic, CSL 2003, held as the 12th Annual Conference of the EACSL and of the 8th Kurt Gödel Colloquium, KGC 2003 in Vienna, Austria, in August 2003. The 30 revised full papers presented together with abstracts of 9 invited presentations were carefully reviewed and selected from a total of 112 submissions. All current aspects of computer science logic are addressed ranging from mathematical logic and logical foundations to the application of logics in various computing aspects.

This book is a tribute to Professor Ewa Orłowska, a Polish logician who was celebrating the 60th year of her scientific career in 2017. It offers a collection of contributed papers by different authors and covers the most important areas of her research. Prof. Orłowska made significant contributions to many fields of logic, such as proof theory, algebraic methods in logic and knowledge representation, and her work has been published in 3 monographs and over 100 articles in internationally acclaimed journals and conference proceedings. The book also includes Prof. Orłowska’s autobiography, bibliography and a trialogue between her and the editors of the volume, as well as contributors' biographical notes, and is suitable for scholars and students of logic who are interested in understanding more about Prof. Orłowska’s work.