论文标题
连接嵌入三维排列类别的不可证明性
The undecidability of joint embedding for 3-dimensional permutation classes
论文作者
论文摘要
作为解决Ruškuc问题的一步,关于遗传性置换的联合嵌入性的可决定性,可以将其视为以2个线性订单的语言将其视为结构,我们表明,在3个线性订单的语言中,对遗传性的结构的相应问题是不可确定的。
As a step towards resolving a question of Ruškuc on the decidability of joint embedding for hereditary classes of permutations, which may be viewed as structures in a language of 2 linear orders, we show the corresponding problem is undecidable for hereditary classes of structures in a language of 3 linear orders.