U-monad topologies of hyperfinite time lines

Journal of Symbolic Logic 57 (2):534-539 (1992)
  Copy   BIBTEX

Abstract

In an ω1-saturated nonstandard universe a cut is an initial segment of the hyperintegers which is closed under addition. Keisler and Leth in [KL] introduced, for each given cut U, a corresponding U-topology on the hyperintegers by letting O be U-open if for any x ∈ O there is a y greater than all the elements in U such that the interval $\lbrack x - y, x + y\rbrack \subseteq O$ . Let U be a cut in a hyperfinite time line H, which is a hyperfinite initial segment of the hyperintegers. The U-monad topology of H is the quotient topology of the U-topological space H modulo U. In this paper we answer a question of Keisler and Leth about the U-monad topologies by showing that when H is κ-saturated and has cardinality κ, (1) if the coinitiality of U1 is uncountable, then the U1-monad topology and the U2-monad topology are homeomorphic iff both U1 and U2 have the same coinitiality; and (2) H can produce exactly three different U-monad topologies (up to homeomorphism) for those U's with countable coinitiality. As a corollary H can produce exactly four different U-monad topologies if the cardinality of H is ω1

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,173

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

U-lusin sets in hyperfinite time lines.Renling Jin - 1992 - Journal of Symbolic Logic 57 (2):528-533.
Cuts in hyperfinite time lines.Renling Jin - 1992 - Journal of Symbolic Logic 57 (2):522-527.
Existence of some sparse sets of nonstandard natural numbers.Renling Jin - 2001 - Journal of Symbolic Logic 66 (2):959-973.
Inverse problem for cuts.Renling Jin - 2007 - Logic and Analysis 1 (1):61-89.
The complexity of the core model.William Mitchell - 1998 - Journal of Symbolic Logic 63 (4):1393-1398.
Countable structures, Ehrenfeucht strategies, and wadge reductions.Tom Linton - 1991 - Journal of Symbolic Logic 56 (4):1325-1348.
Trees and -subsets of ω1ω1.Alan Mekler & Jouko Vaananen - 1993 - Journal of Symbolic Logic 58 (3):1052-1070.

Analytics

Added to PP
2009-01-28

Downloads
45 (#491,321)

6 months
6 (#851,951)

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

Countable ultraproducts without CH.Michael Canjar - 1988 - Annals of Pure and Applied Logic 37 (1):1-79.
Foundations of Infinitesimal Stochastic Analysis.K. D. Stroyan - 1988 - Journal of Symbolic Logic 53 (4):1261-1262.

Add more references