2000 character limit reached
On graphs of total projective functions
Published 20 May 2026 in math.LO | (2605.21184v1)
Abstract: It is well known that the graph of a total $\mathbfΣ1_n$-function is $\mathbfΠ1_n$. We prove the consistency of the dual assertion at the third projective level: there is a model of $\ZFC$ in which the graph of every total $\mathbfΠ1_3$-function is $\mathbfΣ1_3$. This principle is incompatible with $\mathbfΠ1_3$-uniformization and hence with the usual projective-determinacy picture. The construction also repairs the final step of the failure-of-uniformization argument from~\cite{HOFFELNER2023103292}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.