Uniformization, choice functions and well orders in the class of trees

Journal of Symbolic Logic 61 (4):1206-1227 (1996)
  Copy   BIBTEX

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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

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

How Bad Is Rape?H. E. Baber - 1987 - Hypatia 2 (2):125-138.
Analytic cut trees.Carlo Cellucci - 2000 - Logic Journal of the IGPL 8 (6):733-750.
Rabin's uniformization problem.Yuri Gurevich & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (4):1105-1119.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
Quantum Chaos and Semiclassical Mechanics.Robert Batterman - 1992 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1992:50-65.
Speaking to trees.Erazim Kohák - 1992 - Critical Review: A Journal of Politics and Society 6 (2-3):371-388.

Analytics

Added to PP
2009-01-28

Downloads
112 (#159,137)

6 months
27 (#111,271)

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