arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.4067math.LO
收藏

关于非紧逻辑的一个注记

A note on noncompact logics

Vera Koponen

摘要:

给出了一个条件,如果性质P满足这个条件,则任何至少与一阶逻辑一样强且能表示P的逻辑都不具有紧性.利用这一结果证明了:对于若干关于自同构群的自然性质P,任何至少与一阶逻辑一样强并能表示P的逻辑都不具有紧性.这里给出的结果和例子的基本思想是,利用随机图论的结果,可以构造一个可数的一阶理论T,使得T的每个模型都有一个非常丰富的自同构群,但是T的每个有限子集都有一个刚性的模型。

英文摘要:

A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to prove that for a number of natural properties P speaking about automorphism groups, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The basic idea underlying the results and examples presented here is that, using results from random graph theory, it is possible to construct a countable first-order theory T such that every model of T has a very rich automorphism group, but every finite subset of T has a model which is rigid.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑