Publisher： Cambridge University Press
E-ISSN： 1943-5886|49|4|1333-1338
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.49, Iss.4, 1984-12, pp. : 1333-1338
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Undecidable properties of finite sets of equations
The Journal of Symbolic Logic, Vol. 41, Iss. 3, 1976-09 ,pp. :
Access to resources
Recommend
Decision problems concerning properties of finite sets of equations
The Journal of Symbolic Logic, Vol. 51, Iss. 1, 1986-03 ,pp. :
3.2. Semi-decidable or Negatively Semi-decidable Languages
Chaos and Complexity Letters, Vol. , Iss. , 2016-01 ,pp. :
COMPUTING
Bulletin of Symbolic Logic, Vol. 20, Iss. 1, 2014-05 ,pp. :
The existence of a near-unanimity term in a finite algebra is decidable
The Journal of Symbolic Logic, Vol. 74, Iss. 3, 2009-09 ,pp. :