{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ORVJRTEHILOK2MUJWQKQJKCL4I","short_pith_number":"pith:ORVJRTEH","schema_version":"1.0","canonical_sha256":"746a98cc8742dcad3289b41504a84be204bdca82a81bfe0dfb731621adedeb07","source":{"kind":"arxiv","id":"1403.3157","version":1},"attestation_state":"computed","paper":{"title":"The Computational Compexity of Decision Problem in Additive Extensions of Nonassociative Lambek Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Minghui Ma, Zhe Lin","submitted_at":"2014-03-13T03:51:29Z","abstract_excerpt":"We analyze the complexity of decision problems for Boolean Nonassociative Lambek Calculus admitting empty antecedent of sequents ($\\mathsf{BFNL^*}$), and the consequence relation of Distributive Full Nonassociative Lambek Calculus ($\\mathsf{DFNL}$). We construct a polynomial reduction from modal logic $\\mathsf{K}$ into $\\mathsf{BFNL^*}$. As a consequence, we prove that the decision problem for $\\mathsf{BFNL^*}$ is PSPACE-hard. We also prove that the same result holds for the consequence relation of DFNL, by reducing $\\mathsf{BFNL^*}$ in polynomial time to DFNL enriched with finite set of assum"},"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":"1403.3157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-03-13T03:51:29Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a6151e873894650df566294fe41a1b6599b4e8198b027c98ae18e43dc79bfad0","abstract_canon_sha256":"a12c0aceabd94bf3b43eb8c0ed75777d23c66a5dd517f5b43cd778d779d11128"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:31.766508Z","signature_b64":"vTKsZ9FfewHzdKRs7k5r8uSPa1owGEJ/uLhorxfcj15gmXm1jC9j/2qCq211zZ45wX44jfULEFO6brhPYIgvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"746a98cc8742dcad3289b41504a84be204bdca82a81bfe0dfb731621adedeb07","last_reissued_at":"2026-05-18T02:56:31.765722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:31.765722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Compexity of Decision Problem in Additive Extensions of Nonassociative Lambek Calculus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Minghui Ma, Zhe Lin","submitted_at":"2014-03-13T03:51:29Z","abstract_excerpt":"We analyze the complexity of decision problems for Boolean Nonassociative Lambek Calculus admitting empty antecedent of sequents ($\\mathsf{BFNL^*}$), and the consequence relation of Distributive Full Nonassociative Lambek Calculus ($\\mathsf{DFNL}$). We construct a polynomial reduction from modal logic $\\mathsf{K}$ into $\\mathsf{BFNL^*}$. As a consequence, we prove that the decision problem for $\\mathsf{BFNL^*}$ is PSPACE-hard. We also prove that the same result holds for the consequence relation of DFNL, by reducing $\\mathsf{BFNL^*}$ in polynomial time to DFNL enriched with finite set of assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3157","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":"1403.3157","created_at":"2026-05-18T02:56:31.765856+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.3157v1","created_at":"2026-05-18T02:56:31.765856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3157","created_at":"2026-05-18T02:56:31.765856+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORVJRTEHILOK","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORVJRTEHILOK2MUJ","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORVJRTEH","created_at":"2026-05-18T12:28:43.426989+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/ORVJRTEHILOK2MUJWQKQJKCL4I","json":"https://pith.science/pith/ORVJRTEHILOK2MUJWQKQJKCL4I.json","graph_json":"https://pith.science/api/pith-number/ORVJRTEHILOK2MUJWQKQJKCL4I/graph.json","events_json":"https://pith.science/api/pith-number/ORVJRTEHILOK2MUJWQKQJKCL4I/events.json","paper":"https://pith.science/paper/ORVJRTEH"},"agent_actions":{"view_html":"https://pith.science/pith/ORVJRTEHILOK2MUJWQKQJKCL4I","download_json":"https://pith.science/pith/ORVJRTEHILOK2MUJWQKQJKCL4I.json","view_paper":"https://pith.science/paper/ORVJRTEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.3157&json=true","fetch_graph":"https://pith.science/api/pith-number/ORVJRTEHILOK2MUJWQKQJKCL4I/graph.json","fetch_events":"https://pith.science/api/pith-number/ORVJRTEHILOK2MUJWQKQJKCL4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORVJRTEHILOK2MUJWQKQJKCL4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORVJRTEHILOK2MUJWQKQJKCL4I/action/storage_attestation","attest_author":"https://pith.science/pith/ORVJRTEHILOK2MUJWQKQJKCL4I/action/author_attestation","sign_citation":"https://pith.science/pith/ORVJRTEHILOK2MUJWQKQJKCL4I/action/citation_signature","submit_replication":"https://pith.science/pith/ORVJRTEHILOK2MUJWQKQJKCL4I/action/replication_record"}},"created_at":"2026-05-18T02:56:31.765856+00:00","updated_at":"2026-05-18T02:56:31.765856+00:00"}