The strong decidability of cut-logics. I: Partial propositional calculi

DOI10.1305/NDJFL/1093894295MaRDI QIDQ2536052zbMATH OpenOpenAlexFDO

Authors E. William jun. Chapin

Publication date 1971

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

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

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(1)

• Measures of centrality and complexity for partial propositional calculi

This page was built for publication: The strong decidability of cut-logics. I: Partial propositional calculi

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