Journal of Symbolic Logic 61 (4):1206-1227 (1996)
|Abstract||The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have a definable choice function (by a monadic formula with parameters)? A natural dichotomy arises where the trees that fall in the first class don't have a definable choice function and the trees in the second class have even a definable well ordering of their elements. This has a close connection to the uniformization problem|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
H. E. Baber (1987). How Bad Is Rape? Hypatia 2 (2):125 - 138.
Erazim Kohák (1992). Speaking to Trees. Critical Review 6 (2-3):371-388.
Robert Batterman (1992). Quantum Chaos and Semiclassical Mechanics. PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1992:50 - 65.
Tapani Hyttinen & Jouko Väänänen (1990). On Scott and Karp Trees of Uncountable Models. Journal of Symbolic Logic 55 (3):897-908.
Jan E. Holly (1997). Prototypes for Definable Subsets of Algebraically Closed Valued Fields. Journal of Symbolic Logic 62 (4):1093-1141.
Prakash P. Shenoy (1998). Game Trees For Decision Analysis. Theory and Decision 44 (2):149-171.
Yuri Gurevich & Saharon Shelah (1983). Rabin's Uniformization Problem. Journal of Symbolic Logic 48 (4):1105-1119.
Carlo Cellucci (2000). Analytic Cut Trees. Logic Journal of the IGPL 8:733-750.
Shmuel Lifsches & Saharon Shelah (1998). Uniformization and Skolem Functions in the Class of Trees. Journal of Symbolic Logic 63 (1):103-127.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,386 of 722,774 )
Recent downloads (6 months)1 ( #60,541 of 722,774 )
How can I increase my downloads?