Semantic trees for Dummett's logic LC

Studia Logica 45 (2):199-206 (1986)
  Copy   BIBTEX

Abstract

The aim of this paper is to provide a decision procedure for Dummett's logic LC, such that with any given formula will be associated either a proof in a sequent calculus equivalent to LC or a finite linear Kripke countermodel.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,518

External links

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

Through your library

Similar books and articles

A Cut‐Free Calculus For Dummett's LC Quantified.Giovanna Corsi - 1989 - Mathematical Logic Quarterly 35 (4):289-301.
On Some Subsystems of Dummett's LC.Branislav R. Boričić - 1985 - Mathematical Logic Quarterly 31 (14‐18):243-247.
On Some Subsystems of Dummett's LC.Branislav R. Boričić - 1985 - Mathematical Logic Quarterly 31 (14-18):243-247.

Analytics

Added to PP
2009-01-28

Downloads
43 (#524,466)

6 months
14 (#240,419)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Giovanna Corsi
Università degli Studi di Bologna

Citations of this work

A Cut‐Free Calculus For Dummett's LC Quantified.Giovanna Corsi - 1989 - Mathematical Logic Quarterly 35 (4):289-301.
A Cut-Free Calculus For Dummett's LC Quantified.Giovanna Corsi - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (4):289-301.
Decision methods for linearly ordered Heyting algebras.Sara Negri & Roy Dyckhoff - 2006 - Archive for Mathematical Logic 45 (4):411-422.
Intuitionistic Logic Freed of All Metarules.Giovanna Corsi & Gabriele Tassi - 2007 - Journal of Symbolic Logic 72 (4):1204 - 1218.

Add more citations