This paper is a sequel to our [7]. In that paper we constructed a 0 1 tree of avoidable points. Here we construct a 0 1 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 ea
โฆ LIBER โฆ
A blend of methods of recursion theory and topology
โ Scribed by Iraj Kalantari; Larry Welch
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 429 KB
- Volume
- 124
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A blend of methods of recursion theory a
โ
Iraj Kalantari; Larry Welch
๐
Article
๐
2004
๐
Springer
๐
English
โ 610 KB
On a class of recursive network topologi
โ
J.H.M. Andriessen
๐
Article
๐
1991
๐
Elsevier Science
โ 432 KB
Transfinite Recursion in a Theory of Pro
โ
Stephen Pollard
๐
Article
๐
1986
๐
John Wiley and Sons
๐
English
โ 496 KB
As SCOTT has shown, the Replacement. scheme of Z F derives a large part, of its strength from the Extensionality axiom. For in the absence of the latter, the supply of demonstrably functional formula matrices is relatively ineagei..l) I n this situation, u-e can restore some of Replacemmt's vigor by
A family of methods with three-term recu
โ
M. Papadrakakis
๐
Article
๐
1982
๐
John Wiley and Sons
๐
English
โ 768 KB
A New Recursion in the Theory of Macdona
โ
A. M. Garsia; J. Haglund
๐
Article
๐
2011
๐
Springer
๐
English
โ 442 KB
Grothendieck topology and the theory of
โ
A. Yu. Geronimus
๐
Article
๐
1971
๐
Springer US
๐
English
โ 637 KB