{"title":"何亭算术的解读——用集合符号的语言分析","authors":"Martin Stein","doi":"10.1016/0003-4843(80)90018-2","DOIUrl":null,"url":null,"abstract":"<div><p>Well-known interpretations of Heyting's arithmetic of all finite types are the Diller-Nahm λ-interpretation [1] and Kreisel's modified realizability, subsequently called mr-interpretation [4]. For both interpretations one can define hybrids λ q resp. mq.</p><p>In Section 4 a chain of interpretations—called <strong>M</strong>-interpretations—is defined (it was introduced in [6], filling the “gap” between λ-interpretation and mr-interpretation.</p><p>In this paper it is shwon that it is possible to prove <em>in one stroke</em> the soundness resp. characterization theorems for <em>all</em> interpretations of HA<sub>ω 〈〉</sub> (Heyting's arithmetic of all finite types with functionals for coding finite sequences). This is done by means of interpretations of systems which contain set-symbols. For these so called <em>M</em>-interpretations, soundness-resp. characterization theorems can be proved simultaneously (Theorem 2.51. Special translations of set symbols and of the formula (<em>λωϵW</em>)<em>A</em> — this means, special decisions about the size of the set <em>W</em>; see Sections 3 and 4 — yield the corresponding results for all interpretations of HA<sub>ω〈〉</sub> mentioned.</p><p>The terminology of set theoretical language — we consider an extension of HA<sub>ω〈〉</sub> by an extensively weak fragment only, which leads to a conservative extension of HA<sub>ω〈〉</sub> — is of good use for studying realizing terms of different interpretations: if HA<sub><em>ω</em></sub><>⊢<em>A</em>, <em>A</em><sup><em>M</em></sup>∃<em>υ</em> ∀<em>w</em> <em>A</em><sub><em>M</em></sub>, and ⊢<em>A</em><sub><em>M</em></sub>[<em>t</em><sub><em>M</em></sub>, <em>w</em>] by soundness theorem for <em>M</em>-interpretations, there exists a simple operation which maps <span><math><mtext>v</mtext><mtext>̄</mtext><mtext> </mtext><mtext>to</mtext><mtext> </mtext><mtext>t</mtext><mtext>̄</mtext><msub><mi></mi><mn><mtext>mr</mtext></mn></msub></math></span>, the realizing term for modified realizability. For interpretations of Heyting's arithmetic — λ-interpretation. <strong>M</strong>-interpretations and mr-interpretation — this leads to the following stability result for existence theorems: if <span><math><mtext>∃λ A </mtext><mtext>and</mtext><mtext> t</mtext><msub><mi></mi><mn>^</mn></msub><mtext> </mtext><mtext>resp.</mtext><mtext> t</mtext><msub><mi></mi><mn><mtext>M</mtext><mtext>M</mtext></mn></msub></math></span> is the term computed by λ-interpretation. resp. <strong>M</strong>-interpretation, with <span><math><mtext>∃A[t</mtext><msub><mi></mi><mn><mtext>M</mtext></mn></msub><mtext>]</mtext></math></span>, then — using extensional equality and ω-rule for equations — we can prove that <span><math><mtext>t</mtext><msub><mi></mi><mn>λ</mn></msub><mtext> = t</mtext><msub><mi></mi><mn><mtext>M</mtext></mn></msub><mtext> = t</mtext><msub><mi></mi><mn><mtext>mr</mtext></mn></msub></math></span> (Section 5).</p></div>","PeriodicalId":100093,"journal":{"name":"Annals of Mathematical Logic","volume":"19 1","pages":"Pages 1-31"},"PeriodicalIF":0.0000,"publicationDate":"1980-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0003-4843(80)90018-2","citationCount":"11","resultStr":"{\"title\":\"Interpretations of Heyting's arithmetic—An analysis by means of a language with set symbols\",\"authors\":\"Martin Stein\",\"doi\":\"10.1016/0003-4843(80)90018-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Well-known interpretations of Heyting's arithmetic of all finite types are the Diller-Nahm λ-interpretation [1] and Kreisel's modified realizability, subsequently called mr-interpretation [4]. For both interpretations one can define hybrids λ q resp. mq.</p><p>In Section 4 a chain of interpretations—called <strong>M</strong>-interpretations—is defined (it was introduced in [6], filling the “gap” between λ-interpretation and mr-interpretation.</p><p>In this paper it is shwon that it is possible to prove <em>in one stroke</em> the soundness resp. characterization theorems for <em>all</em> interpretations of HA<sub>ω 〈〉</sub> (Heyting's arithmetic of all finite types with functionals for coding finite sequences). This is done by means of interpretations of systems which contain set-symbols. For these so called <em>M</em>-interpretations, soundness-resp. characterization theorems can be proved simultaneously (Theorem 2.51. Special translations of set symbols and of the formula (<em>λωϵW</em>)<em>A</em> — this means, special decisions about the size of the set <em>W</em>; see Sections 3 and 4 — yield the corresponding results for all interpretations of HA<sub>ω〈〉</sub> mentioned.</p><p>The terminology of set theoretical language — we consider an extension of HA<sub>ω〈〉</sub> by an extensively weak fragment only, which leads to a conservative extension of HA<sub>ω〈〉</sub> — is of good use for studying realizing terms of different interpretations: if HA<sub><em>ω</em></sub><>⊢<em>A</em>, <em>A</em><sup><em>M</em></sup>∃<em>υ</em> ∀<em>w</em> <em>A</em><sub><em>M</em></sub>, and ⊢<em>A</em><sub><em>M</em></sub>[<em>t</em><sub><em>M</em></sub>, <em>w</em>] by soundness theorem for <em>M</em>-interpretations, there exists a simple operation which maps <span><math><mtext>v</mtext><mtext>̄</mtext><mtext> </mtext><mtext>to</mtext><mtext> </mtext><mtext>t</mtext><mtext>̄</mtext><msub><mi></mi><mn><mtext>mr</mtext></mn></msub></math></span>, the realizing term for modified realizability. For interpretations of Heyting's arithmetic — λ-interpretation. <strong>M</strong>-interpretations and mr-interpretation — this leads to the following stability result for existence theorems: if <span><math><mtext>∃λ A </mtext><mtext>and</mtext><mtext> t</mtext><msub><mi></mi><mn>^</mn></msub><mtext> </mtext><mtext>resp.</mtext><mtext> t</mtext><msub><mi></mi><mn><mtext>M</mtext><mtext>M</mtext></mn></msub></math></span> is the term computed by λ-interpretation. resp. <strong>M</strong>-interpretation, with <span><math><mtext>∃A[t</mtext><msub><mi></mi><mn><mtext>M</mtext></mn></msub><mtext>]</mtext></math></span>, then — using extensional equality and ω-rule for equations — we can prove that <span><math><mtext>t</mtext><msub><mi></mi><mn>λ</mn></msub><mtext> = t</mtext><msub><mi></mi><mn><mtext>M</mtext></mn></msub><mtext> = t</mtext><msub><mi></mi><mn><mtext>mr</mtext></mn></msub></math></span> (Section 5).</p></div>\",\"PeriodicalId\":100093,\"journal\":{\"name\":\"Annals of Mathematical Logic\",\"volume\":\"19 1\",\"pages\":\"Pages 1-31\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1980-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0003-4843(80)90018-2\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Mathematical Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0003484380900182\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Mathematical Logic","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0003484380900182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Interpretations of Heyting's arithmetic—An analysis by means of a language with set symbols
Well-known interpretations of Heyting's arithmetic of all finite types are the Diller-Nahm λ-interpretation [1] and Kreisel's modified realizability, subsequently called mr-interpretation [4]. For both interpretations one can define hybrids λ q resp. mq.
In Section 4 a chain of interpretations—called M-interpretations—is defined (it was introduced in [6], filling the “gap” between λ-interpretation and mr-interpretation.
In this paper it is shwon that it is possible to prove in one stroke the soundness resp. characterization theorems for all interpretations of HAω 〈〉 (Heyting's arithmetic of all finite types with functionals for coding finite sequences). This is done by means of interpretations of systems which contain set-symbols. For these so called M-interpretations, soundness-resp. characterization theorems can be proved simultaneously (Theorem 2.51. Special translations of set symbols and of the formula (λωϵW)A — this means, special decisions about the size of the set W; see Sections 3 and 4 — yield the corresponding results for all interpretations of HAω〈〉 mentioned.
The terminology of set theoretical language — we consider an extension of HAω〈〉 by an extensively weak fragment only, which leads to a conservative extension of HAω〈〉 — is of good use for studying realizing terms of different interpretations: if HAω<>⊢A, AM∃υ ∀wAM, and ⊢AM[tM, w] by soundness theorem for M-interpretations, there exists a simple operation which maps , the realizing term for modified realizability. For interpretations of Heyting's arithmetic — λ-interpretation. M-interpretations and mr-interpretation — this leads to the following stability result for existence theorems: if is the term computed by λ-interpretation. resp. M-interpretation, with , then — using extensional equality and ω-rule for equations — we can prove that (Section 5).