Forcing with Non-wellfounded Models

  • Paul Corazza Department of Computer Science, Maharishi University of Management

Abstract

We develop the machinery for performing forcing over an arbitrary (possibly non-wellfounded) model of set theory. For consistency results, this machinery is unnecessary since such results can always be legitimately obtained by assuming that the ground model is (countable) transitive. However, for establishing properties of a given (possibly non-wellfounded) model, the fully developed machinery of forcing as a means to produce new related models can be useful. We develop forcing through iterated forcing, paralleling the standard steps of presentation found in [19] and [14].

Author Biography

Paul Corazza, Department of Computer Science, Maharishi University of Management
Published
2007-11-30
How to Cite
CORAZZA, Paul. Forcing with Non-wellfounded Models. The Australasian Journal of Logic, [S.l.], v. 5, nov. 2007. ISSN 1448-5052. Available at: <https://ojs.victoria.ac.nz/ajl/article/view/1784>. Date accessed: 18 july 2019. doi: https://doi.org/10.26686/ajl.v5i0.1784.