Possible worlds models were introduced by Saul Kripke in the early 1960s. Basically, a possible world's 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 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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
<p>Possible 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. </p><p><p><p>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.</p>>dy></p></p>
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 72,00 für den Versand von Deutschland nach USA
Versandziele, Kosten & DauerEUR 3,43 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerAnbieter: Lucky's Textbooks, Dallas, TX, USA
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Apr0316110059281
Anzahl: Mehr als 20 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Bestandsnummer des Verkäufers ria9783764385033_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Studibuch, Stuttgart, Deutschland
paperback. Zustand: Gut. 216 Seiten; 9783764385033.3 Gewicht in Gramm: 500. Bestandsnummer des Verkäufers 964843
Anzahl: 1 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 216. Bestandsnummer des Verkäufers 2698027014
Anzahl: 4 verfügbar
Anbieter: moluna, Greven, Deutschland
Kartoniert / Broschiert. Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Aims at filling the gap between existing introductory and advanced textbooksIntroduces to the most important modal logics with multiple modalities from the perspective of the associated reasoning tasksConcentrates on the most general and po. Bestandsnummer des Verkäufers 5279846
Anzahl: Mehr als 20 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. Print on Demand pp. 216 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam. Bestandsnummer des Verkäufers 94403033
Anzahl: 4 verfügbar
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND pp. 216. Bestandsnummer des Verkäufers 1898027020
Anzahl: 4 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 2014 edition. 198 pages. 9.50x6.50x0.75 inches. In Stock. Bestandsnummer des Verkäufers x-3764385030
Anzahl: 2 verfügbar
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Paperback. Zustand: Like New. Like New. book. Bestandsnummer des Verkäufers ERICA77337643850306
Anzahl: 1 verfügbar