query: Is there an flat unordered pairing function in ZFC?
positive_passages.docid: 28368
positive_passages.text: Is there a constructible flat pairing function?
negative_passages.docid: 156252
negative_passages.text: Are sets constructed using only ZF measurable using ZFC?
negative_passages.docid: 138993
negative_passages.text: Conjugate transpose of a U-gate
negative_passages.docid: 3217
negative_passages.text: Construction of uncountably many non-isomorphic linear (total) orderings of natural numbers
negative_passages.docid: 154445
negative_passages.text: balanced Shortest[] and string-patterns
negative_passages.docid: 113243
negative_passages.text: What is the equivalent of the C++ Pair in Java?
negative_passages.docid: 65615
negative_passages.text: Pure function with attributes of arbitrary number of arguments: Is it possible?
negative_passages.docid: 5584
negative_passages.text: How strong is this second-order version of ZFC?
negative_passages.docid: 113953
negative_passages.text: Circular permutations with indistinguishable objects
negative_passages.docid: 149867
negative_passages.text: Why is `sort < "$f1" ` preferred over `sort -- "$f1"`, and why is this preferred over `sort "$f1"`?
negative_passages.docid: 32741
negative_passages.text: Idempotents in a ring without unity (rng) and no zero divisors.
negative_passages.docid: 119982
negative_passages.text: how to express the set of natural numbers in ZFC
negative_passages.docid: 153651
negative_passages.text: Countable partition in atoms
negative_passages.docid: 28452
negative_passages.text: Statement that is provable in $ZFC+CH$ yet unprovable in $ZFC+\lnot CH$
negative_passages.docid: 154759
negative_passages.text: Kuratowski-Zorn Lemma with pre-order (quasi-order, proset) instead poset?
negative_passages.docid: 36325
negative_passages.text: Embedding ordinals in $\mathbb{Q}$
negative_passages.docid: 15966
negative_passages.text: A way to well-order real line