# Forcing as a computational process

@article{Hamkins2020ForcingAA, title={Forcing as a computational process}, author={Joel David Hamkins and Russell G. Miller and Kameryn J. Williams}, journal={arXiv: Logic}, year={2020} }

We investigate how set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for information about a model of set theory $\langle M,\in^M\rangle$, we explain senses in which one may compute $M$-generic filters $G\subseteq\mathbb{P}\in M$ and the corresponding forcing extensions $M[G]$. Specifically, from the atomic diagram one may compute $G$, from the $\Delta_0$-diagram one may compute $M[G]$ and its $\Delta_0$-diagram, and from the elementary…

## References

SHOWING 1-10 OF 33 REFERENCES

THE EXACT STRENGTH OF THE CLASS FORCING THEOREM

- MathematicsThe Journal of Symbolic Logic
- 2020

The class forcing theorem is equivalent over Gödel–Bernays set theory to the principle of elementary transfinite recursion for class recursions of length and to the existence of truth predicates for first-order set theory.

On ground model definability

- Mathematics
- 2013

Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability…

Computable Quotient Presentations of Models of Arithmetic and Set Theory

- Mathematics, Computer ScienceWoLLIC
- 2017

Various extensions of the Tennenbaum phenomenon are proved to prove no nonstandard model of arithmetic has a computable quotient presentation by a c.e. equivalence relation of any complexity.

The model companions of set theory

- Mathematics
- 2019

We show that the first order theory of $H_{\omega_1}$ is the model companion of the first order theory of the universe of sets assuming the existence of class many Woodin cardinals, and working in a…

A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS

- MathematicsThe Journal of Symbolic Logic
- 2018

A new construction of a fully faithful functor is given and it is proved that the functor and its partially defined inverse (restricted to the categories of countable graphs and countable fields) are computable functors.

The downward directed grounds hypothesis and very large cardinals

- MathematicsJ. Math. Log.
- 2017

It is shown that if the universe has some very large cardinal, then the mantle must be a ground, and some fundamental theorems on the forcing method and the set-theoretic geology are established.

On extendability of models of ZF set theory to the models of Kelley-Morse theory of classes

- Economics
- 1975

Publisher Summary This chapter deals with the four basic theories: ZFC (theory of Zermelo and Fraenkel with choice), ZF KM , KM (Kelley–Morse), and KMC. KM is the theory based on ten axioms:…

BOREL FUNCTORS AND INFINITARY INTERPRETATIONS

- MathematicsThe Journal of Symbolic Logic
- 2018

It is shown that for the case of infinitary interpretation the reversals are also true: every Baire-measurable homomorphism between the automorphism groups of two countable structures is induced by an inf initary interpretation.