Abstract
We show that the problem of finding an infinite set of indis- cernibles in an arbitrary decidable model of a first order theory is essentially equivalent to the problem of finding an infinite path through a recursive uj- branching tree. Similarly, we show that the problem of finding an infinite set of indiscernibles in a decidable model of an u;-categorical theory with decidable atoms is essentially equivalent to finding an infinite path through a recursive binary tree.
Original language | English (US) |
---|---|
Pages (from-to) | 41-57 |
Number of pages | 17 |
Journal | Transactions of the American Mathematical Society |
Volume | 289 |
Issue number | 1 |
DOIs | |
State | Published - May 1985 |
Externally published | Yes |
ASJC Scopus subject areas
- General Mathematics
- Applied Mathematics