This book is an example of fruitful interaction between (non-classical) propo sitionallogics and (classical) model theory which was made possible due to categorical logic. Its main aim consists in investigating the existence of model completions for equational theories arising from propositional logics (such as the theory of Heyting algebras and various kinds of theories related to proposi tional modal logic ). The existence of model-completions turns out to be related to proof-theoretic facts concerning interpretability of second order propositional logic into ordinary propositional logic through the so-called 'Pitts' quantifiers' or 'bisimulation quantifiers'. On the other hand, the book develops a large number of topics concerning the categorical structure of finitely presented al gebras, with related applications to propositional logics, both standard (like Beth's theorems) and new (like effectiveness of internal equivalence relations, projectivity and definability of dual connectives such as difference). A special emphasis is put on sheaf representation, showing that much of the nice categor ical structure of finitely presented algebras is in fact only a restriction of natural structure in sheaves. Applications to the theory of classifying toposes are also covered, yielding new examples. The book has to be considered mainly as a research book, reporting recent and often completely new results in the field; we believe it can also be fruitfully used as a complementary book for graduate courses in categorical and algebraic logic, universal algebra, model theory, and non-classical logics. 1.

This book is a revised version of the PhD dissertation written by the author at the Free University of Bozen-Bolzano in Italy. It presents a new approach to safety verification of a particular class of infinite-state systems, called Data-Aware Processes (DAPs). To do so, the developed technical machinery requires to devise novel results for uniform interpolation and its combination in the context of automated reasoning. These results are then applied to the analysis of concrete business processes enriched with real data. In 2022, the PhD dissertation won the “BPM Dissertation Award”, granted to outstanding PhD theses in the field of Business Process Management.

This two-volume set LNAI 12166 and 12167 constitutes the refereed proceedings of the 10th International Joint Conference on Automated Reasoning, IJCAR 2020, held in Paris, France, in July 2020.* In 2020, IJCAR was a merger of the following leading events, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), ITP (International Conference on Interactive Theorem Proving), and TABLEAUX (International Conference on Analytic Tableaux and Related Methods). The 46 full research papers, 5 short papers, and 11 system descriptions presented together with two invited talks were carefully reviewed and selected from 150 submissions. The papers focus on the following topics: Part I: SAT; SMT and QBF; decision procedures and combination of theories; superposition; proof procedures; non classical logics Part II: interactive theorem proving/ HOL; formalizations; verification; reasoning systems and tools *The conference was held virtually due to the COVID-19 pandemic. Chapter ‘Constructive Hybrid Games’ is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

This book constitutes the proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2016, which took place in Eindhoven, The Netherlands, in April 2016, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016. The 31 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: types; recursion and fixed-points; verification and program analysis; automata, logic, games; probabilistic and timed systems; proof theory and lambda calculus; algorithms for infinite systems; and monads.

This volume is easily accessible to young people and mathematicians unfamiliar with logic. It gives a terse historical picture of Model Theory and introduces the latest developments in the area. It further provides 'hands-on' proofs of elimination of quantifiers, elimination of imaginaries and other relevant matters. The book is for trainees and professional model theorists, and mathematicians working in Algebra and Geometry.

This Undergraduate Textbook introduces key methods and examines the major areas of philosophy in which formal methods play pivotal roles. Coverage begins with a thorough introduction to formalization and to the advantages and pitfalls of formal methods in philosophy. The ensuing chapters show how to use formal methods in a wide range of areas. Throughout, the contributors clarify the relationships and interdependencies between formal and informal notions and constructions. Their main focus is to show how formal treatments of philosophical problems may help us understand them better. Formal methods can be used to solve problems but also to express new philosophical problems that would never have seen the light of day without the expressive power of the formal apparatus. ​Formal philosophy merges work in different areas of philosophy as well as logic, mathematics, computer science, linguistics, physics, psychology, biology, economics, political theory, and sociology. This title offers an accessible introduction to this new interdisciplinary research area to a wide academic audience.

A classic exposition of a branch of mathematical logic that uses category theory, this text is suitable for advanced undergraduates and graduate students and accessible to both philosophically and mathematically oriented readers.

This book constitutes the proceeding of the 27th International Conference on Automated Deduction, CADE 27, held in Natal, Brazil, in August 2019. The 27 full papers and 7 system descriptions presented were carefully reviewed and selected from 65 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience.

Andrzej Mostowski was one of the leading 20th century logicians. His legacy is examined in this volume of papers devoted both to his extraordinary scientific heritage and to the memory of him as a great researcher, teacher, organizer of science and human. Professor Mostowski pioneered and mastered many areas of mathematical logic. His contributions spanned set theory, recursion theory, and model theory - the backbone of foundations of mathematics. He is best known of the Kleene-Mostowski and Davis-Mostowski hierarchies of properties of integers reflecting the complexity of their definitions, and of the very elegant concept of a generalized quantifier which inspired and keeps stimulating a stream of deep work on fundamental issues of logics, deduction and reasoning both in mathematics and in computer science, and also of the contributions and excellent lectures on undecidability, unprovability, consistency and independence of various statements in set theory and arithmetic following Gödel, Tarski and Cohen. The overall content of the volume is designed to cover the current main streams in the field. For many years after WWII, especially in the late sixties, till his untimely death in 1975, Warsaw - where he led the centre of foundational studies - was a place where many leading logicians visited, studied, and started their career. Their memories form an important part of this volume, attempting to bring back the extraordinary achievements and personality of Mostowski.

"Is quantum logic really logic?" This book argues for a positive answer to this question once and for all. There are many quantum logics and their structures are delightfully varied. The most radical aspect of quantum reasoning is reflected in unsharp quantum logics, a special heterodox branch of fuzzy thinking. For the first time, the whole story of Quantum Logic is told; from its beginnings to the most recent logical investigations of various types of quantum phenomena, including quantum computation. Reasoning in Quantum Theory is designed for logicians, yet amenable to advanced graduate students and researchers of other disciplines.