On two problems concerning end extensions

Archive for Mathematical Logic 47 (1):1-14 (2008)
  Copy   BIBTEX

Abstract

We study problems of Clote and Paris, concerning the existence of end extensions of models of Σ n -collection. We continue the study of the notion of ‘Γ-fullness’, begun by Wilkie and Paris (Logic, Methodology and Philosophy of Science VIII (Moscow, 1987). Stud. Logic Found. Math., vol. 126, pp. 143–161. North- Holland, Amsterdam, 1989) and introduce and study a generalization of it, to be used in connection with the existence of Σ n -elementary end extensions (instead of plain end extensions). We obtain (a) alternative proofs of results (Adamowicz in Fund. Math. 136, 133–145, 1990) and (Wilkie and Paris in Logic, Methodology and Philosophy of Science VIII (Moscow, 1987). Stud. Logic Found. Math., vol. 126, pp. 143–161. North-Holland, Amsterdam, 1989) related to the problem of Paris and (b) a partial solution to the problem of Clote

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

A note on end extensions.Ch Cornaros & C. Dimitracopoulos - 2000 - Archive for Mathematical Logic 39 (6):459-463.
Inexact and Inductive Reasoning.J. Paris & A. Vencovska - 1989 - In Jens Erik Fenstad, Ivan Timofeevich Frolov & Risto Hilpinen (eds.), Logic, Methodology, and Philosophy of Science Viii: Proceedings of the Eighth International Congress of Logic, Methodology, and Philosophy of Science, Moscow, 1987. Sole Distributors for the U.S.A. And Canada, Elsevier Science.
Subsets of models of arithmetic.Roman Kossak & Jeffrey B. Paris - 1992 - Archive for Mathematical Logic 32 (1):65-73.
On cofinal extensions of models of arithmetic.Henryk Kotlarski - 1983 - Journal of Symbolic Logic 48 (2):253-262.
On elementary equivalence in fuzzy predicate logics.Pilar Dellunde & Francesc Esteva - 2013 - Archive for Mathematical Logic 52 (1-2):1-17.
Trees and Keislers problem.Ali Enayat - 2001 - Archive for Mathematical Logic 40 (4):273-276.
Models of set theory with definable ordinals.Ali Enayat - 2005 - Archive for Mathematical Logic 44 (3):363-385.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.

Analytics

Added to PP
2013-11-23

Downloads
25 (#650,061)

6 months
7 (#484,016)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

On parameter free induction schemas.R. Kaye, J. Paris & C. Dimitracopoulos - 1988 - Journal of Symbolic Logic 53 (4):1082-1097.
Metamathematics of First-Order Arithmetic.P. Hájek & P. Pudlák - 2000 - Studia Logica 64 (3):429-430.

Add more references