Normal derivability and first-order arithmetic

Notre Dame Journal of Formal Logic 21 (2):449-466 (1980)
  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: 100,902

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

Definability of Initial Segments.Akito Tsuboi & Saharon Shelah - 2002 - Notre Dame Journal of Formal Logic 43 (2):65-73.
Derivability conditions on Rosser's provability predicates.Toshiyasu Arai - 1990 - Notre Dame Journal of Formal Logic 31 (4):487-497.
On the First-Order Prefix Hierarchy.Eric Rosen - 2005 - Notre Dame Journal of Formal Logic 46 (2):147-164.
Arithmetic as a study of formal systems.Jonathan P. Seldin - 1975 - Notre Dame Journal of Formal Logic 16 (4):449-464.
PA( aa ).James H. Schmerl - 1995 - Notre Dame Journal of Formal Logic 36 (4):560-569.
Arithmetic operations on ordinals.Martin M. Zuckerman - 1975 - Notre Dame Journal of Formal Logic 16 (4):578-582.
A first-order logic with no logical constants.Charles B. Daniels - 1987 - Notre Dame Journal of Formal Logic 28 (3):408-413.
Finitary consistency of a free arithmetic.Ermanno Bencivenga - 1984 - Notre Dame Journal of Formal Logic 25 (3):224-226.
End extensions of models of arithmetic.James H. Schmerl - 1992 - Notre Dame Journal of Formal Logic 33 (2):216-219.

Analytics

Added to PP
2010-08-24

Downloads
32 (#699,889)

6 months
13 (#246,988)

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

No references found.

Add more references