Equivariant ZFA with Choice: a position paper
Logic in Computer Science
2018-03-26 v1 Logic
Abstract
We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning.
Cite
@article{arxiv.1803.08727,
title = {Equivariant ZFA with Choice: a position paper},
author = {Murdoch J. Gabbay},
journal= {arXiv preprint arXiv:1803.08727},
year = {2018}
}
Comments
In ARW 2018