Locally countable models of Σ1-separation

Journal of Symbolic Logic 46 (1):96 - 100 (1981)
  Copy   BIBTEX

Abstract

Let α be any countable admissible ordinal greater than ω. There is a transitive set A such that A is admissible, locally countable, On A = α, and A satisfies Σ 1 -separation. In fact, if B is any nonstandard model of $KP + \forall x \subseteq \omega$ (the hyperjump of x exists), the ordinal standard part of B is greater than ω, and every standard ordinal in B is countable in B, then HC B ∩ (standard part of B) satisfies Σ 1 -separation

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,248

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

Σ1-separation.Fred G. Abramson - 1979 - Journal of Symbolic Logic 44 (3):374 - 382.
Possible PCF algebras.Thomas Jech & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (1):313-317.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
Countable structures, Ehrenfeucht strategies, and wadge reductions.Tom Linton - 1991 - Journal of Symbolic Logic 56 (4):1325-1348.
The largest countable inductive set is a mouse set.Mitch Rudominer - 1999 - Journal of Symbolic Logic 64 (2):443-459.
∑1 definitions with parameters.T. A. Slaman - 1986 - Journal of Symbolic Logic 51 (2):453-461.
Generic coding with help and amalgamation failure.Sy-David Friedman & Dan Hathaway - 2021 - Journal of Symbolic Logic 86 (4):1385-1395.
Initial self-embeddings of models of set theory.Ali Enayat & Zachiri Mckenzie - 2021 - Journal of Symbolic Logic 86 (4):1584-1611.

Analytics

Added to PP
2009-01-28

Downloads
98 (#235,468)

6 months
13 (#313,048)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references