## Infinite Computations with Random Oracles

- Merlin Carl, Philipp Schlicht
- Notre Dame Journal of Formal Logic
- 2017

3 Excerpts

- Published 2013

Using the theory of rudimentary recursion and provident sets developed in a previous paper, we give a treatment of set forcing appropriate for working over models of a theory PROVI which may plausibly claim to be the weakest set theory supporting a smooth theory of set forcing, and of which the minimal model is Jensen’s Jω. Much of the development is rudimentary or at worst given by rudimentary recursions with parameter the notion of forcing under consideration. Our development eschews the power set axiom. We show that the forcing relation for ∆̇0 wffs is propagated through our hierarchies by a rudimentary function, and we show that the construction of names for the values of rudimentary and rudimentarily recursive functions is similarly propagated. Our main result is that a set-generic extension of a provident set is provident.

Citations per Year

Averaging **9 citations** per year over the last 3 years.

@inproceedings{Mathias2013ProvidentSA,
title={Provident sets and rudimentary set forcing},
author={A. R. D. Mathias},
year={2013}
}