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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,401

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
73 (#298,031)

6 months
12 (#218,371)

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.
Some Ramsey-type theorems for countably determined sets.Josef Mlček & Pavol Zlatoš - 2002 - Archive for Mathematical Logic 41 (7):619-630.
Every Borel function is monotone Borel.Boško Živaljević - 1991 - Annals of Pure and Applied Logic 54 (1):87-99.

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