Undecidability of the general problems of completeness, decidability and equivalence for propositional calculi

DOI10.1090/TRANS2/059/03zbMath0192.05601OpenAlexW2600488068MaRDI QIDQ5586300

A. V. Kuznetsov

Publication date: 1963

Published in: Twelve Papers on Logic and Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/trans2/059/03

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (1)

Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi

This page was built for publication: Undecidability of the general problems of completeness, decidability and equivalence for propositional calculi