Undirecting membership in models of anti-foundation

From MaRDI portal
Publication:2662895



Abstract: It is known that, if we take a countable model of Zermelo--Fraenkel set theory ZFC and "undirect" the membership relation (that is, make a graph by joining x to y if either xiny or yinx), we obtain the ErdH{o}s--R'enyi random graph. The crucial axiom in the proof of this is the Axiom of Foundation, so it is natural to wonder what happens if we delete this axiom, or replace it by an alternative (such as Aczel's Anti-Foundation Axiom). The resulting graph may fail to be simple, it may have loops (if xinx for some x) or multiple edges (if xiny and yinx for some x,y). We show that, in ZFA, if we keep the loops and ignore the multiple edges, we obtain the "random loopy graph" (which is aleph0-categorical and homogeneous), but if we keep multiple edges, the resulting graph is not aleph0-categorical, but has infinitely many 1-types. Moreover, if we keep only loops and double edges and discard single edges, the resulting graph contains countably many connected components isomorphic to any given finite connected graph with loops.












This page was built for publication: Undirecting membership in models of anti-foundation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2662895)