{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YEVWYHUQJ7OV7FET37NUMG33US","short_pith_number":"pith:YEVWYHUQ","schema_version":"1.0","canonical_sha256":"c12b6c1e904fdd5f9493dfdb461b7ba4aa6e750baabb0040890296cd237c032a","source":{"kind":"arxiv","id":"1603.06547","version":1},"attestation_state":"computed","paper":{"title":"Constructive canonicity for lattice-based fixed point logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alessandra Palmigiano, Andrew Craig, Willem Conradie, Zhiguang Zhao","submitted_at":"2016-03-21T19:24:10Z","abstract_excerpt":"We prove the algorithmic canonicity of two classes of $\\mu$-inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie and Craig's canonicity for $\\mu$-inequalities based on a bi-intuitionistic bi-modal language, and Conradie and Palmigiano's constructive canonicity for inductive inequalities (restricted to normal lattice expansions to keep the page limit). Besides the greater generality, the unification of these strands smoothes the existing treatments for the canonicity of $\\mu$-formulas and inequalities. In particular, the rules "},"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":"1603.06547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-03-21T19:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"580cce786b6f2e75a652eb28c51b6d3adee0a4baca268b4641fde0f8a7d9997d","abstract_canon_sha256":"2b6e7642f7a5c2109c756a5e0426bb7fd069ee2fcfda9bb60b6b0c1ee1c0b828"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:48.300955Z","signature_b64":"KKZraRvd7/OS6zqPIdfSZul+UBAfrKodjvMV8Rz+rLh/LShXutxdpv260wHAiYNi1DFcTYfHvv5HeqUiRKWjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c12b6c1e904fdd5f9493dfdb461b7ba4aa6e750baabb0040890296cd237c032a","last_reissued_at":"2026-05-18T01:18:48.300487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:48.300487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constructive canonicity for lattice-based fixed point logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alessandra Palmigiano, Andrew Craig, Willem Conradie, Zhiguang Zhao","submitted_at":"2016-03-21T19:24:10Z","abstract_excerpt":"We prove the algorithmic canonicity of two classes of $\\mu$-inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie and Craig's canonicity for $\\mu$-inequalities based on a bi-intuitionistic bi-modal language, and Conradie and Palmigiano's constructive canonicity for inductive inequalities (restricted to normal lattice expansions to keep the page limit). Besides the greater generality, the unification of these strands smoothes the existing treatments for the canonicity of $\\mu$-formulas and inequalities. In particular, the rules "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06547","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":"1603.06547","created_at":"2026-05-18T01:18:48.300558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06547v1","created_at":"2026-05-18T01:18:48.300558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06547","created_at":"2026-05-18T01:18:48.300558+00:00"},{"alias_kind":"pith_short_12","alias_value":"YEVWYHUQJ7OV","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YEVWYHUQJ7OV7FET","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YEVWYHUQ","created_at":"2026-05-18T12:30:53.716459+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/YEVWYHUQJ7OV7FET37NUMG33US","json":"https://pith.science/pith/YEVWYHUQJ7OV7FET37NUMG33US.json","graph_json":"https://pith.science/api/pith-number/YEVWYHUQJ7OV7FET37NUMG33US/graph.json","events_json":"https://pith.science/api/pith-number/YEVWYHUQJ7OV7FET37NUMG33US/events.json","paper":"https://pith.science/paper/YEVWYHUQ"},"agent_actions":{"view_html":"https://pith.science/pith/YEVWYHUQJ7OV7FET37NUMG33US","download_json":"https://pith.science/pith/YEVWYHUQJ7OV7FET37NUMG33US.json","view_paper":"https://pith.science/paper/YEVWYHUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06547&json=true","fetch_graph":"https://pith.science/api/pith-number/YEVWYHUQJ7OV7FET37NUMG33US/graph.json","fetch_events":"https://pith.science/api/pith-number/YEVWYHUQJ7OV7FET37NUMG33US/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YEVWYHUQJ7OV7FET37NUMG33US/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YEVWYHUQJ7OV7FET37NUMG33US/action/storage_attestation","attest_author":"https://pith.science/pith/YEVWYHUQJ7OV7FET37NUMG33US/action/author_attestation","sign_citation":"https://pith.science/pith/YEVWYHUQJ7OV7FET37NUMG33US/action/citation_signature","submit_replication":"https://pith.science/pith/YEVWYHUQJ7OV7FET37NUMG33US/action/replication_record"}},"created_at":"2026-05-18T01:18:48.300558+00:00","updated_at":"2026-05-18T01:18:48.300558+00:00"}