Abstract
AbstractWe show, for any ordinalγ≥ 3, that the classℜaCAγis pseudo-elementary and has a recursively enumerable elementary theory. ScKdenotes the class of strong subalgebras of members of the classK. We devise games,Fn(3 ≤n≤ω),G, H, and show, for an atomic relation algebrawith countably many atoms, thatfor 3 ≤n<ω. We use these games to show, forγ> 5 and any classKof relation algebras satisfyingthatKis not closed under subalgebras and is not elementary. For infiniteγ, the inclusion ℜaCAγ⊂ScℜaCAγis strict.For infiniteγand for a countable relation algebrawe show thathas a complete representation if and only ifis atomic and ∃ has a winning strategy inF(At()) if and only ifis atomic and∈ScℜaCAγ.
Publisher
Cambridge University Press (CUP)
Reference19 articles.
1. Simon A. , Nonrepresentable algebras of relations, Ph.D. thesis, Mathematics Institute of the Hungarian Academy of Sciences, Budapest, 1997, http://www.renyi.hu/pub/algebraic-logic/simthes.html.
2. The class of neat reducts is not elementary;Ahmed;Logic Journal of the IGPL,2001
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献