Some Ways of Constructing a Propositional Calculus of Any Required Degree of Unsolvability

DOI10.2307/1993954zbMath0168.01204OpenAlexW4256295828MaRDI QIDQ5553280

M. D. Gladstone

Publication date: 1965

Full work available at URL: https://doi.org/10.2307/1993954

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (2)

Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi ⋮ Translations and structure for partial propositional calculi

Cites Work

• Fragments of the propositional calculus
• Unnamed Item
• Unnamed Item

This page was built for publication: Some Ways of Constructing a Propositional Calculus of Any Required Degree of Unsolvability