Equivariant ZFA and the foundations of nominal techniques
Logic in Computer Science
2020-01-23 v3 Logic
Abstract
We give an accessible presentation to the foundations of nominal techniques, lying between Zermelo-Fraenkel set theory and Fraenkel-Mostowski set theory, and which has several nice properties including being consistent with the Axiom of Choice. We give two presentations of equivariance, accompanied by detailed yet user-friendly discussions of its theoretical significance and practical application.
Cite
@article{arxiv.1801.09443,
title = {Equivariant ZFA and the foundations of nominal techniques},
author = {Murdoch J. Gabbay},
journal= {arXiv preprint arXiv:1801.09443},
year = {2020}
}