{"created":"2023-05-15T11:44:23.345226+00:00","id":2673,"links":{},"metadata":{"_buckets":{"deposit":"045338fa-e1dc-4ea9-a276-3e28c050b777"},"_deposit":{"created_by":10,"id":"2673","owners":[10],"pid":{"revision_id":0,"type":"depid","value":"2673"},"status":"published"},"_oai":{"id":"oai:nuis.repo.nii.ac.jp:00002673","sets":["8:91:92"]},"author_link":["2956","2909"],"item_10002_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2018-04-01","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"32","bibliographicPageStart":"19","bibliographicVolumeNumber":"1","bibliographic_titles":[{"bibliographic_title":"新潟国際情報大学経営情報学部紀要"}]}]},"item_10002_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"In this paper we will show how to define a sequential machine by using PSC system with T as a finite set of pair-sentence formulas. A pair-sentence form (A0,B1) means that if we assume each stage number i specifies the delay time of the link operation between pair-sentences, then the pair-sentence form (Ai,Bi+1) shows (Ai,Ai+1) (where Ai+1 := Bi) that is the propagation of truth value of a sentence A at one delay time. So, we can define the one delay truth signal circuit by using a pair-sentence form. Moreover, to combine the plural pair-sentences in T, we can define Ms = <TVt, It,O, v0, σt,λt> as a sequential machine generated from T, where TVt a set of truth value products, It a set of input truth value products, O a set of output truth value products, σt : TVtii × Iti → TVti+1 a truth value transition function and λt : TVti × Iti → Oi a truth value output function.","subitem_description_type":"Abstract"}]},"item_10002_publisher_8":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"新潟国際情報大学経営情報学部"}]},"item_10002_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2434-2939","subitem_source_identifier_type":"ISSN"}]},"item_10002_version_type_20":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ishii, Tadao"},{"creatorName":"イシイ, タダオ","creatorNameLang":"ja-Kana"}],"nameIdentifiers":[{"nameIdentifier":"2909","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Ishii, Tadao","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"2956","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2018-07-09"}],"displaytype":"detail","filename":"kiyo_2018.03.02.pdf","filesize":[{"value":"740.6 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"kiyo_2018.03.02.pdf","url":"https://nuis.repo.nii.ac.jp/record/2673/files/kiyo_2018.03.02.pdf"},"version_id":"3254b113-991f-47e7-bbbf-e2d4bd07c082"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"SCI","subitem_subject_scheme":"Other"},{"subitem_subject":"Liar paradox","subitem_subject_scheme":"Other"},{"subitem_subject":"revision theory","subitem_subject_scheme":"Other"},{"subitem_subject":"sequential machine","subitem_subject_scheme":"Other"},{"subitem_subject":"3-valued Lukasiewicz logic.","subitem_subject_scheme":"Other"},{"subitem_subject":"SCI","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"Liar paradox","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"revision theory","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"sequential machine","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"3-valued Lukasiewicz logic.","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"The definition of sequential machine by PSC","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"The definition of sequential machine by PSC"},{"subitem_title":"The definition of sequential machine by PSC","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"10","path":["92"],"pubdate":{"attribute_name":"公開日","attribute_value":"2018-05-12"},"publish_date":"2018-05-12","publish_status":"0","recid":"2673","relation_version_is_last":true,"title":["The definition of sequential machine by PSC"],"weko_creator_id":"10","weko_shared_id":-1},"updated":"2023-05-15T12:22:02.061256+00:00"}