{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YZ6PQ23ZTL3H6R7WX7EOUFQMMN","short_pith_number":"pith:YZ6PQ23Z","schema_version":"1.0","canonical_sha256":"c67cf86b799af67f47f6bfc8ea160c6364d9db30f5376ba373231b049c0adf24","source":{"kind":"arxiv","id":"2403.14576","version":2},"attestation_state":"computed","paper":{"title":"Fully Evaluated Left-Sequential Logics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alban Ponse, Daan J.C. Staudt","submitted_at":"2024-03-21T17:27:41Z","abstract_excerpt":"We consider a family of two-valued \"fully evaluated left-sequential logics\" (FELs), of which Free FEL (defined by Staudt in 2012) is most distinguishing (weakest) and immune to atomic side effects. Next is Memorising FEL, in which evaluations of subexpressions are memorised. The following stronger logic is Conditional FEL (inspired by Guzm\\'an and Squier's Conditional logic, 1990). The strongest FEL is static FEL, a sequential version of propositional logic. We use evaluation trees as a simple, intuitive semantics and provide complete axiomatisations for closed terms (left-sequential propositi"},"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":"2403.14576","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2024-03-21T17:27:41Z","cross_cats_sorted":[],"title_canon_sha256":"43be223ea13c2ce71debfe7fa089f72c759769c51c21701d592cbedf056a5b26","abstract_canon_sha256":"ca7996ef14336eaef3798948aa790311b8c49d12b5e64bc80914068e6f46bad2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:15.125947Z","signature_b64":"YlarS4rAjSpMVzuZR6cvT1nloJBanpUiG7Pxx7xjtXpzqjXWakDagzh6+Zx41wC075OQFZgvRMIZ4qwYUezpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c67cf86b799af67f47f6bfc8ea160c6364d9db30f5376ba373231b049c0adf24","last_reissued_at":"2026-05-18T02:45:15.125301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:15.125301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Evaluated Left-Sequential Logics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alban Ponse, Daan J.C. Staudt","submitted_at":"2024-03-21T17:27:41Z","abstract_excerpt":"We consider a family of two-valued \"fully evaluated left-sequential logics\" (FELs), of which Free FEL (defined by Staudt in 2012) is most distinguishing (weakest) and immune to atomic side effects. Next is Memorising FEL, in which evaluations of subexpressions are memorised. The following stronger logic is Conditional FEL (inspired by Guzm\\'an and Squier's Conditional logic, 1990). The strongest FEL is static FEL, a sequential version of propositional logic. We use evaluation trees as a simple, intuitive semantics and provide complete axiomatisations for closed terms (left-sequential propositi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14576","kind":"arxiv","version":2},"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":"2403.14576","created_at":"2026-05-18T02:45:15.125431+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.14576v2","created_at":"2026-05-18T02:45:15.125431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14576","created_at":"2026-05-18T02:45:15.125431+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZ6PQ23ZTL3H","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZ6PQ23ZTL3H6R7W","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZ6PQ23Z","created_at":"2026-05-18T12:33:37.589309+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/YZ6PQ23ZTL3H6R7WX7EOUFQMMN","json":"https://pith.science/pith/YZ6PQ23ZTL3H6R7WX7EOUFQMMN.json","graph_json":"https://pith.science/api/pith-number/YZ6PQ23ZTL3H6R7WX7EOUFQMMN/graph.json","events_json":"https://pith.science/api/pith-number/YZ6PQ23ZTL3H6R7WX7EOUFQMMN/events.json","paper":"https://pith.science/paper/YZ6PQ23Z"},"agent_actions":{"view_html":"https://pith.science/pith/YZ6PQ23ZTL3H6R7WX7EOUFQMMN","download_json":"https://pith.science/pith/YZ6PQ23ZTL3H6R7WX7EOUFQMMN.json","view_paper":"https://pith.science/paper/YZ6PQ23Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.14576&json=true","fetch_graph":"https://pith.science/api/pith-number/YZ6PQ23ZTL3H6R7WX7EOUFQMMN/graph.json","fetch_events":"https://pith.science/api/pith-number/YZ6PQ23ZTL3H6R7WX7EOUFQMMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZ6PQ23ZTL3H6R7WX7EOUFQMMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZ6PQ23ZTL3H6R7WX7EOUFQMMN/action/storage_attestation","attest_author":"https://pith.science/pith/YZ6PQ23ZTL3H6R7WX7EOUFQMMN/action/author_attestation","sign_citation":"https://pith.science/pith/YZ6PQ23ZTL3H6R7WX7EOUFQMMN/action/citation_signature","submit_replication":"https://pith.science/pith/YZ6PQ23ZTL3H6R7WX7EOUFQMMN/action/replication_record"}},"created_at":"2026-05-18T02:45:15.125431+00:00","updated_at":"2026-05-18T02:45:15.125431+00:00"}