Sequential discreteness and clopen-I-Boolean classes

Publisher： Cambridge University Press

E-ISSN： 1943-5886|52|1|232-242

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.52, Iss.1, 1987-03, pp. : 232-242

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Quadratic Sequential Computations of Boolean Mappings

By Burckel Serge  

Theory of Computing Systems, Vol. 37, Iss. 4, 2004-07 ,pp. : 519-525

Springer Publishing Company

Access to resources Recommend Favorite

Some classes of sequential spaces

By  

Bulletin of the Australian Mathematical Society, Vol. 47, Iss. 3, 1993-06 ,pp. : 377-384

Cambridge University Press

Access to resources Recommend Favorite

Π1 0 classes and Boolean combinations of recursively enumerable sets

By  

The Journal of Symbolic Logic, Vol. 39, Iss. 1, 1974-03 ,pp. : 95-96

Cambridge University Press

Access to resources Recommend Favorite

Cooperative Boolean systems with generically long attractors I

By Just W.  

Journal of Difference Equations and Applications, Vol. 19, Iss. 5, 2013-05 ,pp. : 772-795

Taylor & Francis Ltd

Access to resources Recommend Favorite

New Classes of Perfect Maps I

By Paterson K.G.  

Journal of Combinatorial Theory, Series A, Vol. 73, Iss. 2, 1996-02 ,pp. : 302-334

Academic Press

Access to resources Recommend Favorite