首页> 外文会议>Computer Science Logic; Lecture Notes in Computer Science; 4207 >Decidable Theories of the Ordering of Natural Numbers with Unary Predicates: Dedicated to Boris A. Trakhtenbrot on the occasion of his 85th birthday
【24h】

Decidable Theories of the Ordering of Natural Numbers with Unary Predicates: Dedicated to Boris A. Trakhtenbrot on the occasion of his 85th birthday

机译:具有一元谓词的自然数排序的可判定理论:献给Boris A. Trakhtenbrot诞辰85周年

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

摘要

Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order logic. Building on the model-theoretic composition method of Shelah, we give two characterizations of the decidable theories of this form, in terms of effectiveness conditions on two types of "homogeneous sets". We discuss the significance of these characterizations, show that the first-order theory of successor with extra predicates is not covered by this approach, and indicate how analogous results are obtained in the semigroup theoretic and the automata theoretic framework.
机译:一元谓词对自然数序的扩展进行了研究,使用了表达能力位于一阶和单子二阶逻辑之间的逻辑。建立在Shelah的模型理论组合方法的基础上,我们针对两种类型的“齐次集”的有效性条件,给出了这种形式的可判定理论的两个特征。我们讨论了这些表征的意义,表明带有额外谓词的后继一阶理论未被该方法覆盖,并指出了在半群理论和自动机理论框架中如何获得相似的结果。

著录项

相似文献

  • 外文文献
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号