Journal of Symbolic Logic 63 (1):103-127 (1998)
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)|
References found in this work BETA
No references found.
Citations of this work BETA
Selection Over Classes of Ordinals Expanded by Monadic Predicates.Alexander Rabinovich & Amit Shomrat - 2010 - Annals of Pure and Applied Logic 161 (8):1006-1023.
Similar books and articles
Algebraic Theories with Definable Skolem Functions.Lou van Den Dries - 1984 - Journal of Symbolic Logic 49 (2):625 - 629.
Algebraic Theories with Definable Skolem Functions.Lou van den Dries - 1984 - Journal of Symbolic Logic 49 (2):625-629.
A Note on Definable Skolem Functions.Philip Scowcroft - 1988 - Journal of Symbolic Logic 53 (3):905-911.
Noetherian Varieties in Definably Complete Structures.Tamara Servi - 2008 - Logic and Analysis 1 (3-4):187-204.
Minimal Realizability of Intuitionistic Arithmetic and Elementary Analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Uniformization, Choice Functions and Well Orders in the Class of Trees.Shmuel Lifsches & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (4):1206-1227.
Added to index2009-01-28
Total downloads12 ( #380,973 of 2,178,195 )
Recent downloads (6 months)1 ( #316,497 of 2,178,195 )
How can I increase my downloads?