On the Consistency and Undecidability of Recursive Arithmetic

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1002/malq.19610070707
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 38,097
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

On the Consistency and Undecidability of Recursive Arithmetic.H. E. Rose - 1961 - Mathematical Logic Quarterly 7 (7‐10):124-135.
Polynomially Bounded Recursive Realizability.Saeed Salehi - 2005 - Notre Dame Journal of Formal Logic 46 (4):407-417.
On Herbrand Consistency in Weak Arithmetic.Zofia Adamowicz & Paweł Zbierski - 2001 - Archive for Mathematical Logic 40 (6):399-413.
Update Procedures and the 1-Consistency of Arithmetic.Jeremy Avigad - 2002 - Mathematical Logic Quarterly 48 (1):3-13.

Analytics

Added to PP index
2016-02-04

Total views
18 ( #367,204 of 2,313,468 )

Recent downloads (6 months)
1 ( #549,066 of 2,313,468 )

How can I increase my downloads?

Monthly downloads

My notes

Sign in to use this feature