Previsible sets for hyperfinite filtrations

Summary Previsible (or predictable) stochastic processes are defined for any filtration over a probability space (Dellacherie and Meyer (1978), IV. 61). This technical definition gives previsible processes certain predictability properties such as not being able to oscillate in unison with martingale differentials. Thus previsibility has become one essential ingredient in The General Theory of Stochastic Processes.We show that previsible sets for Keisler's (1984) special hyperfinite filtration are given both combinatorially and by a left filtration. Keisler's scheme has many other interesting features.Our main technical tool is an extension of Henson's (1979) analysis of analytic sets and the standard part map.