Journal Title
Title of Journal: Arch Math Logic
|
Abbravation: Archive for Mathematical Logic
|
Publisher
Springer-Verlag
|
|
|
|
Authors: Iraj Kalantari Larry Welch
Publish Date: 2004/05/28
Volume: 43, Issue: 8, Pages: 991-1008
Abstract
This paper is a sequel to our 7 In that paper we constructed a Π10 tree of avoidable points Here we construct a Π10 tree of shadow points This tree is a tree of sharp filters where a sharp filter is a nested sequence of basic open sets converging to a point In the construction we assign to each basic open set on the tree an address in 2ω One interesting fact is that while our Π10 tree of sharp filters a subtree of Δω is isomorphic to the tree of addresses a subtree of 2ω the tree of addresses is recursively enumerable but not recursive To achieve this end we use a finite injury priority argument
Keywords:
.
|
Other Papers In This Journal:
|