首页> 外文期刊>Journal of logic and computation >Definability in Rationals with Real Order in the Background
【24h】

Definability in Rationals with Real Order in the Background

机译:后台具有真实顺序的Rationals中的可定义性

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

摘要

The paper deals with logically definable families of sets (or point-sets) of rational numbers. In particular we are interested whether the families over the real line with a unary predicate for the rationals are definable over the rational order alone. Let φ(X,Y) and ψ (Y) range over formulas in the first-order monadic language of order. Let Q be the set of rationals and F be the family of subsets J of Q such that φ (Q, J) holds over the real line. The Question arises whether, for every φ, F can be defined by means of an appropriate ψ(Y) interpreted over the rational Order.
机译:本文涉及有理数的逻辑定义的集合集(或点集)。尤其是,我们感兴趣的是,具有真实一元谓词的实线上的家庭是否可以仅根据理性顺序来定义。令φ(X,Y)和ψ(Y)覆盖一阶一阶单子语言中的公式。设Q为有理集,F为Q的子集J的族,使得φ(Q,J)保持在实线上。问题是,对于每个φ,是否都可以通过在有理阶数上解释的适当ψ(Y)来定义。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号