000			03958nam a22004095i 4500
001			309667
003			MX-SnUAN
005			20160429160316.0
007			cr nn 008mamaa
008			150903s2014 sz | o |||| 0|eng d
020			_a9783764385040 _99783764385040
024	7		_a10.1007/9783764385040 _2doi
035			_avtls000362907
039		9	_a201509030650 _bVLOAD _c201405070336 _dVLOAD _y201402211135 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA8.9-10.3
100	1		_aGasquet, Olivier. _eautor _9350071
245	1	0	_aKripke’s Worlds : _bAn Introduction to Modal Logics via Tableaux / _cby Olivier Gasquet, Andreas Herzig, Bilal Said, François Schwarzentruber.
264		1	_aBasel : _bSpringer Basel : _bImprint: Birkhäuser, _c2014.
300			_axv, 198 páginas 73 ilustraciones _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aStudies in Universal Logic
500			_aSpringer eBooks
505	0		_aPreface -- 1 Modelling things with graphs -- 2 Talking about graphs -- 3 The basics of the model construction method -- 4 Logics with simple constraints on models -- 5 Logics with transitive accessibility relations -- 6 Model Checking -- 7 Modal logics with transitive closure -- Bibliography -- Index.
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. It is accompanied by a piece of software called LoTREC (www.irit.fr/Lotrec). LoTREC allows to check whether a given formula is true at a given world of a given model and to check whether a given formula is satisfiable in a given logic. The latter can be done immediately if the tableau system for that logic has already been implemented in LoTREC. If this is not yet the case LoTREC offers the possibility to implement a tableau system in a relatively easy way via a simple, graph-based, interactive language. >dy>
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aHerzig, Andreas. _eautor _9345789
700	1		_aSaid, Bilal. _eautor _9350072
700	1		_aSchwarzentruber, François. _eautor _9350073
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9783764385033
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-7643-8504-0 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c309667 _d309667