Semantic trees for Dummett's logic LC
type: Item
instance of: scholarly article
title: Semantic trees for Dummett's logic LC
zbMATH Open document ID: 0624.03019
DOI: 10.1007/BF00373275
author: Giovanna Corsi
published in: Studia Logica
publication date: 1986-01-01T00:00:00Z
review text: As for Dummett's logic, its sequential formulation for which the cut elimination theorem has been proved does not give rise to the decision procedure immediately. The author modifies the system so that it provides an effective procedure for deciding whether a given sequent is provable or not.
Mathematics Subject Classification ID: 03B55
zbMATH DE Number: 4012579
zbMATH Keywords: intermediate logic
zbMATH Keywords: sequent calculus
zbMATH Keywords: Dummett's logic
zbMATH Keywords: decision procedure
reviewed by: Osamu Sonobe
MaRDI profile type: Publication
cites work: A propositional calculus with denumerable matrix
full work available at URL: https://doi.org/10.1007/bf00373275
OpenAlex ID: W2046451304
Recommended article: Semantics for structurally free logics LC+
Recommended article: Q3067428
Recommended article: Q5697794
Recommended article: Semantics of infinite tree logic programming
Recommended article: Q4940727
Recommended article: Q4273669
Recommended article: Q3221429
Recommended article: The Ontological Innocence of Schematic Logic
Recommended article: Semantics of trees
Recommended article: A semantic hierarchy for intuitionistic logic
description: scientific article; zbMATH DE number 4012579