Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T21:10:05.449Z Has data issue: false hasContentIssue false

Definability in well quasi-ordered sets of structures

Published online by Cambridge University Press:  12 March 2014

Charles K. Landraitis*
Affiliation:
Boston College, Boston, Massachusetts 02167

Extract

The theorem introduced here provides a sufficient condition for an axiomatic class to be elementary. It resulted from consideration of a definability problem in , but is introduced in a less specific context and accompanied by applications to .

As in [La, 1], [La, 2], a reflexive, transitive binary relation R on a nonempty set S will be called a quasi-ordering or q.o. of S. A set of pairwise incomparable elements of S is an antichain and a subset of S linearly ordered by R is a chain. A chain {Si: i ∈ ω} with i > j if and only if (siRsj ∧ ¬ sjRSi) will be called an infinite descending chain. If S has no infinite antichains nor any infinite descending chains, S is well quasi-ordered by R, and is called a well quasi-ordering or w.q.o. Any subset of a w.q.o. is a w.q.o. An element s of a q.o. S is minimal in S if ∀t ∈ S(tRs → sRt). A subset S′ of S is a foundation for S if ∀t ∈ S∃s ∈ S′(sRt).

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1977

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable