Tableaux and hypersequents for justification logics

Annals of Pure and Applied Logic 163 (7):831-853 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2011.09.013

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,859

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Modal logics, justification logics, and realization.Melvin Fitting - 2016 - Annals of Pure and Applied Logic 167 (8):615-648.
Algebraic proof theory: Hypersequents and hypercompletions.Agata Ciabattoni, Nikolaos Galatos & Kazushige Terui - 2017 - Annals of Pure and Applied Logic 168 (3):693-737.
Realization for justification logics via nested sequents: Modularity through embedding.Remo Goetschi & Roman Kuznets - 2012 - Annals of Pure and Applied Logic 163 (9):1271-1298.
Propositional team logics.Fan Yang & Jouko Väänänen - 2017 - Annals of Pure and Applied Logic 168 (7):1406-1441.
Separation logic and logics with team semantics.Darion Haase, Erich Grädel & Richard Wilke - 2022 - Annals of Pure and Applied Logic 173 (10):103063.
Axiomatizations of team logics.Martin Lück - 2018 - Annals of Pure and Applied Logic 169 (9):928-969.
Propositional logics of dependence.Fan Yang & Jouko Väänänen - 2016 - Annals of Pure and Applied Logic 167 (7):557-589.
Proof complexity of substructural logics.Raheleh Jalali - 2021 - Annals of Pure and Applied Logic 172 (7):102972.
Completeness results for memory logics.Carlos Areces, Santiago Figueira & Sergio Mera - 2012 - Annals of Pure and Applied Logic 163 (7):961-972.
Completeness results for memory logics.Carlos Areces, Santiago Figueria & Sergio Mera - 2012 - Annals of Pure and Applied Logic 163 (7):961-972.

Analytics

Added to PP
2013-10-27

Downloads
47 (#521,599)

6 months
5 (#854,518)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Hidenori Kurokawa
City University of New York

Citations of this work

Prefixed tableaus and nested sequents.Melvin Fitting - 2012 - Annals of Pure and Applied Logic 163 (3):291 - 313.
Labeled sequent calculus for justification logics.Meghdad Ghari - 2017 - Annals of Pure and Applied Logic 168 (1):72-111.
Tableaux and hypersequents for justification logics.Hidenori Kurokawa - 2012 - Annals of Pure and Applied Logic 163 (7):831-853.
Tableaux and Interpolation for Propositional Justification Logics.Meghdad Ghari - 2024 - Notre Dame Journal of Formal Logic 65 (1):81-112.

Add more citations

References found in this work

Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
Indexed systems of sequents and cut-elimination.Grigori Mints - 1997 - Journal of Philosophical Logic 26 (6):671-696.
Tableaux and hypersequents for justification logics.Hidenori Kurokawa - 2012 - Annals of Pure and Applied Logic 163 (7):831-853.
Logic of proofs and provability.Tatiana Yavorskaya - 2001 - Annals of Pure and Applied Logic 113 (1-3):345-372.

View all 6 references / Add more references