Undecidable complexity statements in -arithmetic

Journal of Symbolic Logic 54 (2):415-427 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,388

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.
Implicational complexity in intuitionistic arithmetic.Daniel Leivant - 1981 - Journal of Symbolic Logic 46 (2):240-248.
Generic Complexity of Undecidable Problems.Alexei G. Myasnikov & Alexander N. Rybalov - 2008 - Journal of Symbolic Logic 73 (2):656 - 673.

Analytics

Added to PP
2009-01-28

Downloads
22 (#1,015,764)

6 months
1 (#1,572,794)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Hierarchies of number-theoretic functions II.M. H. Löb & S. S. Wainer - 1970 - Archive for Mathematical Logic 13 (3-4):97-113.

Add more references