A theorem on n-tuples which is equivalent to the well-ordering theorem

DOI10.1305/NDJFL/1093956243zbMath0183.01301OpenAlexW1968571926MaRDI QIDQ2535383

Jean E. Rubin, Herman Rubin

Publication date: 1967

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093956243

zbMATH Keywords

set theory

Related Items (5)

Computer proofs about finite and regular sets: The unifying concept of subvariance. ⋮ Injective endomorphisms of \({\mathcal G}_ X\)-normal semigroups: Infinite defects ⋮ Kategorielle Mengenlehre: Eine Charakterisierung der Kategorie der Klassen und Abbildungen ⋮ Die Inklusionsrelation zwischen Universa und ein abgeschwächtes Fundierungsaxiom ⋮ Utility functions on ordered convex sets

This page was built for publication: A theorem on n-tuples which is equivalent to the well-ordering theorem