| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662202 | Annals of Pure and Applied Logic | 2012 | 12 Pages |
Abstract
We introduce several concepts concerning the indiscernibility of trees. A tree is by definition an ordered set (O,<) such that, for any a∈O, the initial segment {b∈O:b
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
