Publisher： Cambridge University Press
E-ISSN： 1943-5886|45|2|353-358
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.45, Iss.2, 1980-06, pp. : 353-358
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
Complexity of admissible rules
By Jeřábek Emil
Archive for Mathematical Logic, Vol. 46, Iss. 2, 2007-02 ,pp. :
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 generalized computational complexity
The Journal of Symbolic Logic, Vol. 42, Iss. 1, 1977-03 ,pp. :
Classifying the computational complexity of problems
The Journal of Symbolic Logic, Vol. 52, Iss. 1, 1987-03 ,pp. :
Weakly atomic-compact relational structures
The Journal of Symbolic Logic, Vol. 36, Iss. 1, 1971-03 ,pp. :