Tuples as sets

Adrian Ducourtial

arxiv: 2606.18474 · v1 · pith:OMUMXDKFnew · submitted 2026-06-16 · 🧮 math.LO · math.CO

Tuples as sets

Adrian Ducourtial This is my paper

Pith reviewed 2026-06-26 21:35 UTC · model grok-4.3

classification 🧮 math.LO math.CO

keywords ordered tuplessetssimple typesKuratowski pairstype hierarchyset theorylogic

0 comments

The pith

Ordered tuples can be defined as sets inside the simple type hierarchy, with Kuratowski pairs as one instance.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines ways to encode ordered tuples using only sets while remaining inside the hierarchy of simple types. Kuratowski's 1921 definition of the ordered pair counts as one special case of the constructions considered. A reader would care because this keeps ordered data structures inside a typed set theory without new primitives or type violations. The work shows that such encodings are feasible for tuples of various lengths.

Core claim

Ordered tuples can be constructed as sets within the simple type hierarchy, generalizing the Kuratowski ordered pair so that the construction stays inside the type discipline.

What carries the argument

The definition of ordered tuples as sets in the simple type hierarchy.

If this is right

Tuples of any finite length receive uniform set-theoretic definitions inside the type hierarchy.
Relations and functions built from these tuples inherit the same type restrictions.
The approach avoids any need for urelements or other non-set primitives.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Such encodings could simplify the translation of typed data structures into pure set theory.
They might allow direct comparison of tuple-based and set-based foundations in formal systems.

Load-bearing premise

It is possible and meaningful to encode ordered tuples as sets while staying inside the simple type hierarchy without introducing additional primitives or violating type discipline.

What would settle it

An explicit proof that no encoding of ordered triples exists that respects the simple type levels and uses only set operations.

read the original abstract

In 1921, Kuratowski gave the now-standard definition of ordered pair in the context of set theory. This paper studies the problem of defining ordered tuples as sets in the hierarchy of simple types, of which Kuratowski's construction is a special case.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper studies generalizing Kuratowski pairs to ordered tuples as sets inside the simple type hierarchy, but the abstract shows no concrete constructions or theorems.

read the letter

The punchline is that this paper is looking at how to represent ordered tuples using sets inside the simple type hierarchy, treating the classic Kuratowski pair from 1921 as a special case of that.

It does connect the dots between set-theoretic encodings and typed settings, which is a natural thing to examine if you're working in foundations. The abstract positions it as a generalization, so perhaps the paper works out some specific definitions or shows how certain properties carry over.

That said, the abstract gives almost no detail on what is actually done. There are no equations, no example constructions beyond mentioning Kuratowski, and no statement of theorems. This makes it tough to judge whether the work adds anything beyond restating the problem or if it runs into issues with type discipline when trying to encode order.

A potential soft spot is that staying strictly inside simple types might limit what can be done, and without seeing the details it's unclear if the paper addresses that or just assumes it's possible. If the constructions are straightforward adaptations, the novelty could be low.

This kind of paper is aimed at a narrow audience of logicians and type theorists who care about how set theory embeds into typed logics. Most readers outside that circle won't get much out of it.

I wouldn't cite it in my own work unless it produces a particularly useful or verified encoding. For peer review, if the full manuscript contains reproducible constructions or proofs that hold up, then yes, it deserves a referee's time in a logic journal. Otherwise the abstract is too thin to justify it.

Referee Report

0 major / 1 minor

Summary. The paper studies the problem of defining ordered tuples as sets in the hierarchy of simple types, of which Kuratowski's construction is a special case.

Significance. A successful general construction would be of interest in foundations of mathematics for unifying set-theoretic encodings with the simple type hierarchy. However, the provided text consists solely of the abstract and contains no constructions, derivations, proofs, or examples, so no assessment of significance is possible.

minor comments (1)

No sections, equations, tables, or proofs are visible; the manuscript text supplied is limited to the one-sentence abstract, preventing evaluation of any technical content.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their report. The observation that the submitted text consists only of the abstract is accurate, and we will address this by providing the full manuscript content in revision.

read point-by-point responses

Referee: the provided text consists solely of the abstract and contains no constructions, derivations, proofs, or examples, so no assessment of significance is possible.

Authors: We agree that the submitted version was limited to the abstract. The full paper develops the generalization of Kuratowski's construction to ordered tuples in the simple type hierarchy, including explicit definitions, proofs of well-definedness, and examples. These will be included in the revised submission. revision: yes

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper announces a study of defining ordered tuples as sets within the simple type hierarchy (Kuratowski as special case). No equations, constructions, predictions, or load-bearing steps are supplied in the provided text. The central claim is descriptive of the paper's own scope rather than a theorem whose justification reduces to a self-definition, fitted input, or self-citation chain. The derivation is therefore self-contained against external benchmarks with no circular reduction exhibited.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no explicit free parameters, axioms, or invented entities; ledger is empty pending full text.

pith-pipeline@v0.9.1-grok · 5541 in / 933 out tokens · 17088 ms · 2026-06-26T21:35:32.652754+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

3 extracted references

[1]

The Empty Set, the Singleton, and the Ordered Pair

Kanamori, A. (2003). “The Empty Set, the Singleton, and the Ordered Pair”. In:The Bulletin of Symbolic Logic9.3, pp. 273–298

2003
[2]

Sur la notion le l’ordre dans la th´ eorie des ensem- bles

Kuratowski, K. (1921). “Sur la notion le l’ordre dans la th´ eorie des ensem- bles”. In:Fundamenta Mathematicae2, pp. 161–171

1921
[3]

A simplification of the logic of relations

Wiener, N. (1914). “A simplification of the logic of relations”. In:Proceedings of the Cambridge Philosophical Society17, pp. 387–390. Technology disclosure.This work was partially carried out with the use of text generation models, specifically in suggesting the proof strategies for Theorems 2.9 and 3.2 and in connection with coding (see footnote 1 above...

1914

[1] [1]

The Empty Set, the Singleton, and the Ordered Pair

Kanamori, A. (2003). “The Empty Set, the Singleton, and the Ordered Pair”. In:The Bulletin of Symbolic Logic9.3, pp. 273–298

2003

[2] [2]

Sur la notion le l’ordre dans la th´ eorie des ensem- bles

Kuratowski, K. (1921). “Sur la notion le l’ordre dans la th´ eorie des ensem- bles”. In:Fundamenta Mathematicae2, pp. 161–171

1921

[3] [3]

A simplification of the logic of relations

Wiener, N. (1914). “A simplification of the logic of relations”. In:Proceedings of the Cambridge Philosophical Society17, pp. 387–390. Technology disclosure.This work was partially carried out with the use of text generation models, specifically in suggesting the proof strategies for Theorems 2.9 and 3.2 and in connection with coding (see footnote 1 above...

1914