Complexit\'e des bor\'eliens \`a coupes d\'enombrables
classification
🧮 math.LO
math.GN
keywords
polishbecomeborelcannotchangingcharacterizationcomplexitcomplexity
read the original abstract
We give, for each level of complexity L, a Hurewicz-like characterization of the Borel subsets with countable sections of a product of two Polish spaces that cannot become in L by changing the two Polish topologies.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.