Switch to: Citations

References in:

Cut-free sequent calculus for S5

Andrzej Indrzejczak

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

Add references

You must login to add references.

Strong Cut-Elimination for Constant Domain First-Order S5.Heinrich Wansing - 1995 - Logic Journal of the IGPL 3 (5):797-810.details We consider a labelled tableau presentation of constant domain first-order S5 and prove a strong cut-elimination theorem. Proof Theory in Logic and Philosophy of Logic Direct download (2 more) Export citation Bookmark 2 citations
A cut-free Gentzen-type system for the modal logic S.Masahiko Sato - 1980 - Journal of Symbolic Logic 45 (1):67-84.details Modal and Intensional Logic in Logic and Philosophy of Logic Direct download (8 more) Export citation Bookmark 10 citations
Proof Methods for Modal and Intuitionistic Logics.Melvin Fitting - 1985 - Journal of Symbolic Logic 50 (3):855-856.details Logic and Philosophy of Logic Proof Theory in Logic and Philosophy of Logic Direct download Export citation Bookmark 138 citations
The elimination theorem when modality is present.Haskell B. Curry - 1952 - Journal of Symbolic Logic 17 (4):249-265.details Logic and Philosophy of Logic Proof Theory in Logic and Philosophy of Logic Direct download (8 more) Export citation Bookmark 13 citations
[Omnibus Review].S. Kanger - 1960 - Journal of Symbolic Logic 25 (4):343-343.details Logic and Philosophy of Logic Model Theory in Logic and Philosophy of Logic Export citation Bookmark 24 citations

1