Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.

Publisher： Cambridge University Press

E-ISSN： 1943-5886|56|2|643-660

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.56, Iss.2, 1991-06, pp. : 643-660

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

On recursively enumerable and arithmetic models of set theory

By  

The Journal of Symbolic Logic, Vol. 23, Iss. 4, 1958-12 ,pp. : 408-416

Cambridge University Press

Access to resources Recommend Favorite

Some independence results for Peano arithmetic

By  

The Journal of Symbolic Logic, Vol. 43, Iss. 4, 1978-12 ,pp. : 725-731

Cambridge University Press

Access to resources Recommend Favorite

Abstract dependence, recursion theory, and the lattice of recursively enumerable filters

By  

Bulletin of the Australian Mathematical Society, Vol. 27, Iss. 3, 1983-06 ,pp. : 461-464

Cambridge University Press

Access to resources Recommend Favorite

Friedberg Numbering in Fragments of Peano Arithmetic and α-Recursion Theory

By  

The Journal of Symbolic Logic, Vol. 78, Iss. 4, 2013-12 ,pp. : 1135-1163

Cambridge University Press

Access to resources Recommend Favorite

Recursively enumerable sets which are uniform for finite extensions 1

By  

The Journal of Symbolic Logic, Vol. 36, Iss. 2, 1971-06 ,pp. : 271-287

Cambridge University Press

Access to resources Recommend Favorite