2022/05/12 by Roman Kossak, Kossak, Roman
Computer Science · Mathematics · #03C62 #03H15 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis
paper · pdf · doi:10.48550/arxiv.2205.06022
openalex publication_date 2022/05/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.