Labelled deduction
Author(s)
Bibliographic Information
Labelled deduction
（Applied logic series, v. 17）
Kluwer Academic, c2000
Available at / 14 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical reference
Description and Table of Contents
Description
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.
Table of Contents
- Preface. Contributing Authors. Labelled Proof Systems for Intuitionistic Provability
- V. Balat, D. Galmiche. Normal Multimodal Logics with Interaction Axioms
- M. Baldoni. The SAT Problem of Signed CNF Formulas
- B. Beckert, R. Hahnle, F. Manya. Discipline as Logic: Treating Labels as First Class Citizens
- P. Blackburn. Labelled Abduction (I)
- K. Broda, D.M. Gabbay. Labelled Tableaux for Propositional Linear Time Logic over Finite Frames
- S. Cerrito, M. Cialdea Mayer. Fibred Modal Tableaux
- D.M. Gabbay, G. Governatori. Labelled Deduction for the Guarded Fragment
- M. Marx, S. Mikulas, S. Schlobach. Semantics for Temporal Annotated Constraint Logic Programming
- A. Raffaeta, T. Fruhwirth. The Logic of Reusable Propositional Output with the Fulfilment Constraint
- L. van der Torre.
by "Nielsen BookData"
