|
![]() |
|||
|
||||
OverviewThis is the first comprehensive introduction to Display Logic in the context of generalized Gentzen calculi. After reviewing several standard and non-standard sequent-style proof systems for modal logics, the author carefully motivates and develops Display Logic, an important refinement of Gentzen's sequent calculus devised by N. Belnap. A general strong cut-elimination theorem is proved that covers a large class of display sequent calculi. Moreover, a proof-theoretic semantics of the modal operators is developed. Proof-theoretic characterizations are also obtained for the logical operations of systems associated with Tarskian structured consequence relations. These systems include constructive logics with strong negation. Using the embedding of intuitionistic logic in S4, display calculi are presented for certain subintuitionistic logics that may be used as monotonic base systems for semantics-based non-monotonic reasoning. Eventually, a first-order display calculus is defined. Its modal extension is general enough to avoid the provability of both the Barcan formula and its converse. Full Product DetailsAuthor: Heinrich WansingPublisher: Springer Imprint: Springer Edition: Softcover reprint of hardcover 1st ed. 1998 Volume: 3 Dimensions: Width: 15.50cm , Height: 1.40cm , Length: 23.50cm Weight: 0.454kg ISBN: 9789048150793ISBN 10: 9048150795 Pages: 252 Publication Date: 05 December 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsOne / Introduction.- Two / Sequents Generalized.- Three / Display Logic.- Four / Properly Displayable Logics, Displayable Logics and Strong Cut-Elimination.- Five / A Proof-Theoretic Proof of Functional Completeness for Many Modal and Tense Logics.- Six / Modal Tableaux Based on Residuation.- Seven / Strong Cut-Elimination and Labelled Modal Tableaux.- Eight / Tarskian Structured Consequence Relations and Functional Completeness.- Nine / Constructive Negation and the Modal Logic of Consistency.- Ten / Displaying as Temporalizing.- Eleven / Translation of Hypersequents into Display Sequents.- Twelve / Predicate Logics on Display.- Thirteen / Appendix.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |