A note on a theorem of Kanovei

Archive for Mathematical Logic 43 (4):565-569 (2004)
  Copy   BIBTEX

Abstract

We give a short proof of a theorem of Kanovei on separating induction and collection schemes for Σ n formulas using families of subsets of countable models of arithmetic coded in elementary end extensions

Categories

Keywords

Reprint years

DOI

10.1007/s00153-004-0218-2

Links

PhilArchive



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

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

Nonstandard characterizations of recursive saturation and resplendency.Stuart T. Smith - 1987 - Journal of Symbolic Logic 52 (3):842-863.
Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
Expansions, omitting types, and standard systems.Fredrik Engström - 2004 - Dissertation, Chalmers
Real closures of models of weak arithmetic.Emil Jeřábek & Leszek Aleksander Kołodziejczyk - 2013 - Archive for Mathematical Logic 52 (1):143-157.
A Simple Proof of Parsons' Theorem.Fernando Ferreira - 2005 - Notre Dame Journal of Formal Logic 46 (1):83-91.
Elementary extensions of external classes in a nonstandard universe.Vladimir Kanovei & Michael Reeken - 1998 - Studia Logica 60 (2):253-273.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Set Theory, Arithmetic, and Foundations of Mathematics: Theorems, Philosophies.Juliette Kennedy & Roman Kossak (eds.) - 2011 - Cambridge University Press.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.
Blunt and topless end extensions of models of set theory.Matt Kaufmann - 1983 - Journal of Symbolic Logic 48 (4):1053-1073.
The tractatus system of arithmetic.Pasquale Frascolla - 1997 - Synthese 112 (3):353-378.
The strength of nonstandard methods in arithmetic.C. Ward Henson, Matt Kaufmann & H. Jerome Keisler - 1984 - Journal of Symbolic Logic 49 (4):1039-1058.
Uniqueness, collection, and external collapse of cardinals in ist and models of peano arithmetic.V. Kanovei - 1995 - Journal of Symbolic Logic 60 (1):318-324.
Subsets of models of arithmetic.Roman Kossak & Jeffrey B. Paris - 1992 - Archive for Mathematical Logic 32 (1):65-73.
On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.

Analytics

Added to PP
2013-11-23

Downloads
20 (#771,402)

6 months
8 (#370,225)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Roman Kossak
City University of New York

Citations of this work

Subsets coded in elementary end extensions.James H. Schmerl - 2014 - Archive for Mathematical Logic 53 (5-6):571-581.
On Cofinal Submodels and Elementary Interstices.Roman Kossak & James H. Schmerl - 2012 - Notre Dame Journal of Formal Logic 53 (3):267-287.

Add more citations

References found in this work

No references found.

Add more references