Tanaka's theorem revisited (Q2204369)

From MaRDI portal
Revision as of 20:51, 23 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Tanaka's theorem revisited
scientific article

    Statements

    Tanaka's theorem revisited (English)
    0 references
    0 references
    15 October 2020
    0 references
    \textit{K. Tanaka} [Ann. Pure Appl. Logic 84, No. 1, 41--49 (1997; Zbl 0871.03044)] showed that every nonstandard countable model of \(\mathsf{WKL}_0\) is isomorphic to a proper initial segment of itself. In [Ann. Pure Appl. Logic 169, No. 6, 487--513 (2018; Zbl 1483.03031)], the author and \textit{A. Enayat} studied fixed point sets of self-embeddings of models of \(I\Sigma_1\). Bahrami combines some results from that paper with the strategy that \textit{A. Enayat} used in [CSLI Lect. Notes 211, 93--102 (2013; Zbl 1432.03135)] to give a new proof of Tanaka's theorem to obtain the following two results. Let \((M,A)\) be a countable model of \(\mathsf{WKL}_0\) and let \(I\) be a proper cut of \(M\). Then there is a self-embedding \(j\) of \((M,A)\) onto a proper initial segment of itself such that \(I\) is the longest initial segment of fixed points of \(j\) if and only if \(I\) is closed under exponentiation; and there is a self-embedding \(j\) of \((M,A)\) onto a proper initial segment of itself such that \(I\) is the set of fixed points of \(j\) if and only if \(I\) is a strong cut and is a \(\Sigma_1\)-elementary submodel of \(M\). The paper is very clearly written. It includes a comprehensive summary of previous results and all preliminary material.
    0 references
    Peano arithmetic
    0 references
    \(\text{WKL}_0\)
    0 references
    nonstandard model
    0 references
    self-embedding
    0 references
    fixed point
    0 references
    strong cut
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references