On the structure of initial segments of models of arithmetic

&
Archive for Mathematical Logic 28 (2):91-98 (1989)
  Copy   BIBTEX

Abstract

For any countable nonstandard modelM of a sufficiently strong fragment of arithmeticT, and any nonstandard numbersa, c εM, M⊨c≦a, there is a modelK ofT which agrees withM up toa and such that inK there is a proof of contradiction inT with Gödel number $ \leqq 2^{a^c } $

Categories

Keywords

Reprint years

DOI

10.1007/bf01633984

Links

PhilArchive



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

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

Jan Krajíček and Pavel Pudlák. The number of proof lines and the size of proofs in first order logic. Archive for mathematical logic, vol. 27 , pp. 69–84. [REVIEW]William M. Farmer - 1989 - Journal of Symbolic Logic 54 (3):1107-1108.
Self-Embeddings of Models of Arithmetic; Fixed Points, Small Submodels, and Extendability.Saeideh Bahrami - forthcoming - Journal of Symbolic Logic:1-23.
Tanaka’s theorem revisited.Saeideh Bahrami - 2020 - Archive for Mathematical Logic 59 (7-8):865-877.
On diophantine equations solvable in models of open induction.Margarita Otero - 1990 - Journal of Symbolic Logic 55 (2):779-786.
Nonstandard Models for a Fragment of the Arithmetic and Their Decision Problem.Ibrahim Garro - 1987 - Mathematical Logic Quarterly 33 (6):481-483.
Review: Jan Krajicek, Pavel Pudlak, Gaisi Takeuti, Bounded Arithmetic and the Polynomial Hierarchy; Samuel R. Buss, Relating the Bounded Arithmetic and Polynomial Time Hierarchies; Domenico Zambella, Notes on Polynomially Bounded Arithmetic. [REVIEW]Stephen Cook - 1999 - Journal of Symbolic Logic 64 (4):1821-1823.
Indiscernibles and satisfaction classes in arithmetic.Ali Enayat - 2024 - Archive for Mathematical Logic 63 (5):655-677.
Nonstandard Models and Kripke's Proof of the Gödel Theorem.Hilary Putnam - 2000 - Notre Dame Journal of Formal Logic 41 (1):53-58.
Largest initial segments pointwise fixed by automorphisms of models of set theory.Ali Enayat, Matt Kaufmann & Zachiri McKenzie - 2018 - Archive for Mathematical Logic 57 (1-2):91-139.
Definable sets and expansions of models of Peano arithmetic.Roman Murawski - 1988 - Archive for Mathematical Logic 27 (1):21-33.

Analytics

Added to PP
2013-11-23

Downloads
75 (#215,899)

6 months
6 (#700,858)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Slow consistency.Sy-David Friedman, Michael Rathjen & Andreas Weiermann - 2013 - Annals of Pure and Applied Logic 164 (3):382-393.
A small reflection principle for bounded arithmetic.Rineke Verbrugge & Albert Visser - 1994 - Journal of Symbolic Logic 59 (3):785-812.
Illusory models of peano arithmetic.Makoto Kikuchi & Taishi Kurahashi - 2016 - Journal of Symbolic Logic 81 (3):1163-1175.
An addition to Rosser's theorem.Henryk Kotlarski - 1996 - Journal of Symbolic Logic 61 (1):285-292.

Add more citations

References found in this work

Model Theory.Gebhard Fuhrken - 1976 - Journal of Symbolic Logic 41 (3):697-699.

Add more references