On highly equivalent non-isomorphic countable models of arithmetic and set theory
Logic
2022-08-30 v1
Abstract
It is well-known that the first order Peano axioms PA have a continuum of non-isomorphic countable models. The question, how close to being isomorphic such countable models can be, seems to be less investigated. A measure of closeness to isomorphism of countable models is the length of back-and-forth sequences that can be established between them. We show that for every countable ordinal alpha there are countable non-isomorphic models of PA with a back-and-forth sequence of length alpha between them. This implies that the Scott height (or rank) of such models is bigger than . We also prove the same result for models of ZFC.
Cite
@article{arxiv.2208.13052,
title = {On highly equivalent non-isomorphic countable models of arithmetic and set theory},
author = {Tapani Hyttinen and Jouko Väänänen},
journal= {arXiv preprint arXiv:2208.13052},
year = {2022}
}