Igor Postanovskyi

Definability of quantization inputs: a Padoa-style classification and its boundary

Quantum theory carries several discrete or numerical inputs that are routinely described as "not derived" from an underlying substrate. This paper asks a sharper question: for which of these inputs can "not derived" be upgraded to a proof of undefinability, and for which is this...

Definability of quantization inputs: a Padoa-style classification and its boundary

Quantum theory carries several discrete or numerical inputs that are routinely described as "not derived" from an underlying substrate. This paper asks a sharper question: for which of these inputs can "not derived" be upgraded to a proof of undefinability, and for which is this...