A generalization of Nelson's algorithm for obtaining prime implicants

Publisher： Cambridge University Press

E-ISSN： 1943-5886|30|1|8-12

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.30, Iss.1, 1965-03, pp. : 8-12

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

p -SOLVABILITY AND A GENERALIZATION OF PRIME GRAPHS OF FINITE GROUPS

By Iiyori Nobuo  

Communications in Algebra, Vol. 30, Iss. 4, 2002-01 ,pp. : 1679-1691

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Generalization of the prime geodesic theorem to counting conjugacy classes of free subgroups

By Bowen Lewis  

Geometriae Dedicata, Vol. 124, Iss. 1, 2007-02 ,pp. : 37-67

Springer Publishing Company

Access to resources Recommend Favorite

An algorithm to determine, for any prime p, a polynomial-sized Horn sentence which expresses “The cardinality is not p”

By  

The Journal of Symbolic Logic, Vol. 50, Iss. 4, 1985-12 ,pp. : 1062-1064

Cambridge University Press

Access to resources Recommend Favorite

A generalization of the antilogism

By  

The Journal of Symbolic Logic, Vol. 6, Iss. 3, 1941-09 ,pp. : 90-95

Cambridge University Press

Access to resources Recommend Favorite

A generalization of forking

By  

The Journal of Symbolic Logic, Vol. 56, Iss. 3, 1991-09 ,pp. : 813-822

Cambridge University Press

Access to resources Recommend Favorite