Reconsidering ordered pairs

Bulletin of Symbolic Logic 14 (3):379-397 (2008)
The well known Wiener-Kuratowski explicit definition of the ordered pair, which sets ⟨x, y⟩ = {{x}, {x, y}}, works well in many set theories but fails for those with classes which cannot be members of singletons. With the aid of the Axiom of Foundation, we propose a recursive definition of ordered pair which addresses this shortcoming and also naturally generalizes to ordered tuples of greater lenght. There are many advantages to the new definition, for it allows for uniform definitions working equally well in a wide range of models for set theories. In ZFC and closely related theories, the of an ordered pair of two infinite sets under the new definition turns out to be equal to the maximum of the ranks of the sets
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/bsl/1231081372
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 22,046
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

57 ( #78,695 of 1,934,424 )

Recent downloads (6 months)

10 ( #52,871 of 1,934,424 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.