000696378 000__ 03303cam\a2200433Ki\4500
000696378 001__ 696378
000696378 005__ 20230306135553.0
000696378 006__ m\\\\\o\\d\\\\\\\\
000696378 007__ cr\cnu|||unuuu
000696378 008__ 140113s2014\\\\sz\a\\\\ob\\\\001\0\eng\d
000696378 020__ $$a9783764385040 $$qelectronic book
000696378 020__ $$a3764385049 $$qelectronic book
000696378 020__ $$z9783764385033
000696378 0247_ $$a10.1007/978-3-7643-8504-0$$2doi
000696378 035__ $$aSP(OCoLC)ocn868027619
000696378 035__ $$aSP(OCoLC)868027619
000696378 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dGGVRL
000696378 049__ $$aISEA
000696378 050_4 $$aQA9.46
000696378 08204 $$a511.3/14$$223
000696378 24500 $$aKripke's Worlds :$$ban introduction to modal logics via Tableaux$$h[electronic resource]  /$$cOlivier Gasquet, Andreas Herzig, Bilal Said, François Schwarzentruber.
000696378 264_1 $$aBasel :$$bBirkhäuser,$$c2014.
000696378 300__ $$a1 online resource (xv, 198 pages) :$$billustrations.
000696378 336__ $$atext$$btxt$$2rdacontent
000696378 337__ $$acomputer$$bc$$2rdamedia
000696378 338__ $$aonline resource$$bcr$$2rdacarrier
000696378 4901_ $$aStudies in Universal Logic
000696378 504__ $$aIncludes bibliographical references and index.
000696378 5050_ $$aModelling things with graphs -- Talking about graphs -- The basics of the model construction method -- Logics with simple constraints on models -- Logics with transitive accessibility relations -- Model Checking -- Modal logics with transitive closure.
000696378 506__ $$aAccess limited to authorized users.
000696378 520__ $$aPossible worlds models were introduced by Saul Kripke in the early 1960s. Basically, a possible worlds model is nothing but a graph with labelled nodes and labelled edges. Such graphs provide semantics for various modal logics (alethic, temporal, epistemic and doxastic, dynamic, deontic, description logics) and also turned out useful for other nonclassical logics (intuitionistic, conditional, several paraconsistent and relevant logics). All these logics have been studied intensively in philosophical and mathematical logic and in computer science, and have been applied increasingly in domains such as program semantics, artificial intelligence, and more recently in the semantic web. Additionally, all these logics were also studied proof theoretically. The proof systems for modal logics come in various styles: Hilbert style, natural deduction, sequents, and resolution. However, it is fair to say that the most uniform and most successful such systems are tableaux systems. Given a logic and a formula, they allow one to check whether there is a model in that logic. This basically amounts to trying to build a model for the formula by building a tree. This book follows a more general approach by trying to build a graph, the advantage being that a graph is closer to a Kripke model than a tree. It provides a step-by-step introduction to possible worlds semantics (and by that to modal and other nonclassical logics) via the tableaux method.
000696378 588__ $$aDescription based on online resource; title from PDF title page (SpringerLink, viewed November 25, 2013).
000696378 650_0 $$aModality (Logic)
000696378 7001_ $$aGasquet, Olivier,$$eauthor.
000696378 830_0 $$aStudies in universal logic.
000696378 85280 $$bebk$$hSpringerLink
000696378 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://dx.doi.org/10.1007/978-3-7643-8504-0$$zOnline Access
000696378 909CO $$ooai:library.usi.edu:696378$$pGLOBAL_SET
000696378 980__ $$aEBOOK
000696378 980__ $$aBIB
000696378 982__ $$aEbook
000696378 983__ $$aOnline
000696378 994__ $$a92$$bISE