43
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Almost-Free Finite Covers

Pages 2997-3017 | Received 30 Oct 2007, Published online: 22 Sep 2009
 

Abstract

Let W be a first-order structure and ρ be an Aut(W)-congruence on W. In this article we define the almost-free finite covers of W with respect to ρ, and we show how to construct them. These are a generalization of free finite covers.

A consequence of a result of [Citation5] is that any finite cover of W with binding groups all equal to a simple non-abelian permutation group is almost-free with respect to some ρ on W. Our main result gives a description (up to isomorphism) in terms of the Aut(W)-congruences on W of the kernels of principal finite covers of W with binding groups equal at any point to a simple non-abelian regular permutation group G. Then we analyze almost-free finite covers of Ω(n), the set of ordered n-tuples of distinct elements from a countable set Ω, regarded as a structure with Aut(Ω(n)) = Sym(Ω) and we show a result about biinterpretability.

The material here presented addresses a problem which arises in the context of classification of totally categorical structures.

2000 Mathematics Subject Classification:

ACKNOWLEDGMENTS

The author wishes to express her thanks to D. M. Evans for several stimulating conversations and hospitality at UEA. She thanks as well O. Puglisi for his helpful suggestions related to this article.

Notes

Communicated by D. Macpherson.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.