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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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

Analytics

Added to PP
2009-01-28

Downloads
29 (#538,668)

6 months
6 (#512,819)

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