Author:
Lifsches Shmuel,Shelah Saharon
Abstract
AbstractThe 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 [6] 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.
Publisher
Cambridge University Press (CUP)
Reference8 articles.
1. The Monadic Theory of Order
2. Solving sequential conditions by finite-state strategies
3. Decidability of second-order theories and automata on infinite trees;Rabin;Transactions of the American Mathematical Society,1969
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Uniformisations of Regular Relations Over Bi-Infinite Words;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
2. Uniformization Problem for Variants of First Order Logic over Finite Words;Developments in Language Theory;2018
3. Regular Languages of Thin Trees;Theory of Computing Systems;2015-04-08
4. Interpretations in Trees with Countably Many Branches;2012 27th Annual IEEE Symposium on Logic in Computer Science;2012-06
5. Regular sets over extended tree structures;Theoretical Computer Science;2012-02