<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>03767624</id>
  <dt>j</dt>
  <an>03767624</an>
  <augroup>
    <au>Wos, L.</au>
    <au>Winker, S.</au>
    <au>Veroff, R.</au>
    <au>Smith, B.</au>
    <au>Henschen, L.</au>
  </augroup>
  <ti>Questions concerning possible shortest single axioms for the equivalential calculus: An application of automated theorem proving to infinite domains.</ti>
  <so>Notre Dame J. Formal Logic 24, 205-223 (1983).</so>
  <py>1983</py>
  <pu>University of Notre Dame, Notre Dame, IN; Duke University Press, Durham, NC</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>possible existence of additional shortest single axioms for the equivalential calculus</ut>
    <ut>complete characterization of the set of theorems deducible from each of the formulas proved too weak</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1305/ndjfl/1093870311</li>
  </ligroup>
</item>