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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

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.
Fragments of arithmetic.Wilfried Sieg - 1985 - Annals of Pure and Applied Logic 28 (1):33-71.
Fragments of Arithmetic.Wilfried Sieg - 1987 - Journal of Symbolic Logic 52 (4):1054-1055.
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.
Diophantine equations in fragments of arithmetic.Ulf R. Schmerl - 1988 - Annals of Pure and Applied Logic 38 (2):135-170.
Erratum to “Ordinal notations and well-orderings in bounded arithmetic” [Annals of Pure and Applied Logic 120 (2003) 197–223]. [REVIEW]Arnold Beckmann, Samuel R. Buss & Chris Pollett - 2003 - Annals of Pure and Applied Logic 123 (1-3):291.
Automated search for Gödel’s proofs.Wilfried Sieg & Clinton Field - 2005 - Annals of Pure and Applied Logic 133 (1):319-338.
Wilfried Sieg. Hilbert's Programs and Beyond. xii + 440 pp., illus., bibl., index. Oxford: Oxford University Press, 2013. $85 .William Ewald;, Wilfried Sieg ., Michael Hallett . David Hilbert's Lectures on the Foundations of Arithmetic and Logic, 1917–1933. xxv + 1,062 pp., tables, bibl., indexes. Berlin: Springer, 2013. $139. [REVIEW]Tom Archibald - 2015 - Isis 106 (2):481-483.
Pell equations and exponentiation in fragments of arithmetic.Paola D'Aquino - 1996 - Annals of Pure and Applied Logic 77 (1):1-34.
Quick cut-elimination for strictly positive cuts.Toshiyasu Arai - 2011 - Annals of Pure and Applied Logic 162 (10):807-815.
Fixed points in Peano arithmetic with ordinals.Gerhard Jäger - 1993 - Annals of Pure and Applied Logic 60 (2):119-132.
Partial collapses of the complexity hierarchy in models for fragments of bounded arithmetic.Zofia Adamowicz & Leszek Aleksander Kołodziejczyk - 2007 - Annals of Pure and Applied Logic 145 (1):91-95.
An independence result for (II11-CA)+BI.Wilfried Buchholz - 1987 - Annals of Pure and Applied Logic 33 (C):131-155.
Ordinal arithmetic based on Skolem hulling.Gunnar Wilken - 2007 - Annals of Pure and Applied Logic 145 (2):130-161.
Review: Stephen G. Simpson, Friedman's Research on Subsystems of Second Order Arithmetic. [REVIEW]Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):870-874.

Analytics

Added to PP
2016-06-30

Downloads
16 (#909,949)

6 months
1 (#1,475,915)

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