Labelled deduction is an approach to providing frameworks for presenting and using different logics in a uniform and natural way by enriching the language of a logic with additional information of a semantic proof-theoretical nature. Labelled deduction systems often possess attractive properties, such as modularity in the way that families of related logics are presented, parameterised proofs of metatheoretic properties, and ease of mechanisability. It is thus not surprising that labelled deduction has been applied to problems in computer science, AI, mathematical logic, cognitive science, philosophy and computational linguistics - for example, formalizing and reasoning about dynamic `state oriented' properties such as knowledge, belief, time, space, and resources.
I am very happy to have this opportunity to introduce Luca Vigano's book on Labelled Non-Classical Logics. I put forward the methodology of labelled deductive systems to the participants of Logic Colloquium'90 (Labelled Deductive systems, a Position Paper, In J. Oikkonen and J. Vaananen, editors, Logic Colloquium '90, Volume 2 of Lecture Notes in Logic, pages 66-68, Springer, Berlin, 1993), in an attempt to bring labelling as a recognised and significant component of our logic culture. It was a response to earlier isolated uses of labels by various distinguished authors, as a means to achieve local proof theoretic goals. Labelling was used in many different areas such as resource labelling in relevance logics, prefix tableaux in modal logics, annotated logic programs in logic programming, proof tracing in truth maintenance systems, and various side annotations in higher-order proof theory, arithmetic and analysis. This widespread local use of labels was an indication of an underlying logical pattern, namely the simultaneous side-by-side manipulation of several kinds of logical information. It was clear that there was a need to establish the labelled deductive systems methodology. Modal logic is one major area where labelling can be developed quickly and sys tematically with a view of demonstrating its power and significant advantage. In modal logic the labels can play a double role.
This comprehensive book provides an adequate framework to establish various calculi of logical inference. Being an OCyenrichedOCO system of natural deduction, it helps to formulate logical calculi in an operational manner. By uncovering a certain harmony between a functional calculus on the labels and a logical calculus on the formulas, it allows mathematical foundations for systems of logic presentation designed to handle meta-level features at the object-level via a labelling mechanism, such as the D Gabbay's Labelled Deductive Systems. The book truly demonstrates that introducing OCylabelsOCO is useful to understand the proof-calculus itself, and also to clarify its connections with model-theoretic interpretations.
This comprehensive book provides an adequate framework to establish various calculi of logical inference. Being an ?enriched? system of natural deduction, it helps to formulate logical calculi in an operational manner. By uncovering a certain harmony between a functional calculus on the labels and a logical calculus on the formulas, it allows mathematical foundations for systems of logic presentation designed to handle meta-level features at the object-level via a labelling mechanism, such as the D Gabbay's Labelled Deductive Systems. The book truly demonstrates that introducing ?labels? is useful to understand the proof-calculus itself, and also to clarify its connections with model-theoretic interpretations.
The subject of Labelled Non-Classical Logics is the development and investigation of a framework for the modular and uniform presentation and implementation of non-classical logics, in particular modal and relevance logics. Logics are presented as labelled deduction systems, which are proved to be sound and complete with respect to the corresponding Kripke-style semantics. We investigate the proof theory of our systems, and show them to possess structural properties such as normalization and the subformula property, which we exploit not only to establish advantages and limitations of our approach with respect to related ones, but also to give, by means of a substructural analysis, a new proof-theoretic method for investigating decidability and complexity of (some of) the logics we consider. All of our deduction systems have been implemented in the generic theorem prover Isabelle, thus providing a simple and natural environment for interactive proof development. Labelled Non-Classical Logics is essential reading for researchers and practitioners interested in the theory and applications of non-classical logics.
Agenda Relevance is the first volume in the authors' omnibus investigation ofthe logic of practical reasoning, under the collective title, A Practical Logicof Cognitive Systems. In this highly original approach, practical reasoning isidentified as reasoning performed with comparatively few cognitive assets,including resources such as information, time and computational capacity. Unlikewhat is proposed in optimization models of human cognition, a practical reasonerlacks perfect information, boundless time and unconstrained access tocomputational complexity. The practical reasoner is therefore obliged to be acognitive economizer and to achieve his cognitive ends with considerableefficiency. Accordingly, the practical reasoner avails himself of variousscarce-resource compensation strategies. He also possesses neurocognitivetraits that abet him in his reasoning tasks. Prominent among these is thepractical agent's striking (though not perfect) adeptness at evading irrelevantinformation and staying on task. On the approach taken here, irrelevancies areimpediments to the attainment of cognitive ends. Thus, in its most basic sense,relevant information is cognitively helpful information. Information can then besaid to be relevant for a practical reasoner to the extent that it advances orcloses some cognitive agenda of his. The book explores this idea with aconceptual detail and nuance not seen the standard semantic, probabilistic andpragmatic approaches to relevance; but wherever possible, the authors seek tointegrate alternative conceptions rather than reject them outright. A furtherattraction of the agenda-relevance approach is the extent to which its principalconceptual findings lend themselves to technically sophisticated re-expressionin formal models that marshal the resources of time and action logics andlabel led deductive systems. Agenda Relevance is necessary reading for researchers in logic, beliefdynamics, computer science, AI, psychology and neuroscience, linguistics,argumentation theory, and legal reasoning and forensic science, and will repaystudy by graduate students and senior undergraduates in these same fields.Key features:• relevance • action and agendas • practical reasoning • belief dynamics • non-classical logics • labelled deductive systems
This second edition of the Handbook of Philosophical Logic reflects great changes in the landscape of philosophical logic since the first edition. It gives readers an idea of that landscape and its relation to computer science and formal language and artificial intelligence. It shows how the increased demand for philosophical logic from computer science and artificial intelligence and computational linguistics accelerated the development of the subject directly and indirectly. This development in turn, directly pushed research forward, stimulated by the needs of applications. New logic areas became established and old areas were enriched and expanded. At the same time, it socially provided employment for generations of logicians residing in computer science, linguistics and electrical engineering departments which of course helped keep the logic community to thrive. The many contributors to this Handbook are active in these application areas and are among the most famous leading figures of applied philosophical logic of our times.
Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 28th Workshop on Logic, Language, Information and Computation, WoLLIC 2022, Iasi, Romania, in September 2022. The 25 full papers presented included with 8 extra abstracts, 5 invited talks and 3 tutorials were fully reviewed and selected from 46 submissions. The conference aims fostering interdisciplinary research in pure and applied logic.
th This volume is dedicated to Dov Gabbay who celebrated his 50 birthday in October 1995. Dov is one of the most outstanding and most productive researchers we have ever met. He has exerted a profound influence in major fields of logic, linguistics and computer science. His contributions in the areas of logic, language and reasoning are so numerous that a comprehensive survey would already fill half of this book. Instead of summarizing his work we decided to let him speak for himself. Sitting in a car on the way to Amsterdam airport he gave an interview to Jelle Gerbrandy and Anne-Marie Mineur. This recorded conversation with him, which is included gives a deep insight into his motivations and into his view of the world, the Almighty and, of course, the role of logic. In addition, this volume contains a partially annotated bibliography of his main papers and books. The length of the bibliography and the broadness of the topics covered there speaks for itself.
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.
