Abstract
Shoenfield's unramified version of Cohen's forcing is defined in two stages: one which does not preserve double negation and the other which modifies the former so as to preserve double negation. Here we express the unramified forcing, which preserves double negation, in a single stage. Surprisingly enough, the corresponding definition of forcing for equality acquires a rather simple form. In [2] forcing ∥- is expressed in terms of strong forcing\( \Vdash * \) viap∥-Q iffp \( \Vdash * \) ¬ ¬Q for every formulaQ ofZF set theory and every elementp of a partially ordered set (P, ≦). In its turn,p \( \Vdash * \) Q is defined by the following five clauses:
.
Similar content being viewed by others
References
Kunen, K.: Set Theory. North-Holland Pub. Co., 1980.
Shoenfield, J.R.: Unramified forcing in axiomatic set-theory. Proc. Symp. Pure Math. Amer. Math. Soc.13 (1971).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Abian, A., Keremedis, K. Unramified forcing preserving the law of double negation. Arch math Logik 26, 177–180 (1987). https://doi.org/10.1007/BF02017502
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02017502