ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY
Copyright policy )ITERATED PRIORITY ARGUMENTS IN DESCRIPTIVE SET THEORY
AbstractWe present the true stages machinery and illustrate its applications to descriptive set theory. We use this machinery to provide new proofs of the Hausdorff–Kuratowski and Wadge theorems on the structure of $\mathbf {\Delta }^0_\xi $ , Louveau and Saint Raymond’s separation theorem, and Louveau’s separation theorem.
true stages, 03D99, Applications of computability and recursion theory, FOS: Mathematics, priority argument, Mathematics - Logic, Logic (math.LO), Descriptive set theory, Hierarchies of computability and definability, Borel hierarchy
true stages, 03D99, Applications of computability and recursion theory, FOS: Mathematics, priority argument, Mathematics - Logic, Logic (math.LO), Descriptive set theory, Hierarchies of computability and definability, Borel hierarchy
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!