Proof Theory of Modal Logic (Applied Logic Series)

1 edition
Locate

My Reading Lists:

Create a new list



Buy this book

Last edited by MARC Bot
July 14, 2024 | History

Proof Theory of Modal Logic (Applied Logic Series)

1 edition

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
Springer
Language
English
Pages
328

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


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."

Classifications

Library of Congress
QA9.46 .P76 1996, BC1-199

The Physical Object

Format
Hardcover
Number of pages
328
Dimensions
9.3 x 6.2 x 1 inches
Weight
1.4 pounds

Edition Identifiers

Open Library
OL7808153M
ISBN 10
0792341201
ISBN 13
9780792341208
LCCN
96009019
OCLC/WorldCat
34789840
LibraryThing
5625653
Goodreads
4970198

Work Identifiers

Work ID
OL1921717W

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)

No community reviews have been submitted for this work.

Lists

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
July 14, 2024 Edited by MARC Bot import existing book
February 26, 2022 Edited by ImportBot import existing book
November 23, 2020 Edited by MARC Bot import existing book
February 9, 2019 Edited by MARC Bot import existing book
April 29, 2008 Created by an anonymous user Imported from amazon.com record