Paper detail

A syntactic approach to Borel functions: Some extensions of Louveau's theorem

Louveau showed that if a Borel set in a Polish space happens to be in a Borel Wadge class $Γ$, then its $Γ$-code can be obtained from its Borel code in a hyperarithmetical manner. We extend Louveau's theorem to Borel functions: If a Borel function on a Polish space happens to be a $Σ_t$-function, then one can effectively find its $Σ_t$-code hyperarithmetically relative to its Borel code. More generally, we prove extension-type, domination-type, and decomposition-type variants of Louveau's theorem for Borel functions.

preprint2021arXivOpen access

Signal facts

What is known right now

Open access2 authors1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.

A syntactic approach to Borel functions: Some extensions of Louveau's theorem | BZPEER | BZPEER