You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Proof Theory of Modal Logic is devoted to a thorough study of proof systems for modal logics, that is, logics of necessity, possibility, knowledge, belief, time, computations etc. It contains many new technical results and presentations of novel proof procedures. The volume is of immense importance for the interdisciplinary fields of logic, knowledge representation, and automated deduction.
This book constitutes the refereed proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2004, held in Barcelona, Spain in March/April 2004. The 34 revised full papers presented together with the abstracts of 2 invited talks were carefully reviewed and selected from over 130 submissions. Among the topics addressed are lambda calculus, cryptographic protocol analysis, graphs and grammar systems, decision theory, bisimulation, rewriting, normalization, specification, verification, process calculi, mobile code, automata, program semantics, dynamic logics, timed languages, security analysis, information-theoretical aspects.
The International Symposium on Computer Science in Russia (CSR 2006) was held on June 8–12, 2006 in St. Petersburg, Russia, hosted by the Steklov Institute of Mathematics at St. Petersburg.
The aim of this handbook is to create, for the first time, a systematic account of the field of spatial logic. The book comprises a general introduction, followed by fourteen chapters by invited authors. Each chapter provides a self-contained overview of its topic, describing the principal results obtained to date, explaining the methods used to obtain them, and listing the most important open problems. Jointly, these contributions constitute a comprehensive survey of this rapidly expanding subject.
Type theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. By concentrating on the principles that make the theory work in practice, the author covers all the key ideas without getting involved in the complications of more advanced systems. This book takes a type-assignment approach to type theory, and the system considered is the simplest polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm that lies at the heart of every such system. Also featured are two other interesting algorithms that until now have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making it the first book at this level that can be used as an introduction to type theory for computer scientists.
Gerhard Gentzen has been described as logic’s lost genius, whom Gödel called a better logician than himself. This work comprises articles by leading proof theorists, attesting to Gentzen’s enduring legacy to mathematical logic and beyond. The contributions range from philosophical reflections and re-evaluations of Gentzen’s original consistency proofs to the most recent developments in proof theory. Gentzen founded modern proof theory. His sequent calculus and natural deduction system beautifully explain the deep symmetries of logic. They underlie modern developments in computer science such as automated theorem proving and type theory.
This volume constitutes the proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods, TABLEAU '95, held at Schloß Rheinfels, St. Goar, Germany in May 1995. Originally tableau calculi and their relatives were favored primarily as a pedagogical device because of their advantages at the presentation level. The 23 full revised papers in this book bear witness that these methods have now gained fundamental importance in theorem proving, particularly as competitors for resolution methods. The book is organized in sections on extensions, modal logic, intuitionistic logic, the connection method and model elimination, non-clausal proof procedures, linear logic, higher-order logic, and applications
This book constitutes the proceedings of the 17th Conference on Computability in Europe, CiE 2021, organized by the University of Ghent in July 2021. Due to COVID-19 pandemic the conference was held virtually. The 48 full papers presented in this volume were carefully reviewed and selected from 50 submissions. CiE promotes the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2021 had as its motto Connecting with Computability, a clear acknowledgement of the connecting and interdisciplinary nature of the conference series which is all the more important in a time where people are more than ever disconnected from one another due to the COVID-19 pandemic.
Situation theory is the result of an interdisciplinary effort to create a full-fledged theory of information. Created by scholars and scientists from cognitive science, computer science and AI, linguistics, logic, philosophy, and mathematics, it aims to provide a common set of tools for the analysis of phenomena from all these fields. Unlike Shannon-Weaver type theories of information, which are purely quantitative theories, situation theory aims at providing tools for the analysis of the specific content of a situation (signal, message, data base, statement, or other information-carrying situation). The question addressed is not how much information is carried, but what information is carried.