Proof theory of modal logic

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by MARC Bot
July 31, 2019 | History

Proof theory of modal logic

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This volume deals with formal, mechanizable reasoning in modal logics, that is, logics of necessity, possibility, belief, time computations etc. It is therefore of immense interest for various interrelated disciplines such as philosophy, AI, computer science, logic, cognitive science and linguistics.

The book consists of 15 original research papers, divided into three parts. The first part contains papers which give a profound description of powerful proof-theoretic methods as applied to the normal modal logic S4. Part II is concerned with a number of generalizations of the standard proof-theoretic formats, while the third part presents new and important results on semantics-based proof systems for modal logic.

Publish Date
Publisher
Kluwer
Language
English
Pages
317

Buy this book

Edition Availability
Cover of: Proof theory of modal logic
Proof theory of modal logic
1996, Kluwer
in English
Cover of: Proof Theory of Modal Logic (Applied Logic Series)
Proof Theory of Modal Logic (Applied Logic Series)
December 31, 1899, Springer
Hardcover in English - 1 edition

Add another edition?

Book Details


Edition Notes

Includes bibliographical references and index.
Proceedings of a workshop held at the University of Hamburg, Nov. 19-20, 1993.

Published in
Boston
Series
Applied logic series ;, v. 2

Classifications

Dewey Decimal Class
511.3
Library of Congress
QA9.46 .P76 1996

The Physical Object

Pagination
x, 317 p. :
Number of pages
317

ID Numbers

Open Library
OL972179M
ISBN 10
0792341201
LCCN
96009019
Library Thing
5625653
Goodreads
4970198

First Sentence

"Theorem proving in the modal logic S4 is notoriously difficult, because in conventional sequent style calculi for this logic lengths of deductions are not bounded in terms of the length of their endsequent."

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
July 31, 2019 Edited by MARC Bot associate edition with work OL1921717W
July 30, 2010 Edited by IdentifierBot added LibraryThing ID
April 15, 2010 Edited by bgimpertBot Added goodreads ID.
April 14, 2010 Edited by Open Library Bot Linked existing covers to the edition.
April 1, 2008 Created by an anonymous user Imported from Scriblio MARC record