Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 527

Preprint Number 527

Previous Next Preprint server

527. Cameron Donnay Hill
The Geometry of L^k-Canonization I: Rosiness from Efficient Constructibility

Submission date: 30 October 2012.


We demonstrate that for the k-variable theory T of a finite structure (satisfying certain amalgamation conditions), if finite models of T can be recovered from diagrams of finite {\em subsets} of model of T in a certain “efficient” way, then T is rosy -- in fact, a certain natural \aleph_0-categorical completion T^{lim} of T is super-rosy of finite U^\thorn-rank. In an appendix, we also show that any k-variable theory T of a finite structure for which the Strong L^k-Canonization Problem is efficient soluble has the necessary amalgamation properties up to taking an appropriate reduct.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 1210.7882: pdf, ps.

Last updated: November 1 2012 10:19 Please send your corrections to: