Provable fixed points in ${\rm I}\Delta0+\Omega1$

Notre Dame Journal of Formal Logic 32 (4):562-572 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

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

Characters and fixed-points in provability logic.Zachary Gleit & Warren Goldfarb - 1989 - Notre Dame Journal of Formal Logic 31 (1):26-36.
Effective extendability and fixed points.Thomas H. Payne - 1973 - Notre Dame Journal of Formal Logic 14 (1):123-124.
Recursively saturated $\omega_1$-like models of arithmetic.Roman Kossak - 1985 - Notre Dame Journal of Formal Logic 26 (4):413-422.
${\rm E}$ and ${\rm S}4$.Robert K. Meyer - 1970 - Notre Dame Journal of Formal Logic 11 (2):181-199.
${\rm S}4.6$ is ${\rm S}4.9$.J. Jay Zeman - 1972 - Notre Dame Journal of Formal Logic 13 (1):118-118.
${\rm S}3.02={\rm S}3.03$.George F. Schumm - 1974 - Notre Dame Journal of Formal Logic 15 (1):147-148.
On provable recursive functions.H. B. Enderton - 1968 - Notre Dame Journal of Formal Logic 9 (1):86-88.
A theorem on ${\rm S}4.2$ and ${\rm S}4.4$.Ivo Thomas - 1967 - Notre Dame Journal of Formal Logic 8 (4):335-336.
Modal trees for ${\rm T}$ and ${\rm S}5$.B. Davidson, F. C. Jackson & R. Pargetter - 1977 - Notre Dame Journal of Formal Logic 18 (4):602-606.

Analytics

Added to PP
2010-08-24

Downloads
20 (#758,804)

6 months
4 (#1,005,419)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bounded arithmetic, proof complexity and two papers of Parikh.Samuel R. Buss - 1999 - Annals of Pure and Applied Logic 96 (1-3):43-55.

Add more citations

References found in this work

No references found.

Add more references