Publisher： Cambridge University Press
E-ISSN： 1943-5886|41|3|561-573
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.41, Iss.3, 1976-09, pp. : 561-573
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
Access to resources
Recommend
The Computational Complexity of Weak Saddles
By Brandt Felix
Theory of Computing Systems, Vol. 49, Iss. 1, 2011-07 ,pp. :
On direct products of theories
The Journal of Symbolic Logic, Vol. 17, Iss. 1, 1952-03 ,pp. :
Complexity of Categorical Theories with Computable Models
By Goncharov S. S. Khoussainov B.
Algebra and Logic, Vol. 43, Iss. 6, 2004-11 ,pp. :
Direct product decomposition of theories of modules
The Journal of Symbolic Logic, Vol. 44, Iss. 1, 1979-03 ,pp. :