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.
- Combinatory logic. With two sections by William Craig.
- scientific article; zbMATH DE number 3873291 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 42737 (Why is no real title available?)
- scientific article; zbMATH DE number 44058 (Why is no real title available?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 795569 (Why is no real title available?)
- Notes on naive semantics
- Truth and paradox
- What's in a function?
- On non-wellfounded sets as fixed points of substitutions
- scientific article; zbMATH DE number 4181325 (Why is no real title available?)
- Extensional quotients for type theory and the consistency problem for NF
- Non-well-founded extensions of V
- Free set algebras satisfying systems of equations
- Guest editors' introduction
This page was built for publication: Non-well-founded sets via revision rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337508)
