Uniformization and Skolem functions in the class of trees
| dc.creator | Lifsches, Shmuel | |
| dc.creator | Shelah, Saharon | |
| dc.date | 1994-12-15 | |
| dc.date.accessioned | 2026-07-07T09:15:14Z | |
| dc.date.available | 2026-07-07T09:15:14Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/9412231 | |
| dc.identifier | http://arxiv.org/abs/math/9412231 | |
| dc.identifier | J. Symbolic Logic 63 (1998), 103--127 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/152952 | |
| dc.subject | Logic | |
| dc.title | Uniformization and Skolem functions in the class of trees | |
| dc.type | text |