Transfinite extensions of Friedberg's completeness criterion1

Publisher： Cambridge University Press

E-ISSN： 1943-5886|42|1|1-10

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.42, Iss.1, 1977-03, pp. : 1-10

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

Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion

By  

The Journal of Symbolic Logic, Vol. 54, Iss. 4, 1989-12 ,pp. : 1288-1323

Cambridge University Press

Access to resources Recommend Favorite

Transfinite Progressions: A Second Look at Completeness

By  

Bulletin of Symbolic Logic, Vol. 10, Iss. 3, 2004-09 ,pp. : 367-389

Cambridge University Press

Access to resources Recommend Favorite

On the completeness of some transfinite recursive progressions of axiomatic theories

By  

The Journal of Symbolic Logic, Vol. 33, Iss. 1, 1968-04 ,pp. : 69-76

Cambridge University Press

Access to resources Recommend Favorite

Completeness of transfinite evaluation in an extension of the lambda calculus

By  

The Journal of Symbolic Logic, Vol. 52, Iss. 1, 1987-03 ,pp. : 243-275

Cambridge University Press

Access to resources Recommend Favorite

A criterion for completeness of degrees of unsolvability

By  

The Journal of Symbolic Logic, Vol. 22, Iss. 2, 1957-06 ,pp. : 159-160

Cambridge University Press

Access to resources Recommend Favorite