Publisher： Cambridge University Press
E-ISSN： 1943-5886|63|2|379-401
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.63, Iss.2, 1998-06, pp. : 379-401
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
The Journal of Symbolic Logic, Vol. 62, Iss. 4, 1997-12 ,pp. :
Access to resources
Recommend
Undecidable complexity statements in
The Journal of Symbolic Logic, Vol. 54, Iss. 2, 1989-06 ,pp. :
On cofinal extensions of models of arithmetic
The Journal of Symbolic Logic, Vol. 48, Iss. 2, 1983-06 ,pp. :
Extensions of arithmetic for proving termination of computations
The Journal of Symbolic Logic, Vol. 54, Iss. 3, 1989-09 ,pp. :
Some theorems on extensions of arithmetic1
The Journal of Symbolic Logic, Vol. 32, Iss. 2, 1967-08 ,pp. :