Switch to: Citations

References in:

A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains

L. Wos, S. Winker, B. Smith, R. Veroff & L. Henschen

Artificial Intelligence 22 (3):303-356 (1984)

Add references

You must login to add references.

An automatic theorem prover for substitution and detachment systems.Jeremy George Peterson - 1978 - Notre Dame Journal of Formal Logic 19 (1):119-122.details Download Export citation Bookmark 3 citations
Questions concerning possible shortest single axioms for the equivalential calculus: an application of automated theorem proving to infinite domains.L. Wos, S. Winker, R. Veroff, B. Smith & L. Henschen - 1983 - Notre Dame Journal of Formal Logic 24 (2):205-223.details Download Export citation Bookmark 35 citations
Shortest single axioms for the classical equivalential calculus.Jeremy George Peterson - 1976 - Notre Dame Journal of Formal Logic 17 (2):267-271.details Download Export citation Bookmark 6 citations
A shortest single axiom for the classical equivalential calculus.John A. Kalman - 1978 - Notre Dame Journal of Formal Logic 19 (1):141-144.details Download Export citation Bookmark 4 citations
(1 other version)Notes on the axiomatics of the propositional calculus.C. A. Meredith & A. N. Prior - 1963 - Notre Dame Journal of Formal Logic 4 (3):171-187.details Download Export citation Bookmark 18 citations

1