A sequence formalization for SCI

DOI10.1007/BF02282483MaRDI QIDQ1233432zbMATH OpenFDO

Authors Anita Wasilewska

Publication date 1976

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02282483

Mathematics Subject Classification ID

Classical propositional logic (03B05) Decidability of theories and sets of sentences (03B25)

Cites work

• A uniform proof procedure for SCI tautologies
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)

Cited in

(7)

• Programs and logics
• DFC-algorithms for Suszko logic and one-to-one Gentzen type formalizations
• Sequent calculi for \(\mathsf{SCI}\)
• Tableau-based decision procedure for non-Fregean logic of sentential identity
• Deciding non-Fregean identities: a dual tableau approach
• Cut-free labelled calculi and decidability for intuitionistic sentential logic with identity
• SCI-sequent calculi, cut elimination and interpolation property

This page was built for publication: A sequence formalization for SCI

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1233432)