DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations (Q1072540)

We use here the notions and results from algebraic theory of programs in order to give a new proof of the decidability theorem for Suszko logic SCI. We generalize the method used in the proof of that theorem in order to prove the more general fact that any propositional logic which admits a cut-free Gentzen type formalization is decidable. We establish also the relationship between the Suszko Logic SCI, one-to-one Gentzen type formalizations and deterministic and algorithmic regular languages.