In computability theory a cylindrification is a construction that associates a cylindric numbering to each numbering.
The concept was first introduced by Yuri L. Ershov in 1973.
ν
is the Cantor pairing function.
Note that the cylindrification operation increases the input arity by 1.