A note on finite axiomatization of partial propositional calculi
Wilson E. Singletary · Journal of Symbolic Logic · 1967
At the Princeton Bicentennial in 1946 Tarski posed the question as to whether or not certain problems connected with partial propositional calculi were recursively solvable. Since that time the specific problems mentioned by Tarski as well as a number of related problems have been shown to be recursively unsolvable. Such results are due to Post and Linial [5], Yntema [9], Gladstone [2], Ihrig [3] and Singletary [7], [8].