Non-well-founded sets via revision rules (Q1337508): Difference between revisions

Given the consistency of ZFC and an equation \(\xi= b\), where \(b\) is any set term, possibly involving \(\xi\), the author shows how to construct a model of \(\text{ZFC}^-\) in which there is a set \(\xi\) satisfying \(\xi=b\). Here \(\text{ZFC}^-\) is ZFC without the Foundation Axiom (Regularity). The proof uses an analogue of the revision rules of Gupta and Belnap. It also employs a congruence relation that yields a quotient structure that is elementarily equivalent to the model obtained by means of the revision rules. The special case, \(\xi= \{\xi\}\), appears first as an illustration of the revision-theoretic approach.