树类中的一致化与Skolem函数
Uniformization and Skolem functions in the class of trees
摘要：
树的一元二阶理论允许对元素和任意子集进行量化。我们分类类的树的问题：树T有可定义的Skolem函数（由一个一元公式与参数）？这继续[LiSh539]，其中仅就选择函数提出问题。在这里，我们定义了一个子类的类驯服树（树与一个可定义的选择函数），并证明这正是类（实际上集）的树与可定义的Skolem功能。
英文摘要：
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 [LiSh539] where the question was asked only with respect to choice functions. Here we define a subclass of the class of tame trees (trees with a definable choice function) and prove that this is exactly the class (actually set) of trees with definable Skolem functions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
