Degrees of indiscernibles in decidable models

H. A. Kierstead; J. B. Remmel

doi:10.1090/S0002-9947-1985-0779051-X

Degrees of indiscernibles in decidable models

H. A. Kierstead, J. B. Remmel

Research output: Contribution to journal › Article › peer-review

7 Scopus citations

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	https://doi.org/10.1090/S0002-9947-1985-0779051-X
State	Published - May 1985
Externally published	Yes

ASJC Scopus subject areas

General Mathematics
Applied Mathematics

Access to Document

10.1090/S0002-9947-1985-0779051-X

Cite this

@article{fe283b1ff09f46f7bcb510fce0ca3f11,

title = "Degrees of indiscernibles in decidable models",

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.",

author = "Kierstead, {H. A.} and Remmel, {J. B.}",

year = "1985",

month = may,

doi = "10.1090/S0002-9947-1985-0779051-X",

language = "English (US)",

volume = "289",

pages = "41--57",

journal = "Transactions of the American Mathematical Society",

issn = "0002-9947",

publisher = "American Mathematical Society",

number = "1",

}

TY - JOUR

T1 - Degrees of indiscernibles in decidable models

AU - Kierstead, H. A.

AU - Remmel, J. B.

PY - 1985/5

Y1 - 1985/5

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=26444548944&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26444548944&partnerID=8YFLogxK

U2 - 10.1090/S0002-9947-1985-0779051-X

DO - 10.1090/S0002-9947-1985-0779051-X

M3 - Article

AN - SCOPUS:26444548944

SN - 0002-9947

VL - 289

SP - 41

EP - 57

JO - Transactions of the American Mathematical Society

JF - Transactions of the American Mathematical Society

IS - 1

ER -

Degrees of indiscernibles in decidable models

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this