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

DOI10.1007/BF00370509zbMath0587.03006MaRDI QIDQ1072540

Anita Wasilewska

Publication date: 1984

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

SCIregular grammaralgebraic theory of programscut-free Gentzen type formalizationdeterministic and algorithmic regular languagesfinite-control deterministic algorithms

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Algorithms in computer science (68W99)

Related Items (2)

Sequent calculi for \(\mathsf{SCI}\) ⋮ Tableau-based decision procedure for non-Fregean logic of sentential identity

Cites Work

• A sequence formalization for SCI
• A uniform proof procedure for SCI tautologies
• On the Gentzen Type Formalizations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations