Wilfried Sieg. Fragments of arithmetic. Annals of pure and applied logic, vol. 28 , pp. 33–71

Journal of Symbolic Logic 52 (4):1054-1055 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273844

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,561

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Wilfried Sieg, Fragments of Arithmetic. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (4):1054-1055.
Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Countable algebra and set existence axioms. Annals of pure and applied logic, vol. 25 , pp. 141–181. - Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Addendum to “Countable algebra and set existence axioms.” Annals of pure and applied logic, vol. 28 , pp. 319–320. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (1):276-278.
Lawrence S. Moss. Power set recursion. Annals of pure and applied logic, vol. 71 , pp. 247–306.Dag Normann - 1996 - Journal of Symbolic Logic 61 (4):1388-1389.
Logic and computation, Proceedings of a workshop held at Carnegie Mellon University, June 30–July 2, 1987, edited by Wilfried Sieg, Contemporary Mathematics, vol. 106, American Mathematical Society, Providence1990, xiv + 297 pp. - Douglas K. Brown. Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic. Pp. 39–50. - Kostas Hatzikiriakou and Stephen G. Simpson. WKL0 and orderings of countable abelian groups. Pp. 177–180. - Jeffry L. Hirst. Marriage theorems and reverse mathematics. Pp. 181–196. - Xiaokang Yu. Radon–Nikodym theorem is equivalent to arithmetical comprehension. Pp. 289–297. - Fernando Ferreira. Polynomial time computable arithmetic. Pp. 137–156. - Wilfried Buchholz and Wilfried Sieg. A note on polynomial time computable arithmetic. Pp. 51–55. - Samuel R. Buss. Axiomatizations and conservation results for fragments of bounded arithmetic. Pp. 57–84. - Gaisi Takeuti. Sharply bounded arithmetic and the function a – 1. Pp. 2. [REVIEW]Jörg Hudelmaier - 1996 - Journal of Symbolic Logic 61 (2):697-699.
Hans-Dieter Donder and Peter Koepke. On the consistency strength of ‘accessible’ Jonsson cardinals and of the weak Chang conjecture. Annals of pure and applied logic, vol. 25 , pp. 233–261. - Peter Koepke. Some applications of short core models. Annals of pure and applied logic, vol. 37 , pp. 179–204. [REVIEW]Sy D. Friedman - 1989 - Journal of Symbolic Logic 54 (4):1496-1497.
BLASS. A., A game semantics for linear logic CENZER, D. and REMMEL, J., Polynomial-time Abehan groups CLOTE, P. and TAKEUTI, G., Bounded arithmetic for NC, ALogTIME, L and NL. [REVIEW]P. Lincoln, J. Mitchell & A. Scedrov - 1992 - Annals of Pure and Applied Logic 56:365.
Richard Sommer. Transfinite induction within Peano arithmetic. Annals of pure and applied logic, vol. 76 , pp. 231–289.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (4):1388.
Jeremy Avigad. Formalizing forcing arguments in subsystems of second-order arithmetic. Annals of pure and applied logic, vol. 82 , pp. 165–191. [REVIEW]Alberto Marcone - 2001 - Bulletin of Symbolic Logic 7 (3):390-391.
Wilfried Sieg. Step by recursive step: Church's analysis of effective calculability. The bulletin of symbolic logic, vol. 3 , pp. 154–180. [REVIEW]Stewart Shapiro - 1999 - Journal of Symbolic Logic 64 (1):398-399.

Analytics

Added to PP
2016-06-30

Downloads
23 (#915,501)

6 months
4 (#1,227,078)

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