Enumeration of Recursive Sets

Publisher： Cambridge University Press

E-ISSN： 1943-5886|24|4|311-311

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.24, Iss.4, 1959-12, pp. : 311-311

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

Low Level Nondelegability Results: Domination and Recursive Enumeration

By  

The Journal of Symbolic Logic, Vol. 78, Iss. 3, 2013-09 ,pp. : 1005-1024

Cambridge University Press

Access to resources Recommend Favorite

Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

By  

The Journal of Symbolic Logic, Vol. 23, Iss. 3, 1958-09 ,pp. : 309-316

Cambridge University Press

Access to resources Recommend Favorite

Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ 2 sets are dense

By  

The Journal of Symbolic Logic, Vol. 49, Iss. 2, 1984-06 ,pp. : 503-513

Cambridge University Press

Access to resources Recommend Favorite

Enumeration of Hypergraphs

By Ishihara T.  

European Journal of Combinatorics, Vol. 22, Iss. 4, 2001-05 ,pp. : 503-509

Elsevier

Access to resources Recommend Favorite

On the recursive sequence

By Stević Stevo  

Journal of Difference Equations and Applications, Vol. 13, Iss. 1, 2007-01 ,pp. : 41-46

Taylor & Francis Ltd

Access to resources Recommend Favorite