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

Publisher： Cambridge University Press

E-ISSN： 1943-5886|78|4|1135-1163

ISSN： 0022-4812

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

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

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

By  

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

Cambridge University Press

Access to resources Recommend Favorite

Peano arithmetic may not be interpretable in the monadic theory of linear orders

By  

The Journal of Symbolic Logic, Vol. 62, Iss. 3, 1997-09 ,pp. : 848-872

Cambridge University Press

Access to resources Recommend Favorite

On expandability of models of Peano arithmetic to models of the alternative set theory

By  

The Journal of Symbolic Logic, Vol. 57, Iss. 2, 1992-06 ,pp. : 452-460

Cambridge University Press

Access to resources Recommend Favorite

The interpretability logic of Peano arithmetic

By  

The Journal of Symbolic Logic, Vol. 55, Iss. 3, 1990-09 ,pp. : 1059-1089

Cambridge University Press

Access to resources Recommend Favorite

Saturated models of Peano arithmetic

By  

The Journal of Symbolic Logic, Vol. 47, Iss. 3, 1982-09 ,pp. : 625-637

Cambridge University Press

Access to resources Recommend Favorite