首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The Rationals have an AZ-Enumeration
Authors:Albert  Michael; Chowdhury  Ambar
Institution:Department of Mathematics and Statistics, University of Otago Dunedin, New Zealand malbert{at}maths.otago.ac.nz
Department of Mathematics, U-9, University of Connecticut Storrs, CT 06269, USA ambar{at}math.uconn.edu
Abstract:Let M be an {omega}-categorical structure (that is, M is countableand Th(M) is {omega}-categorical). A nice enumeration of M is a totalordering {precedes} of M having order-type {omega} and satisfying the following.Whenever ai, i<{omega}, is a sequence of elements from M, thereexist some i<j<{omega} and an automorphism {sigma} of M such that {sigma}(ai)= aj and whenever b{precedes}ai, then {sigma}(b){precedes}aj. Such enumerations were introduced by Ahlbrandt and Ziegler in1] where they showed that any Grassmannian of an infinite-dimensionalprojective space over a finite field (or of a disintegratedset) admits a nice enumeration; this combinatorial propertyplayed an essential role in their proof that almost stronglyminimal totally categorical structures are quasi-finitely axiomatisable. Recall that if M is {omega}-categorical and a is a k-tuple of distinctelements from M (with tp(a) non-algebraic), then the GrassmannianGr(M; a) is defined as follows. The domain of Gr(M; a) is theset of realisations of tp(a) in Mk, modulo the equivalence relationxEy if x and y are equal as sets. This is a 0-definable subsetof Meq, and now the relations on Gr(M; a) are by definition preciselythose which are 0-definable in the structure Meq. (In particular,Gr(M; a) is also {omega}-categorical.) Notice that it is by no means clear that if M admits a niceenumeration, then so do Grassmannians of M. However, there isa strengthening of the notion of nice enumeration for whichthis is the case.
Keywords:
本文献已被 Oxford 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号