{"paper":{"title":"Cut-Elimination for the Bimodal Logic GR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A hypersequent calculus for the bimodal logic GR admits cut-elimination.","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hirohiko Kushida","submitted_at":"2026-05-15T08:35:38Z","abstract_excerpt":"In this paper, we present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Goedel and Rosser, respectively. We prove the cut-elimination theorem for the calculus."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Gödel and Rosser, respectively. We prove the cut-elimination theorem for the calculus.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The specific hypersequent rules correctly capture the axioms and semantics of the bimodal logic GR without introducing extraneous theorems or failing to derive the intended provability statements.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A hypersequent calculus for bimodal logic GR is presented and proven to satisfy cut-elimination.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A hypersequent calculus for the bimodal logic GR admits cut-elimination.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"5bce2ed40f3ed1df7efc0a834af49e24b1d5e8a07e061a565615a19f1d3a497c"},"source":{"id":"2605.15732","kind":"arxiv","version":1},"verdict":{"id":"74b6fa9c-2847-4ff3-b34f-032fc412131b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:03:59.400725Z","strongest_claim":"We present a hypersequent calculus for bimodal logic GR, where the two modalities represent the arithmetic provability predicates of Gödel and Rosser, respectively. We prove the cut-elimination theorem for the calculus.","one_line_summary":"A hypersequent calculus for bimodal logic GR is presented and proven to satisfy cut-elimination.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The specific hypersequent rules correctly capture the axioms and semantics of the bimodal logic GR without introducing extraneous theorems or failing to derive the intended provability statements.","pith_extraction_headline":"A hypersequent calculus for the bimodal logic GR admits cut-elimination."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15732/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:25.144185Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:19.114837Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:12:36.438583Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.991423Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"34aae8575bfef54ba8d11e07bce44afb0edaccfaaf699331fdb9a66b62293bb5"},"references":{"count":18,"sample":[{"doi":"","year":2002,"title":"S.N. Artemov and L.D. Beklemishev, PROVABILITY LOGIC, Handbook of Philosophical Logic, D. Gabbay and F. Guenthner (eds.), Volume 10, pp. 189-360, 2002, Kluwer Academic Publishers","work_id":"5c40e7e2-122a-4c18-af4d-051d70fc0e66","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1993,"title":"Boolos,The Logic of Provability, Cambridge University Press, 1993","work_id":"50ef34fd-d2cf-4efa-8cc2-efee36370545","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Buss, An Introduction to Proof Theory.Handbook of Proof Theory, Elsevier Science, pp","work_id":"9aa91f18-2fda-4935-8de5-78dfb1142058","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1979,"title":"D. Guaspari, and R. M. Solovay, Rosser sentences,Annals of Mathematical Logic, vol. 16 (1979), pp. 81-99","work_id":"7d87e2cb-77d3-4ed1-ae99-03c837b63976","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1017/s1755020325000036","year":2025,"title":"R. Kashima, T. Kurahashi, S. Iwata, and S. Morioka, Cut-free Sequent Calculi for the Provability Logic D,The Review of Symbolic Logic.Published online 2025:1-22. doi:10.1017/S1755020325000036 42","work_id":"eb9c0bcc-a141-4182-bfe8-1edb6a0545b3","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":18,"snapshot_sha256":"f15788c5e3cddd187e0cb62620ec269ae92ae6468ce73bd0b9c7a69aa4e85ba4","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"2af29840b7f303fca88d8058164389de17529b5c17d8ff49e4a888d23c8cd21c"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}