首页 | 本学科首页   官方微博 | 高级检索  
     


Bounded Scott Set Saturation
Authors:Alex M. McAllister
Abstract:We examine the relationship between two different notions of a structure being Scott set saturated and identify sufficient conditions which guarantee that a structure is uniquely Scott set saturated. We also consider theories representing Scott sets; in particular, we identify a sufficient condition on a theory T so that for any given countable Scott set there exists a completion of T that is saturated with respect to the given Scott set. These results extend Scott's characterization of countable Scott sets via models and completions of Peano arithmetic.
Keywords:relative computability  Scott set saturation  bounded computable saturation  perfect theory  families of representable sets  bounded independence trees  bounded flexible sentences  Peano Arithmetic
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号