论文标题

算术中的不确定性和绝对不确定性

Undefinability and Absolute Undefinability in Arithmetic

论文作者

Kossak, Roman

论文摘要

这是对算术模型中确定性和不可限性结果的调查。目的是在标准模型中呈现不确定性结果与非标准模型扩展的更强版本之间的明显差异。关键作用是通过计算Peano算术的可计数启发模型子集的自动形态图像的数量。

This is a survey of results on definability and undefinability in models of arithmetic. The goal is to present a stark difference between undefinability results in the standard model and much stronger versions about expansions of nonstandard models. The key role is played by counting the number of automorphic images of subsets of countable resplendent models of Peano Arithmetic.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源