Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

A Generalization of Nelson's Algorithm for Obtaining Prime Implicants

R. W. House and T. Rado
The Journal of Symbolic Logic
Vol. 30, No. 1 (Mar., 1965), pp. 8-12
DOI: 10.2307/2270576
Stable URL: http://www.jstor.org/stable/2270576
Page Count: 5
  • Read Online (Free)
  • Download ($10.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
A Generalization of Nelson's Algorithm for Obtaining Prime Implicants
Preview not available

Page Thumbnails

  • Thumbnail: Page 
8
    8
  • Thumbnail: Page 
9
    9
  • Thumbnail: Page 
10
    10
  • Thumbnail: Page 
11
    11
  • Thumbnail: Page 
12
    12