Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of uniform reflections. This result is commonly known as Feferman's completeness theorem. The talk aims to give one or two new proofs of Feferman's completeness theorem that, we hope, shed new light on this mysterious and often overlooked result.

Moreover, one of the proofs furnishes sharp bounds on the order types of well-orders necessary to attain completeness.

(This is joint work with Fedor Pakhomov and Dino Rossegger.)

In the theory of perfectoid fields, the tilting operation takes a perfectoid field K (a densely normed complete field of positive residue characteristic p for which the map which sends x to its p-th power is surjective as a self-map on O/pO where O is the ring of integers) to its tilt, which is computed as the limit in the category of multiplicative monoids of K under repeated application of the map sending x to its p-th power, and then a natural normed field structure is constructed. It may happen that two non-isomorphic perfectoid fields have isomorphic tilts. The family of characteristic zero untilts of a complete nontrivially normed complete perfect field of positive characteristic are parameterized by the Fargues-Fontaine curve.

Taking into account these parameters, we show that this correspondence between perfectoid fields of mixed characteristic and their tilts may be regarded as a quantifier-free bi-interpretation in continuous logic. The existence of this bi-interpretation allows for some soft proofs of some features of tilting such as the Fontaine-Wintenberger theorem that a perfectoid field and its tilt have isomorphic absolute Galois groups, an approximation lemma for the tilts of definable sets, and identifications of adic spaces.

This is a report on (rather old, mostly from 2016/7) joint work with Silvain Rideau-Kikuchi and Pierre Simon available at https://arxiv.org/html/2505.01321v1 .