{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AEOZRBLI5HCWFONPOGUQ7Y6MR7","short_pith_number":"pith:AEOZRBLI","schema_version":"1.0","canonical_sha256":"011d988568e9c562b9af71a90fe3cc8fc59b234d0dc2fcb9bcd078883f9e5b74","source":{"kind":"arxiv","id":"1804.06130","version":1},"attestation_state":"computed","paper":{"title":"Ruitenburg's Theorem via Duality and Bounded Bisimulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Luigi Santocanale (LIS), Silvio Ghilardi","submitted_at":"2018-04-17T09:38:43Z","abstract_excerpt":"For a given intuitionistic propositional formula A and a propositional variable x occurring in it, define the infinite sequence of formulae { A \\_i | i$\\ge$1} by letting A\\_1 be A and A\\_{i+1} be A(A\\_i/x). Ruitenburg's Theorem [8] says that the sequence { A \\_i } (modulo logical equivalence) is ultimately periodic with period 2, i.e. there is N $\\ge$ 0 such that A N+2 $\\leftrightarrow$ A N is provable in intuitionistic propositional calculus. We give a semantic proof of this theorem, using duality techniques and bounded bisimulations ranks."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1804.06130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-04-17T09:38:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"7e940ac02854f1deeba9782a77f3e646b02d4af4520a05d42a3bc252be3ce780","abstract_canon_sha256":"9d4c0c15a2e52c6c8d27d5a3dd53de6a0227b6186d4f8253dcbce66dab68fe33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.622455Z","signature_b64":"YxqM/JYWzaQjd6Lu1DNGp4L3ZxbynFKreOmm+lkCR8RVh2dgom8bWWTkYUg6Hw+FlVHXEBICYZB/kwJICOyCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"011d988568e9c562b9af71a90fe3cc8fc59b234d0dc2fcb9bcd078883f9e5b74","last_reissued_at":"2026-05-18T00:18:21.621777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.621777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ruitenburg's Theorem via Duality and Bounded Bisimulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Luigi Santocanale (LIS), Silvio Ghilardi","submitted_at":"2018-04-17T09:38:43Z","abstract_excerpt":"For a given intuitionistic propositional formula A and a propositional variable x occurring in it, define the infinite sequence of formulae { A \\_i | i$\\ge$1} by letting A\\_1 be A and A\\_{i+1} be A(A\\_i/x). Ruitenburg's Theorem [8] says that the sequence { A \\_i } (modulo logical equivalence) is ultimately periodic with period 2, i.e. there is N $\\ge$ 0 such that A N+2 $\\leftrightarrow$ A N is provable in intuitionistic propositional calculus. We give a semantic proof of this theorem, using duality techniques and bounded bisimulations ranks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06130","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.06130","created_at":"2026-05-18T00:18:21.621862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06130v1","created_at":"2026-05-18T00:18:21.621862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06130","created_at":"2026-05-18T00:18:21.621862+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEOZRBLI5HCW","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEOZRBLI5HCWFONP","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEOZRBLI","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AEOZRBLI5HCWFONPOGUQ7Y6MR7","json":"https://pith.science/pith/AEOZRBLI5HCWFONPOGUQ7Y6MR7.json","graph_json":"https://pith.science/api/pith-number/AEOZRBLI5HCWFONPOGUQ7Y6MR7/graph.json","events_json":"https://pith.science/api/pith-number/AEOZRBLI5HCWFONPOGUQ7Y6MR7/events.json","paper":"https://pith.science/paper/AEOZRBLI"},"agent_actions":{"view_html":"https://pith.science/pith/AEOZRBLI5HCWFONPOGUQ7Y6MR7","download_json":"https://pith.science/pith/AEOZRBLI5HCWFONPOGUQ7Y6MR7.json","view_paper":"https://pith.science/paper/AEOZRBLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06130&json=true","fetch_graph":"https://pith.science/api/pith-number/AEOZRBLI5HCWFONPOGUQ7Y6MR7/graph.json","fetch_events":"https://pith.science/api/pith-number/AEOZRBLI5HCWFONPOGUQ7Y6MR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEOZRBLI5HCWFONPOGUQ7Y6MR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEOZRBLI5HCWFONPOGUQ7Y6MR7/action/storage_attestation","attest_author":"https://pith.science/pith/AEOZRBLI5HCWFONPOGUQ7Y6MR7/action/author_attestation","sign_citation":"https://pith.science/pith/AEOZRBLI5HCWFONPOGUQ7Y6MR7/action/citation_signature","submit_replication":"https://pith.science/pith/AEOZRBLI5HCWFONPOGUQ7Y6MR7/action/replication_record"}},"created_at":"2026-05-18T00:18:21.621862+00:00","updated_at":"2026-05-18T00:18:21.621862+00:00"}