Graduate studies at Western
Journal of Symbolic Logic 63 (1):103-127 (1998)
|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 definable Skolem functions (by a monadic formula with parameters)? This continues  where the question was asked only with respect to choice functions. A natural subclass is defined and proved to be the class of trees with definable Skolem functions. Along the way we investigate the spectrum of definable well orderings of well ordered chains|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Lou van Den Dries (1984). Algebraic Theories with Definable Skolem Functions. Journal of Symbolic Logic 49 (2):625 - 629.
Zlatan Damnjanovic (1995). Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis. Journal of Symbolic Logic 60 (4):1208-1241.
Carlo Cellucci (2000). Analytic Cut Trees. Logic Journal of the IGPL 8:733-750.
Tamara Servi (2008). Noetherian Varieties in Definably Complete Structures. Logic and Analysis 1 (3-4):187-204.
Philip Scowcroft (1988). A Note on Definable Skolem Functions. Journal of Symbolic Logic 53 (3):905-911.
Dale A. Miller (1987). A Compact Representation of Proofs. Studia Logica 46 (4):347 - 370.
Lou van den Dries (1984). Algebraic Theories with Definable Skolem Functions. Journal of Symbolic Logic 49 (2):625-629.
Shmuel Lifsches & Saharon Shelah (1996). Uniformization, Choice Functions and Well Orders in the Class of Trees. Journal of Symbolic Logic 61 (4):1206-1227.
Added to index2009-01-28
Total downloads2 ( #246,970 of 740,542 )
Recent downloads (6 months)1 ( #61,957 of 740,542 )
How can I increase my downloads?