首页> 外文期刊>Mathematical logic quarterly: MLQ >Substructure lattices and almost minimal end extensions of models of Peano arithmetic
【24h】

Substructure lattices and almost minimal end extensions of models of Peano arithmetic

机译:Peano算法模型的子结构格和几乎最小的端扩展

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

摘要

This paper concerns intermediate structure lattices Lt(N/M), where N is an almost minimal elementary end extension of the model M of Peano Arithmetic. For the purposes of this abstract only, let us say that M attains L if L approx= Lt(N/M) for some almost minimal elementary end extension of N. If T is a completion of PA and L is a finite lattice, then: (A) If some model of T attains L, then every countable model of T does.(B) If some rather classless, N_1-saturated model of T attains L, then every model of T does.
机译:本文涉及中间结构晶格Lt(N / M),其中N是Peano算法的模型M的几乎最小基本端扩展。仅出于此摘要的目的,我们可以说,对于N的一些几乎最小的基本端扩展,如果Lrox = Lt(N / M),则M达到L。如果T是PA的完成,而L是有限晶格,则:(A)如果某个T模型达到L,则每个T的可数模型都达到(B)如果某个无类,N_1饱和的T模型达到L,则每个T模型都达到L.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号