Undefinability and Absolute Undefinability in Arithmetic
Logic
2023-04-17 v2
Abstract
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.
Cite
@article{arxiv.2205.06022,
title = {Undefinability and Absolute Undefinability in Arithmetic},
author = {Roman Kossak},
journal= {arXiv preprint arXiv:2205.06022},
year = {2023}
}