The Poset Of Copies For Automorphism Groups Of Countable Relational Structures

JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING(2021)

引用 0|浏览9
暂无评分
摘要
Let G be a subgroup of the symmetric group S(U) of all permutations of a countable set U. Let (G) over bar be the topological closure of G in the function topology on U-U. We initiate the study of the poset (G) over bar [U] := {f [U] | f is an element of (G) over bar} of images of the functions in (G) over bar, being ordered under inclusion. This set (G) over bar [U] of subsets of the set U will be called the poset of copies for the group G. A denomination being justified by the fact that for every subgroup G of the symmetric group S(U) there exists a homogeneous relational structure R on U such that (G) over bar is the set of embeddings of the homogeneous structure R into itself and (G) over bar [U] is the set of copies of R in R and that the set of bijections (G) over bar boolean AND S(U) of U to U forms the group of automorphisms of R.
更多
查看译文
关键词
Homogeneous relational structures, automorphism groups, homogeneity, posets
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要