2021/07/16 by Zuhair Al-Johar, Al-Johar, Zuhair
Computer Science · Mathematics · #FOS: Mathematics #Geometric and Algebraic Topology #Logic (math.LO) #Logic, programming, and type systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2107.11888
openalex publication_date 2021/07/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful many axioms that are completely untyped and framed in the usual language of set theory, and proven to be equivalent to NF. Here, it'll be shown that if we assume the consistency of ZF plus an automorphism and an external bijection with suitable internalization of subsets of its domain and codomain, then NF would be interpreted in this system using a modification of Boffa construction models.