On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi.
D. Bollman and M. Tapia
Source: Notre Dame J. Formal Logic Volume 13, Number 1
(1972), 124-128.
First Page:
Show
Hide
Full-text: Open access
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1093894634
Zentralblatt MATH identifier: 0197.28104
Mathematical Reviews number (MathSciNet): MR0304153
Digital Object Identifier: doi:10.1305/ndjfl/1093894634
Notre Dame Journal of Formal Logic
