The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic

Journal of Philosophical Logic 13 (1):97 - 113 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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.
Bimodal logics for extensions of arithmetical theories.Lev D. Beklemishev - 1996 - Journal of Symbolic Logic 61 (1):91-124.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
Models without indiscernibles.Fred G. Abramson & Leo A. Harrington - 1978 - Journal of Symbolic Logic 43 (3):572-600.
Quantum Mathematics.J. Michael Dunn - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:512 - 531.
String theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.

Analytics

Added to PP
2009-01-28

Downloads
38 (#397,063)

6 months
6 (#417,196)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

References found in this work

Provability Interpretations of Modal Logic.Robert M. Solovay - 1981 - Journal of Symbolic Logic 46 (3):661-662.
Relatively precomplete numerations and arithmetic.Franco Montagna - 1982 - Journal of Philosophical Logic 11 (4):419 - 430.
Extremely undecidable sentences.George Boolos - 1982 - Journal of Symbolic Logic 47 (1):191-196.

Add more references