Equivariant ZFA with Choice: a position paper
Murdoch J. Gabbay

TL;DR
This paper introduces Equivariant ZFA with Choice, a new foundational framework for nominal techniques that balances strength and flexibility, aiming to improve automated reasoning methods.
Contribution
It proposes a novel set-theoretic foundation that is stronger than ZFC but weaker than FM, tailored for nominal techniques and automation.
Findings
Defines Equivariant ZFA with Choice as a foundation.
Explains advantages for automated reasoning.
Positions the framework between ZFC and FM.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Logic, programming, and type systems · Advanced Algebra and Logic
