The strong decidability of cut logics. II. Generalizations

DOI10.1305/NDJFL/1093894363zbMath0188.02801OpenAlexW2029509025MaRDI QIDQ2537127

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/1093894363

zbMATH Keywords

recursion theory, constructive mathematics

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (1)

Measures of centrality and complexity for partial propositional calculi

This page was built for publication: The strong decidability of cut logics. II. Generalizations