Publisher： Cambridge University Press
E-ISSN： 1943-5886|54|2|415-427
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.54, Iss.2, 1989-06, pp. : 415-427
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 Skolem arithmetic
The Journal of Symbolic Logic, Vol. 63, Iss. 2, 1998-06 ,pp. :
Access to resources
Recommend
Generic complexity of undecidable problems
The Journal of Symbolic Logic, Vol. 73, Iss. 2, 2008-06 ,pp. :
Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
The Journal of Symbolic Logic, Vol. 62, Iss. 4, 1997-12 ,pp. :
On the complexity of models of arithmetic
The Journal of Symbolic Logic, Vol. 47, Iss. 2, 1982-06 ,pp. :