Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T14:21:26.405Z Has data issue: false hasContentIssue false

ℵ0-categorical tree-decomposable structures

Published online by Cambridge University Press:  12 March 2014

A. H. Lachlan*
Affiliation:
Mathematics Department, Simon Fraser University, Burnaby, British Columbia V5A IS6, Canada

Abstract

Our purpose in this note is to study countable ℵ0-categorical structures whose theories are tree-decomposable in the sense of Baldwin and Shelah. The permutation group corresponding to such a structure can be decomposed in a canonical manner into simpler permutation groups in the same class. As an application of the analysis we show that these structures are finitely homogeneous.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1992

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