Publisher： Cambridge University Press
E-ISSN： 1943-5886|63|3|1063-1082
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.63, Iss.3, 1998-09, pp. : 1063-1082
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
Effectively closed sets and enumerations
Archive for Mathematical Logic, Vol. 46, Iss. 7-8, 2008-05 ,pp. :
Access to resources
Recommend
Minimality and completions of
The Journal of Symbolic Logic, Vol. 66, Iss. 3, 2001-09 ,pp. :
On canonicity and completions of weakly representable relation algebras
The Journal of Symbolic Logic, Vol. 77, Iss. 1, 2012-03 ,pp. :
Finite algebras of relations are representable on finite sets
The Journal of Symbolic Logic, Vol. 64, Iss. 1, 1999-03 ,pp. :
Partially ordered sets representable by recursively enumerable classes
The Journal of Symbolic Logic, Vol. 34, Iss. 1, 1969-05 ,pp. :