Basin, D., D'Agostino, M., Gabbay, D.M., Matthews, S., Viganò, L. (Eds.)
2000, XI, 267 p.
Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.
You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.
After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.
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.
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. Hähnle, F. Manyà. 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. Mikulás, S. Schlobach. Semantics for Temporal Annotated Constraint Logic Programming; A. Raffaetà, T. Frühwirth. The Logic of Reusable Propositional Output with the Fulfilment Constraint; L. van der Torre.