Ideal Analytic Sets
Copyright policy )Ideal Analytic Sets
ABSTRACT The aim of this study is to give natural examples of ‐complete and ‐complete sets. In the first part, we consider ideals on . We use a unified approach introduced in [4] to create reductions of the collection of ill‐founded trees to the ideals, proving ‐completeness of the ideals. In the second part, we show the connection between this topic, families of trees and coding of ‐ideals of Polish spaces. In particular, we use the unified approach to prove that sets of codes for closed Ramsey‐null sets, for closed ‐compact sets and for closed not strongly dominating sets are ‐complete.
Logic, General Topology (math.GN), FOS: Mathematics, General Topology, 03E75, 28A05, 54H05 (Primary), 03E17 (Secondary), Logic (math.LO)
Logic, General Topology (math.GN), FOS: Mathematics, General Topology, 03E75, 28A05, 54H05 (Primary), 03E17 (Secondary), Logic (math.LO)
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!