Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.
Wos, L. ; Winker, S. ; Veroff, R. ; Smith, B. ; Henschen, L.
Notre Dame J. Formal Logic, Tome 24 (1983) no. 1, p. 205-223 / Harvested from Project Euclid
Publié le : 1983-04-14
Classification:  03B20,  03B35
@article{1093870311,
     author = {Wos, L. and Winker, S. and Veroff, R. and Smith, B. and Henschen, L.},
     title = {Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.},
     journal = {Notre Dame J. Formal Logic},
     volume = {24},
     number = {1},
     year = {1983},
     pages = { 205-223},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1093870311}
}
Wos, L.; Winker, S.; Veroff, R.; Smith, B.; Henschen, L. Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.. Notre Dame J. Formal Logic, Tome 24 (1983) no. 1, pp.  205-223. http://gdmltest.u-ga.fr/item/1093870311/