Finiteness in not a ∑0-Property

H. Gaifman*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

We construct a sequence of transitive finite sets A n, n∈ω, such that, putting A = U n∈ω A n, A is transitive of rank ω (without urelements) and, for every sentence Φ in the language of set theory, A {models}φ if and only if A n {models}φ, for all but finitely many n's. This implies the claim of the title.

Original languageEnglish
Pages (from-to)359-368
Number of pages10
JournalIsrael Journal of Mathematics
Volume19
Issue number4
DOIs
StatePublished - Dec 1974

Fingerprint

Dive into the research topics of 'Finiteness in not a ∑0-Property'. Together they form a unique fingerprint.

Cite this