{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:40:03Z","timestamp":1706650803103},"reference-count":7,"publisher":"Duke University Press","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[1997,7,1]]},"DOI":"10.1305\/ndjfl\/1039700743","type":"journal-article","created":{"date-parts":[[2003,2,25]],"date-time":"2003-02-25T20:59:46Z","timestamp":1046206786000},"source":"Crossref","is-referenced-by-count":1,"title":["Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction"],"prefix":"10.1215","volume":"38","author":[{"given":"Osamu","family":"Takaki","sequence":"first","affiliation":[]}],"member":"73","reference":[{"key":"1","unstructured":"Girard, J. Y., <i>Proof Theory and Logical Complexity<\/i>, Bibliopolis, Napoli, 1982. Zbl 0635.03052 MR 89a:03113"},{"key":"2","doi-asserted-by":"crossref","unstructured":"Troelstra, A. S., <i>Metamathematical Investigation of Intuitionistic Arithmetic and Analysis<\/i>, <i>Lecture Notes in Mathematics<\/i>, vol. 344, Springer-Verlag, New York, 1973. Zbl 0275.02025 MR 48:3699","DOI":"10.1007\/BFb0066739"},{"key":"#cr-split#-3.1","unstructured":"Yasugi, M., \"Hyper-principle and the functional structure of ordinal diagrams,\" <i>Comment. Math. Univ. st. Pauli,<\/i> vol. 34 (1985), pp. 227-63"},{"key":"#cr-split#-3.2","doi-asserted-by":"crossref","unstructured":"vol. 35 (1986), pp. 1-37. Zbl 0633.03052","DOI":"10.3838\/jjo.35.37"},{"key":"4","doi-asserted-by":"crossref","unstructured":"Yasugi, M., \u201cThe machinery of consistency proofs,\u201d <i>Annals of Pure and Applied Logic<\/i>, vol. 44 (1989), pp. 139\u201352. Zbl 0679.03023 MR 91f:03116","DOI":"10.1016\/0168-0072(89)90050-X"},{"key":"5","doi-asserted-by":"crossref","unstructured":"Yasugi, M., and S. Hayashi, \u201cA functional system with transfinitely defined types,\u201d pp. 31\u201360 in <i>Lecture Notes in Computer Science<\/i>, vol. 792, Springer-Verlag, New York, 1994. MR 96d:03075","DOI":"10.1007\/BFb0032393"},{"key":"6","unstructured":"Yasugi, M., and S. Hayashi, \u201cInterpretations of transfinite recursion and parametric abstraction in types,\u201d pp. 452\u201364 in <i>Words, Languages and Combinatorics 2<\/i>, World Scientific, Kyoto, 1994. Zbl 0874.03069 MR 96k:03131"}],"container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1039700743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:13:07Z","timestamp":1706649187000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-38\/issue-3\/Strong-Normalization-Theorem-for-a-Constructive-Arithmetic-with-Definition-by\/10.1305\/ndjfl\/1039700743.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7,1]]},"references-count":7,"journal-issue":{"issue":"3","published-online":{"date-parts":[[1997,7,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1039700743","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7,1]]}}}