Decoding in the automorphism group of a model of arithmetic.
Penn State Mont Alto
In the talk I will discuss results on recovering a countable recursively saturated model of Peano Arithmetic from its automorphism group.
Ermek Nurkhaidarov’s research focus is mathematical logic. In particular, he is interested in studying models of arithmetic.