{"created":"2025-02-21T01:41:47.385695+00:00","id":2005914,"links":{},"metadata":{"_buckets":{"deposit":"25975071-3d94-4c9c-9b54-9948fbc78f27"},"_deposit":{"created_by":41,"id":"2005914","owner":"41","owners":[41],"pid":{"revision_id":0,"type":"depid","value":"2005914"},"status":"published"},"_oai":{"id":"oai:hiroshima.repo.nii.ac.jp:02005914","sets":["1730444908512:1730444916333"]},"author_link":[],"item_1617186331708":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_title":"SUBRECURSIVE HIERARCHIES AND PROVABLY COMPUTABLE FUNCTIONS IN FORMAL THEORIES OF ARITHMETIC","subitem_title_language":"en"},{"subitem_title":"帰納的関数の部分階層と数論の形式理論での証明可能な計算可能関数","subitem_title_language":"ja"}]},"item_1617186419668":{"attribute_name":"Creator","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"角田, 法也","creatorNameLang":"ja"},{"creatorName":"Kadota, Noriya","creatorNameLang":"en"}],"familyNames":[{"familyName":"角田","familyNameLang":"ja"},{"familyName":"Kadota","familyNameLang":"en"}],"givenNames":[{"givenName":"法也","givenNameLang":"ja"},{"givenName":"Noriya","givenNameLang":"en"}]}]},"item_1617186476635":{"attribute_name":"Access Rights","attribute_value_mlt":[{"subitem_access_right":"open access","subitem_access_right_uri":"http://purl.org/coar/access_right/c_abf2"}]},"item_1617186499011":{"attribute_name":"Rights","attribute_value_mlt":[{"subitem_rights":"Copyright(c) by Author"}]},"item_1617186609386":{"attribute_name":"Subject","attribute_value_mlt":[{"subitem_subject":"410","subitem_subject_scheme":"NDC"}]},"item_1617186626617":{"attribute_name":"Description","attribute_value_mlt":[{"subitem_description":"CONTENTS  CHAPTER1 INTRODUCTION / p1  CHAPTER2 SUBRECURSIVE HIERARCHIES AND FORMAL THEORIES / p8  　2.1 Fast-growing hierarchy / p8  　2.2 Provable computability / p13  　2.3 Undecidable statements / p16  CHAPTER3 BUILT-UP SYSTEMS OF FUNDAMENTAL SEQUENCES / p19  　3.1 Growing hierarchies on (n)-built-up systems / p19  　3.2 Conditions on systems of fundamental sequences / p25  　3.3 Existence problems / p29  CHAPTER4 PROVABLY COMPUTABLE FUNCTIONS IN PEANO ARITHMETIC / p34  　4.1 Provable computability / p34  　4.2 Undecidable combinatorial statements / p40  　4.3 Relativized hierarchies / p44  CHAPTER5 THE FAST AND SLOW GROWING HIERARCHIES AND INDUCTIVE DEFINITIONS / p50  　5.1 Fast-growing versus slow-growing / p50  　5.2 The collapsing theorem and (3)-built-upness / p55  　5.3 Provable computability / p61  CHAPTER6 DISCUSSIONS / p69  　6.1 Undecidable statements in theories of arithmetic / p69  　6.2 Applications of subrecursive hierarchies / p71  ACKNOWLEDGMENTS / p75  REFERENCES / p76","subitem_description_type":"TableOfContents"}]},"item_1617186702042":{"attribute_name":"Language","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_1617186819068":{"attribute_name":"Identifier Registration","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.11501/3061400","subitem_identifier_reg_type":"JaLC"}]},"item_1617187024783":{"attribute_name":"Page Start","attribute_value_mlt":[{"subitem_start_page":"1"}]},"item_1617187056579":{"attribute_name":"Bibliographic Information","attribute_value_mlt":[{"bibliographicPageStart":"1"}]},"item_1617187087799":{"attribute_name":"Dissertation Number","attribute_value_mlt":[{"subitem_dissertationnumber":"乙第2254号"}]},"item_1617187112279":{"attribute_name":"Degree Name","attribute_value_mlt":[{"subitem_degreename":"博士(学術)","subitem_degreename_language":"ja"},{"subitem_degreename":"Science","subitem_degreename_language":"en"}]},"item_1617187136212":{"attribute_name":"Date Granted","attribute_value_mlt":[{"subitem_dategranted":"1992-03-16"}]},"item_1617258105262":{"attribute_name":"Resource Type","attribute_value_mlt":[{"resourcetype":"doctoral thesis","resourceuri":"http://purl.org/coar/resource_type/c_db06"}]},"item_1617265215918":{"attribute_name":"Version Type","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_be7fb7dd8ff6fe43","subitem_version_type":"NA"}]},"item_1617605131499":{"attribute_name":"File","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2023-03-18"}],"displaytype":"simple","filename":"diss_otsu2254.pdf","filesize":[{"value":"35.6 MB"}],"mimetype":"application/pdf","url":{"objectType":"fulltext","url":"https://hiroshima.repo.nii.ac.jp/record/2005914/files/diss_otsu2254.pdf"},"version_id":"2b9e13d0-22cf-480d-b40a-ea1bffa3b6d3"}]},"item_1617944105607":{"attribute_name":"Degree Grantor","attribute_value_mlt":[{"subitem_degreegrantor":[{"subitem_degreegrantor_language":"ja","subitem_degreegrantor_name":"広島大学"}],"subitem_degreegrantor_identifier":[{"subitem_degreegrantor_identifier_name":"15401","subitem_degreegrantor_identifier_scheme":"kakenhi"}]},{"subitem_degreegrantor":[{"subitem_degreegrantor_language":"en","subitem_degreegrantor_name":"Hiroshima University"}]}]},"item_1732771732025":{"attribute_name":"旧ID","attribute_value":"31814"},"item_title":"SUBRECURSIVE HIERARCHIES AND PROVABLY COMPUTABLE FUNCTIONS IN FORMAL THEORIES OF ARITHMETIC","item_type_id":"40003","owner":"41","path":["1730444916333"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2023-03-18"},"publish_date":"2023-03-18","publish_status":"0","recid":"2005914","relation_version_is_last":true,"title":["SUBRECURSIVE HIERARCHIES AND PROVABLY COMPUTABLE FUNCTIONS IN FORMAL THEORIES OF ARITHMETIC"],"weko_creator_id":"41","weko_shared_id":-1},"updated":"2025-02-21T01:42:04.812085+00:00"}