{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MA2U5IV5LG73KTN6O6SMV4EMBH","short_pith_number":"pith:MA2U5IV5","schema_version":"1.0","canonical_sha256":"60354ea2bd59bfb54dbe77a4caf08c09d1fb78c1866a75017be8f5be4b5b7689","source":{"kind":"arxiv","id":"1206.1936","version":1},"attestation_state":"computed","paper":{"title":"Completeness for Two Left-Sequential Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"D.J.C. Staudt","submitted_at":"2012-06-09T12:58:28Z","abstract_excerpt":"Left-sequential logics provide a means for reasoning about (closed) propositional terms with atomic propositions that may have side effects and that are evaluated sequentially from left to right. Such propositional terms are commonly used in programming languages to direct the flow of a program. In this thesis we explore two such left-sequential logics. First we discuss Fully Evaluated Left-Sequential Logic, which employs a full evaluation strategy, i.e., to evaluate a term every one of its atomic propositions is evaluated causing its possible side effects to occur. We then turn to Short-Circu"},"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":"1206.1936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-06-09T12:58:28Z","cross_cats_sorted":[],"title_canon_sha256":"f106a3fcf2b0f8458656caf19a9d08c92c48fc56bb404dbb9822657b23f63c5b","abstract_canon_sha256":"311045fd1ac088997b7c87eb8b9a359261e6afdb27d44e473b2dd4fae9152516"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:53.777011Z","signature_b64":"tl0o5A63OCEPZNNGQOXyaiMX+BvQ2mWC6ZcB7NKFvfsOBm3INI7e2j60dhI5PJeI9Y/pWDJA2lhfj80NSsZyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60354ea2bd59bfb54dbe77a4caf08c09d1fb78c1866a75017be8f5be4b5b7689","last_reissued_at":"2026-05-18T03:53:53.776506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:53.776506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completeness for Two Left-Sequential Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"D.J.C. Staudt","submitted_at":"2012-06-09T12:58:28Z","abstract_excerpt":"Left-sequential logics provide a means for reasoning about (closed) propositional terms with atomic propositions that may have side effects and that are evaluated sequentially from left to right. Such propositional terms are commonly used in programming languages to direct the flow of a program. In this thesis we explore two such left-sequential logics. First we discuss Fully Evaluated Left-Sequential Logic, which employs a full evaluation strategy, i.e., to evaluate a term every one of its atomic propositions is evaluated causing its possible side effects to occur. We then turn to Short-Circu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1936","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":"1206.1936","created_at":"2026-05-18T03:53:53.776567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1936v1","created_at":"2026-05-18T03:53:53.776567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1936","created_at":"2026-05-18T03:53:53.776567+00:00"},{"alias_kind":"pith_short_12","alias_value":"MA2U5IV5LG73","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MA2U5IV5LG73KTN6","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MA2U5IV5","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2403.14576","citing_title":"Fully Evaluated Left-Sequential Logics","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MA2U5IV5LG73KTN6O6SMV4EMBH","json":"https://pith.science/pith/MA2U5IV5LG73KTN6O6SMV4EMBH.json","graph_json":"https://pith.science/api/pith-number/MA2U5IV5LG73KTN6O6SMV4EMBH/graph.json","events_json":"https://pith.science/api/pith-number/MA2U5IV5LG73KTN6O6SMV4EMBH/events.json","paper":"https://pith.science/paper/MA2U5IV5"},"agent_actions":{"view_html":"https://pith.science/pith/MA2U5IV5LG73KTN6O6SMV4EMBH","download_json":"https://pith.science/pith/MA2U5IV5LG73KTN6O6SMV4EMBH.json","view_paper":"https://pith.science/paper/MA2U5IV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1936&json=true","fetch_graph":"https://pith.science/api/pith-number/MA2U5IV5LG73KTN6O6SMV4EMBH/graph.json","fetch_events":"https://pith.science/api/pith-number/MA2U5IV5LG73KTN6O6SMV4EMBH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MA2U5IV5LG73KTN6O6SMV4EMBH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MA2U5IV5LG73KTN6O6SMV4EMBH/action/storage_attestation","attest_author":"https://pith.science/pith/MA2U5IV5LG73KTN6O6SMV4EMBH/action/author_attestation","sign_citation":"https://pith.science/pith/MA2U5IV5LG73KTN6O6SMV4EMBH/action/citation_signature","submit_replication":"https://pith.science/pith/MA2U5IV5LG73KTN6O6SMV4EMBH/action/replication_record"}},"created_at":"2026-05-18T03:53:53.776567+00:00","updated_at":"2026-05-18T03:53:53.776567+00:00"}