Fragments of Arithmetic

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: 91,386

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

Fragments of arithmetic.Wilfried Sieg - 1985 - Annals of Pure and Applied Logic 28 (1):33-71.
Review: Wilfried Sieg, Fragments of Arithmetic. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (4):1054-1055.
Some Results on LΔ — n+1.Alejandro Fernández Margarit & F. Félix Lara Martin - 2001 - Mathematical Logic Quarterly 47 (4):503-512.
Multi-sorted version of second order arithmetic.Farida Kachapova - 2016 - Australasian Journal of Logic 13 (5).
Toward the Limits of the Tennenbaum Phenomenon.Paola D'Aquino - 1997 - Notre Dame Journal of Formal Logic 38 (1):81-92.
Notes on polynomially bounded arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Notes on polynomially bounded arithmetic.Domenico Zambella - 1996 - Journal of Symbolic Logic 61 (3):942-966.
Pell equations and exponentiation in fragments of arithmetic.Paola D'Aquino - 1996 - Annals of Pure and Applied Logic 77 (1):1-34.
An algebraic treatment of quantifier-free systems of arithmetic.Franco Montagna - 1996 - Archive for Mathematical Logic 35 (4):209-224.
Independence results for weak systems of intuitionistic arithmetic.Morteza Moniri - 2003 - Mathematical Logic Quarterly 49 (3):250.
Fragments of Arithmetic and true sentences.Andrés Cordón-Franco, Alejandro Fernández-Margarit & F. Félix Lara-Martín - 2005 - Mathematical Logic Quarterly 51 (3):313-328.
The minimal e-degree problem in fragments of Peano arithmetic.M. M. Arslanov, C. T. Chong, S. B. Cooper & Y. Yang - 2005 - Annals of Pure and Applied Logic 131 (1-3):159-175.
Predicative fragments of Frege arithmetic.Øystein Linnebo - 2004 - Bulletin of Symbolic Logic 10 (2):153-174.
Unprovability of consistency statements in fragments of bounded arithmetic.Samuel R. Buss & Aleksandar Ignjatović - 1995 - Annals of Pure and Applied Logic 74 (3):221-244.
NP Search Problems in Low Fragments of Bounded Arithmetic.Jan Krajíček, Alan Skelley & Neil Thapen - 2007 - Journal of Symbolic Logic 72 (2):649 - 672.

Analytics

Added to PP
2017-02-21

Downloads
14 (#965,243)

6 months
2 (#1,232,442)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Wilfried Sieg
Carnegie Mellon University

Citations of this work

Hilbert’s Program.Richard Zach - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.
Why a Little Bit Goes a Long Way: Logical Foundations of Scientifically Applicable Mathematics.Solomon Feferman - 1992 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1992:442 - 455.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.
Predicative foundations of arithmetic.Solomon Feferman & Geoffrey Hellman - 1995 - Journal of Philosophical Logic 24 (1):1 - 17.

View all 12 citations / Add more citations

References found in this work

No references found.

Add more references