Files in this item
Undirecting membership in models of Anti-Foundation
Item metadata
dc.contributor.author | Adam-Day, Bea | |
dc.contributor.author | Cameron, Peter J. | |
dc.date.accessioned | 2020-11-19T10:30:06Z | |
dc.date.available | 2020-11-19T10:30:06Z | |
dc.date.issued | 2021-04 | |
dc.identifier.citation | Adam-Day , B & Cameron , P J 2021 , ' Undirecting membership in models of Anti-Foundation ' , Aequationes Mathematicae , vol. 95 , no. 2 , pp. 393-400 . https://doi.org/10.1007/s00010-020-00763-w | en |
dc.identifier.issn | 0001-9054 | |
dc.identifier.other | PURE: 271141935 | |
dc.identifier.other | PURE UUID: 20eb0c5c-2ef2-4501-860f-79f52e9f48d2 | |
dc.identifier.other | ORCID: /0000-0003-3130-9505/work/83889571 | |
dc.identifier.other | Scopus: 85096210210 | |
dc.identifier.other | WOS: 000590486200001 | |
dc.identifier.uri | https://hdl.handle.net/10023/21009 | |
dc.description.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 x∈y or y∈x), we obtain the Erdős–Rényi 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 x∈x for some x) or multiple edges (if x∈y and y∈x for some distinct 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 ℵ0-categorical and homogeneous), but if we keep multiple edges, the resulting graph is not ℵ0-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. | |
dc.format.extent | 8 | |
dc.language.iso | eng | |
dc.relation.ispartof | Aequationes Mathematicae | en |
dc.rights | Copyright © The Author(s) 2020. Open Access. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. | en |
dc.subject | Random graph | en |
dc.subject | Anti-Foundation Axiom | en |
dc.subject | Erdős–Rényi random graph | en |
dc.subject | Zermelo–Fraenkel axioms | en |
dc.subject | QA Mathematics | en |
dc.subject | Mathematics(all) | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Undirecting membership in models of Anti-Foundation | en |
dc.type | Journal article | en |
dc.description.version | Publisher PDF | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1007/s00010-020-00763-w | |
dc.description.status | Peer reviewed | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.