当前位置:
X-MOL 学术
›
arXiv.cs.LO
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Equivariant ZFA and the foundations of nominal techniques
arXiv - CS - Logic in Computer Science Pub Date : 2018-01-29 , DOI: arxiv-1801.09443 Murdoch J. Gabbay
arXiv - CS - Logic in Computer Science Pub Date : 2018-01-29 , DOI: arxiv-1801.09443 Murdoch J. Gabbay
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.
中文翻译:
等变 ZFA 和名义技术的基础
我们对名义技术的基础进行了易于理解的介绍,介于 Zermelo-Fraenkel 集合理论和 Fraenkel-Mostowski 集合理论之间,并且具有几个不错的特性,包括与选择公理一致。我们给出了两个等方差的介绍,并对其理论意义和实际应用进行了详细而用户友好的讨论。
更新日期:2020-01-23
中文翻译:
等变 ZFA 和名义技术的基础
我们对名义技术的基础进行了易于理解的介绍,介于 Zermelo-Fraenkel 集合理论和 Fraenkel-Mostowski 集合理论之间,并且具有几个不错的特性,包括与选择公理一致。我们给出了两个等方差的介绍,并对其理论意义和实际应用进行了详细而用户友好的讨论。