Publisher： Cambridge University Press
E-ISSN： 1943-5886|65|4|1863-1880
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.65, Iss.4, 2000-12, pp. : 1863-1880
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
Finite inseparability of some theories of cylindrification algebras
The Journal of Symbolic Logic, Vol. 34, Iss. 2, 1969-07 ,pp. :
Access to resources
Recommend
Recursive Boolean algebras with recursive atoms
The Journal of Symbolic Logic, Vol. 46, Iss. 3, 1981-09 ,pp. :
Recursive isomorphism types of recursive Boolean algebras
The Journal of Symbolic Logic, Vol. 46, Iss. 3, 1981-09 ,pp. :
On recursive enumerability with finite repetitions
The Journal of Symbolic Logic, Vol. 64, Iss. 3, 1999-09 ,pp. :
Honest bounds for complexity classes of recursive functions
The Journal of Symbolic Logic, Vol. 39, Iss. 1, 1974-03 ,pp. :