{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GDNGJ65PAI37D7KVYZTEWAAMKS","short_pith_number":"pith:GDNGJ65P","schema_version":"1.0","canonical_sha256":"30da64fbaf0237f1fd55c6664b000c54a60528e36f621a99f167ccdf4de97e8a","source":{"kind":"arxiv","id":"1803.09709","version":3},"attestation_state":"computed","paper":{"title":"A many-sorted polyadic modal logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ioana Leustean, Natalia Moanga, Traian Florin Serbanuta","submitted_at":"2018-03-26T16:46:41Z","abstract_excerpt":"This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue of the J\\'onsson-Tarski theorem. While the transition from the mono-sorted logic to many-sorted one is a smooth process, we see our system as a step towards deepening the connection between modal logic and program verification, since our system can be seen as the propositional fragment of Matching logic, a first-order logic for specifying and reasoning about"},"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":"1803.09709","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-03-26T16:46:41Z","cross_cats_sorted":[],"title_canon_sha256":"e0d7faa0143e26e9bf4cc50e83724fe7c690e3d981f3bed92c4b746d3e9ab3c1","abstract_canon_sha256":"233756fe4b42469d5914779c63ad2e63fc7eb373da0465b37a1de10f2e05ecd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:32.909197Z","signature_b64":"I5efMZxRTQPBsgNTNfnFShzv0AmWjhlXeitGssYEDNxumyO0vNX72Z1SQnHNZwUUHMft/zpHCde+Dx+cYk8aDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30da64fbaf0237f1fd55c6664b000c54a60528e36f621a99f167ccdf4de97e8a","last_reissued_at":"2026-05-17T23:59:32.908565Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:32.908565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A many-sorted polyadic modal logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ioana Leustean, Natalia Moanga, Traian Florin Serbanuta","submitted_at":"2018-03-26T16:46:41Z","abstract_excerpt":"This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue of the J\\'onsson-Tarski theorem. While the transition from the mono-sorted logic to many-sorted one is a smooth process, we see our system as a step towards deepening the connection between modal logic and program verification, since our system can be seen as the propositional fragment of Matching logic, a first-order logic for specifying and reasoning about"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09709","kind":"arxiv","version":3},"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":"1803.09709","created_at":"2026-05-17T23:59:32.908660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09709v3","created_at":"2026-05-17T23:59:32.908660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09709","created_at":"2026-05-17T23:59:32.908660+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDNGJ65PAI37","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDNGJ65PAI37D7KV","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDNGJ65P","created_at":"2026-05-18T12:32:25.280505+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/GDNGJ65PAI37D7KVYZTEWAAMKS","json":"https://pith.science/pith/GDNGJ65PAI37D7KVYZTEWAAMKS.json","graph_json":"https://pith.science/api/pith-number/GDNGJ65PAI37D7KVYZTEWAAMKS/graph.json","events_json":"https://pith.science/api/pith-number/GDNGJ65PAI37D7KVYZTEWAAMKS/events.json","paper":"https://pith.science/paper/GDNGJ65P"},"agent_actions":{"view_html":"https://pith.science/pith/GDNGJ65PAI37D7KVYZTEWAAMKS","download_json":"https://pith.science/pith/GDNGJ65PAI37D7KVYZTEWAAMKS.json","view_paper":"https://pith.science/paper/GDNGJ65P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09709&json=true","fetch_graph":"https://pith.science/api/pith-number/GDNGJ65PAI37D7KVYZTEWAAMKS/graph.json","fetch_events":"https://pith.science/api/pith-number/GDNGJ65PAI37D7KVYZTEWAAMKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDNGJ65PAI37D7KVYZTEWAAMKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDNGJ65PAI37D7KVYZTEWAAMKS/action/storage_attestation","attest_author":"https://pith.science/pith/GDNGJ65PAI37D7KVYZTEWAAMKS/action/author_attestation","sign_citation":"https://pith.science/pith/GDNGJ65PAI37D7KVYZTEWAAMKS/action/citation_signature","submit_replication":"https://pith.science/pith/GDNGJ65PAI37D7KVYZTEWAAMKS/action/replication_record"}},"created_at":"2026-05-17T23:59:32.908660+00:00","updated_at":"2026-05-17T23:59:32.908660+00:00"}