Constructing sequent rules for generalized propositional logics

DOI10.1305/NDJFL/1093870576MaRDI QIDQ801057zbMATH OpenOpenAlexFDO

Authors Richard L. Call

Publication date 1984

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093870576

zbMATH Keywords

Gentzen calculi for n-ary boolean connectivesnormal formproof theorytruth tablesupper formulae

Mathematics Subject Classification ID

Classical propositional logic (03B05) Cut-elimination and normal-form theorems (03F05)

Review text

The author sets up Gentzen calculi for n-ary boolean connectives (translating the truth tables directly into upper formulae).

Cited in

(3)

• A Gentzen-style sequent calculus of constructions with expansion rules
• Generalized DEL-Sequents
• Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus

This page was built for publication: Constructing sequent rules for generalized propositional logics

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