Cut-free sequent calculus for S5

Bulletin of the Section of Logic 25 (2):95-102 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,319

External links

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

Through your library

Analytics

Added to PP
2014-01-21

Downloads
26 (#698,672)

6 months
6 (#1,113,498)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Andrzej Indrzejczak
University of Lodz

Citations of this work

Varieties of Relevant S5.Shawn Standefer - 2023 - Logic and Logical Philosophy 32 (1):53–80.
Modal Hybrid Logic.Andrzej Indrzejczak - 2007 - Logic and Logical Philosophy 16 (2-3):147-257.

Add more citations

References found in this work

Proof Methods for Modal and Intuitionistic Logics.Melvin Fitting - 1985 - Journal of Symbolic Logic 50 (3):855-856.
[Omnibus Review].S. Kanger - 1960 - Journal of Symbolic Logic 25 (4):343-343.
The elimination theorem when modality is present.Haskell B. Curry - 1952 - Journal of Symbolic Logic 17 (4):249-265.
A cut-free Gentzen-type system for the modal logic S.Masahiko Sato - 1980 - Journal of Symbolic Logic 45 (1):67-84.
Strong Cut-Elimination for Constant Domain First-Order S5.Heinrich Wansing - 1995 - Logic Journal of the IGPL 3 (5):797-810.

Add more references