{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZWZMOEWFYCZNDODTGGIWOTQREX","short_pith_number":"pith:ZWZMOEWF","schema_version":"1.0","canonical_sha256":"cdb2c712c5c0b2d1b8733191674e1125ee4cbfa87f1b3e026d309476a9a72672","source":{"kind":"arxiv","id":"1108.6261","version":2},"attestation_state":"computed","paper":{"title":"The complexity of admissible rules of {\\L}ukasiewicz logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.LO"],"primary_cat":"cs.LO","authors_text":"Emil Je\\v{r}\\'abek","submitted_at":"2011-08-31T15:19:06Z","abstract_excerpt":"We investigate the computational complexity of admissibility of inference rules in infinite-valued {\\L}ukasiewicz propositional logic (\\L). It was shown in [13] that admissibility in {\\L} is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of {\\L} are PSPACE-complete. In contrast, derivable rules of {\\L} are known to be coNP-complete."},"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":"1108.6261","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-31T15:19:06Z","cross_cats_sorted":["cs.CC","math.LO"],"title_canon_sha256":"84b4031da9781b7d73e8eab60eb9385d1be1f9adbc94c89e251eba869ede8928","abstract_canon_sha256":"98a51bcf18a158b7d460266c51222ca81b41125d3e30f4b278d24a61ea00b770"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:16.398064Z","signature_b64":"0i2uJZLFuOMVoJ74QZ31Qu67xtFA3852pkSr5dXTZ2P9UxBvKKuLdEz38Li6kcTd5K9DuVersZkLcHcQaZZDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdb2c712c5c0b2d1b8733191674e1125ee4cbfa87f1b3e026d309476a9a72672","last_reissued_at":"2026-05-18T03:25:16.397403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:16.397403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of admissible rules of {\\L}ukasiewicz logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.LO"],"primary_cat":"cs.LO","authors_text":"Emil Je\\v{r}\\'abek","submitted_at":"2011-08-31T15:19:06Z","abstract_excerpt":"We investigate the computational complexity of admissibility of inference rules in infinite-valued {\\L}ukasiewicz propositional logic (\\L). It was shown in [13] that admissibility in {\\L} is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of {\\L} are PSPACE-complete. In contrast, derivable rules of {\\L} are known to be coNP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.6261","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":"1108.6261","created_at":"2026-05-18T03:25:16.397518+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.6261v2","created_at":"2026-05-18T03:25:16.397518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6261","created_at":"2026-05-18T03:25:16.397518+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWZMOEWFYCZN","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWZMOEWFYCZNDODT","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWZMOEWF","created_at":"2026-05-18T12:26:50.516681+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/ZWZMOEWFYCZNDODTGGIWOTQREX","json":"https://pith.science/pith/ZWZMOEWFYCZNDODTGGIWOTQREX.json","graph_json":"https://pith.science/api/pith-number/ZWZMOEWFYCZNDODTGGIWOTQREX/graph.json","events_json":"https://pith.science/api/pith-number/ZWZMOEWFYCZNDODTGGIWOTQREX/events.json","paper":"https://pith.science/paper/ZWZMOEWF"},"agent_actions":{"view_html":"https://pith.science/pith/ZWZMOEWFYCZNDODTGGIWOTQREX","download_json":"https://pith.science/pith/ZWZMOEWFYCZNDODTGGIWOTQREX.json","view_paper":"https://pith.science/paper/ZWZMOEWF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.6261&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWZMOEWFYCZNDODTGGIWOTQREX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWZMOEWFYCZNDODTGGIWOTQREX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWZMOEWFYCZNDODTGGIWOTQREX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWZMOEWFYCZNDODTGGIWOTQREX/action/storage_attestation","attest_author":"https://pith.science/pith/ZWZMOEWFYCZNDODTGGIWOTQREX/action/author_attestation","sign_citation":"https://pith.science/pith/ZWZMOEWFYCZNDODTGGIWOTQREX/action/citation_signature","submit_replication":"https://pith.science/pith/ZWZMOEWFYCZNDODTGGIWOTQREX/action/replication_record"}},"created_at":"2026-05-18T03:25:16.397518+00:00","updated_at":"2026-05-18T03:25:16.397518+00:00"}