...
首页> 外文期刊>Algebra and logic >Definability of closure operations in the h-quasiorder of labeled forests
【24h】

Definability of closure operations in the h-quasiorder of labeled forests

机译:h-准森林中封闭森林的可定义性

获取原文
获取原文并翻译 | 示例
           

摘要

We prove that natural closure operations on quotient structures of the h-quasiorder of finite and (at most) countable k-labeled forests (k ≥ 3) are definable provided that minimal nonsmallest elements are allowed as parameters. This strengthens our previous result which holds that each element of the h-quasiorder of finite k-labeled forests is definable in the first-order language, and each element of the h-quasiorder of (at most) countable k-labeled forests is definable in the language L_(ω1ω); in both cases k ≥ 3 and minimal nonsmallest elements are allowed as parameters. Similar results hold true for two other relevant structures: the h-quasiorder of finite (resp. countable) k-labeled trees and k-labeled trees with a fixed label on the root element.
机译:我们证明,只要允许最小的最小元素作为参数,就可以对有限和(最多)可数k标记森林(k≥3)的h拟阶的商结构进行自然封闭操作。这增强了我们先前的结果,即先前的结果认为有限k标记森林的h拟阶的每个元素都可以用一阶语言定义,而(最多)可数k标记森林的h拟阶的每个元素都可以定义用语言L_(ω1ω);在这两种情况下,都允许k≥3和最小非最小元素作为参数。类似的结果适用于其他两个相关结构:有限(可数)k标记树的h-拟序和在根元素上具有固定标签的k标记树。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号