More download options

Overspill and fragments of arithmetic

C. Dimitracopoulos

Archive for Mathematical Logic 28 (3):173-179 (1989) Copy BIBT_EX

Abstract

This article has no associated abstract. (fix it)

Cite

Plain text

BibTeX

Formatted text

Reference Manager

RefWorks

Options

Mark as duplicate

Find it on Scholar

Request removal from index

Revision history

Categories

Areas of Mathematics in Philosophy of Mathematics

Keywords

Algebra Mathematical Logic and Foundations Mathematics, general

Reprint years

DOI

10.1007/bf01622877

Links

PhilArchive

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

External links

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

Through your library

Sign in / register and customize your OpenURL resolver
Configure custom resolver

My notes

Sign in to use this feature

Similar books and articles

Preface.Douglas Cenzer & Rebecca Weber - 2008 - Archive for Mathematical Logic 46 (7-8):529-531.

Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.

Preface.Douglas Cenzer, Valentina Harizanov, David Marker & Carol Wood - 2009 - Archive for Mathematical Logic 48 (1):1-6.

Preface.[author unknown] - 2005 - Archive for Mathematical Logic 44 (6):665-666.

Computability in Europe 2008.Arnold Beckmann, Costas Dimitracopoulos & Benedikt Löwe - 2010 - Archive for Mathematical Logic 49 (2):119-121.

Erratum: “Forcing and antifoundation”. [REVIEW]Athanassios Tzouvaras - 2005 - Archive for Mathematical Logic 44 (5):663-663.

Well-foundedness in Realizability.M. Hofmann, J. van Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.

Models of replacement schemes.Eugenio Chinchilla - 2005 - Archive for Mathematical Logic 44 (7):851-867.

Well-foundedness in Realizability.M. Hofmann, J. Oosten & T. Streicher - 2006 - Archive for Mathematical Logic 45 (7):795-805.

Hardness assumptions in the foundations of theoretical computer science.Jan Krajíček - 2005 - Archive for Mathematical Logic 44 (6):667-675.

Analytics

Added to PP
2013-11-23

Downloads
38 (#409,219)

6 months
9 (#436,631)

Historical graph of downloads

How can I increase my downloads?

Citations of this work

Existentially closed structures and gödel's second incompleteness theorem.Zofia Adamowicz & Teresa Bigorajska - 2001 - Journal of Symbolic Logic 66 (1):349-356.

An exploration of the partial respects in which an axiom system recognizing solely addition as a total function can verify its own consistency.Dan E. Willard - 2005 - Journal of Symbolic Logic 70 (4):1171-1209.

Algebraic combinatorics in bounded induction.Joaquín Borrego-Díaz - 2021 - Annals of Pure and Applied Logic 172 (2):102885.

Add more citations

References found in this work

Bounded existential induction.George Wilmers - 1985 - Journal of Symbolic Logic 50 (1):72-90.

Gödel's Second incompleteness theorem for Q.A. Bezboruah & J. C. Shepherdson - 1976 - Journal of Symbolic Logic 41 (2):503-512.

Add more references