Descriptive set theory over hyperfinite sets

, , &
Journal of Symbolic Logic 54 (4):1167-1180 (1989)
  Copy   BIBTEX

Abstract

The separation, uniformization, and other properties of the Borel and projective hierarchies over hyperfinite sets are investigated and compared to the corresponding properties in classical descriptive set theory. The techniques used in this investigation also provide some results about countably determined sets and functions, as well as an improvement of an earlier theorem of Kunen and Miller

Categories

Keywords

Reprint years

DOI

10.2307/2274812

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,276

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

Some results about borel sets in descriptive set theory of hyperfinite sets.Boško Živaljević - 1990 - Journal of Symbolic Logic 55 (2):604-614.
New directions in descriptive set theory.Alexander S. Kechris - 1999 - Bulletin of Symbolic Logic 5 (2):161-174.
Miller Arnold W.. Descriptive set theory and forcing. How to prove theorems about Borel sets the hard way. Lecture notes in logic, no. 4. Springer, Berlin, Heidelberg, New York, etc., 1995, ii + 130 pp. [REVIEW]Tomek Bartoszynski - 1997 - Journal of Symbolic Logic 62 (1):320-321.
U-lusin sets in hyperfinite time lines.Renling Jin - 1992 - Journal of Symbolic Logic 57 (2):528-533.
Existence of some sparse sets of nonstandard natural numbers.Renling Jin - 2001 - Journal of Symbolic Logic 66 (2):959-973.
A theory of hyperfinite sets.P. V. Andreev & E. I. Gordon - 2006 - Annals of Pure and Applied Logic 143 (1-3):3-19.
Fine hierarchies and Boolean terms.V. L. Selivanov - 1995 - Journal of Symbolic Logic 60 (1):289-317.

Analytics

Added to PP
2009-01-28

Downloads
77 (#290,737)

6 months
16 (#188,869)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

From discrete to continuous time.H. Jerome Keisler - 1991 - Annals of Pure and Applied Logic 52 (1-2):99-141.
Every Borel function is monotone Borel.Boško Živaljević - 1991 - Annals of Pure and Applied Logic 54 (1):87-99.
Some Ramsey-type theorems for countably determined sets.Josef Mlček & Pavol Zlatoš - 2002 - Archive for Mathematical Logic 41 (7):619-630.

Add more citations

References found in this work

A Question of Borel Hyperdeterminacy.Nigel J. Cutland - 1984 - Mathematical Logic Quarterly 30 (19-24):313-316.
Foundations of Infinitesimal Stochastic Analysis.K. D. Stroyan - 1988 - Journal of Symbolic Logic 53 (4):1261-1262.

Add more references