ℵ0-categorical tree-decomposable structures

Journal of Symbolic Logic 57 (2):501 - 514 (1992)
  Copy   BIBTEX

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,497

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
80 (#258,662)

6 months
11 (#320,308)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Classification of -Categorical Monadically Stable Structures.Bertalan Bodor - 2024 - Journal of Symbolic Logic 89 (2):460-495.

Add more citations

References found in this work

Second-order quantifiers and the complexity of theories.J. T. Baldwin & S. Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):229-303.

Add more references