On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi.
Bollman, D. ; Tapia, M.
Notre Dame J. Formal Logic, Tome 13 (1972) no. 3, p. 124-128 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 1972-01-14
Classification:  02G05,  02B05 
@article{1093894634,
     author = {Bollman, D. and Tapia, M.},
     title = {On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi.},
     journal = {Notre Dame J. Formal Logic},
     volume = {13},
     number = {3},
     year = {1972},
     pages = { 124-128},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1093894634}
}

Bollman, D.; Tapia, M. On the recursive unsolvability of the provability of the deduction theorem in partial propositional calculi.. Notre Dame J. Formal Logic, Tome 13 (1972) no. 3, pp.  124-128. http://gdmltest.u-ga.fr/item/1093894634/