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

Construction of models from groups of permutations

Published online by Cambridge University Press:  12 March 2014

Miroslav Benda*
Affiliation:
University of Washington, Seattle, Washington 98195

Extract

In [3] we have associated to a structure an ordinal which gives us information about elementary substructures of the structure. For example a structure whose ascending chain number (as we call the ordinal) is ω could be called Noetherian since all ascending elementary chains inside it are finite (and there are arbitrarily large finite chains). Theorem 2 shows that such structures exist. In fact we prove that for any α < ω1 there is a structure whose ascending chain number is α. The construction is based on the existence of a certain group of permutations of ω (see Theorem 1). The second part of this paper deals with the relevance of the chain number to the study of Jonsson algebras.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1975

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