Semantic trees for Dummett's logic LC
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.
scientific article; zbMATH DE number 4012579