Weakly pointed trees and partial injections

Journal of Symbolic Logic 73 (1):363-368 (2008)
  Copy   BIBTEX

Abstract

We define the notion of a weakly pointed tree, and characterize the amount of genericity necessary to prevent a uniformly branching tree being weakly pointed. We use these ideas to show there is no topological analogue of a measure-theoretic selection theorem of Graf and Mauldin

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,795

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Chain conditions of products, and weakly compact cardinals.Assaf Rinot - 2014 - Bulletin of Symbolic Logic 20 (3):293-314,.
Sheaf recursion and a separation theorem.Nathanael Leedom Ackerman - 2014 - Journal of Symbolic Logic 79 (3):882-907.
On wide Aronszajn trees in the presence of ma.Mirna Džamonja & Saharon Shelah - 2021 - Journal of Symbolic Logic 86 (1):210-223.
The halpern–läuchli theorem at a measurable cardinal.Natasha Dobrinen & Dan Hathaway - 2017 - Journal of Symbolic Logic 82 (4):1560-1575.
Mycielski among trees.Marcin Michalski, Robert Rałowski & Szymon Żeberski - 2021 - Mathematical Logic Quarterly 67 (3):271-281.
Weakly semirecursive sets.Carl G. Jockusch & James C. Owings - 1990 - Journal of Symbolic Logic 55 (2):637-644.
Introenumerability, Autoreducibility, and Randomness.L. I. Ang - forthcoming - Journal of Symbolic Logic.
Weakly o-minimal structures and some of their properties.B. Kulpeshov - 1998 - Journal of Symbolic Logic 63 (4):1511-1528.

Analytics

Added to PP
2010-09-12

Downloads
35 (#653,582)

6 months
9 (#511,775)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references