On the $\Sigma^01$-conservativity of $\Sigma^01$-completeness

Notre Dame Journal of Formal Logic 32 (4):554-561 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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 Almost Orthogonality in Simple Theories.Itay Ben-Yaacov & Frank O. Wagner - 2004 - Journal of Symbolic Logic 69 (2):398 - 408.
Σ12-sets of reals.Jaime I. Ihoda - 1988 - Journal of Symbolic Logic 53 (2):636 - 642.
Seneca’s ninetieth letter. [REVIEW]Costas Panayotakis - 2004 - The Classical Review 54 (01):103-.
Primitive Recursion and the Chain Antichain Principle.Alexander P. Kreuzer - 2012 - Notre Dame Journal of Formal Logic 53 (2):245-265.

Analytics

Added to PP
2010-08-24

Downloads
28 (#555,203)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

On the provability logic of bounded arithmetic.Rineke Verbrugge & Alessandro Berarducci - 1991 - Annals of Pure and Applied Logic 61 (1-2):75-93.
The Arithmetics of a Theory.Albert Visser - 2015 - Notre Dame Journal of Formal Logic 56 (1):81-119.

Add more citations

References found in this work

No references found.

Add more references