- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Completeness Proof by Semantic Diagrams for Transitive Closure of Accessibility Relation
In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 200-217 (1998)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Completeness Proof by Semantic Diagrams for Transitive Closure of Accessibility Relation.Ryo Kashima - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 200-217.
Continuous Accessibility Modal Logics.Caleb Camrud & Ranpal Dosanjh - 2022 - Journal of Philosophical Logic 52 (1):221-266.
Terminating modal tableaux with simple completeness proof.Olivier Gasquet, Andreas Herzig & Mohamad Sahade - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 167-186.
Terminating modal tableaux with simple completeness proof.Olivier Gasquet, Andreas Herzig & Mohamad Sahade - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 167-186.
A reduction-based cut-free Gentzen calculus for dynamic epistemic logic1.Martin Wirsing & Alexander Knapp - 2023 - Logic Journal of the IGPL 31 (6):1047-1068.
On PSPACE-decidability in Transitive Modal Logic.Ilya Shapirovsky - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 269-287.
On PSPACE-decidability in Transitive Modal Logic.Ilya Shapirovsky - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 269-287.
On modal μ-calculus and non-well-founded set theory.Luca Alberucci & Vincenzo Salipante - 2004 - Journal of Philosophical Logic 33 (4):343-360.
A Useful Four-Valued Extension of the Temporal Logic KtT4.Vincent Degauquier - 2018 - Bulletin of the Section of Logic 47 (1):15-31.
Maehara-style modal nested calculi.Roman Kuznets & Lutz Straßburger - 2019 - Archive for Mathematical Logic 58 (3-4):359-385.
Analytics
Added to PP
2018-02-17
Downloads
4 (#1,642,915)
6 months
1 (#1,516,001)
2018-02-17
Downloads
4 (#1,642,915)
6 months
1 (#1,516,001)
Historical graph of downloads
References found in this work
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-68866f4b87-7qn45 uwo