{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FMBKJTJJEANP6KDJCELEV334YH","short_pith_number":"pith:FMBKJTJJ","schema_version":"1.0","canonical_sha256":"2b02a4cd29201aff286911164aef7cc1de35142c0dec5ca283b1b9a202ddfea8","source":{"kind":"arxiv","id":"1803.09815","version":2},"attestation_state":"computed","paper":{"title":"Maximality in finite-valued Lukasiewicz logics defined by order filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Francesc Esteva, Joan Gispert, Lluis Godo, Marcelo E. Coniglio","submitted_at":"2018-03-26T19:53:36Z","abstract_excerpt":"In this paper we consider the logics $L_n^i$ obtained from the (n+1)-valued Lukasiewicz logics $L_{n+1}$ by taking the order filter generated by i/n as the set of designated elements. In particular, the conditions of maximality and strong maximality among them are analysed. We present a very general theorem which provides sufficient conditions for maximality between logics. As a consequence of this theorem it is shown that $L_n^i$ is maximal w.r.t. CPL whenever n is prime. Concerning strong maximality between the logics $L_n^i$ (that is, maximality w.r.t. rules instead of axioms), we provide a"},"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.09815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-03-26T19:53:36Z","cross_cats_sorted":[],"title_canon_sha256":"e311fcfcedfc9f5251651c80572dd701802e928d82e24507b67cb6f4e05c545f","abstract_canon_sha256":"f7a0fe9105dff0fdf7709b9cf8fee2b943d33c9841fcc6f2db5e3827620787ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:32.652375Z","signature_b64":"iTLWItW1MBK52mKUtSNQ3B50hmpj8tJoIpiG65xhFylmaBA8/qsGRATBrNdPiFlGuT/uigd25cqsK8Y1rD4TCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b02a4cd29201aff286911164aef7cc1de35142c0dec5ca283b1b9a202ddfea8","last_reissued_at":"2026-05-18T00:19:32.651896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:32.651896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximality in finite-valued Lukasiewicz logics defined by order filters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Francesc Esteva, Joan Gispert, Lluis Godo, Marcelo E. Coniglio","submitted_at":"2018-03-26T19:53:36Z","abstract_excerpt":"In this paper we consider the logics $L_n^i$ obtained from the (n+1)-valued Lukasiewicz logics $L_{n+1}$ by taking the order filter generated by i/n as the set of designated elements. In particular, the conditions of maximality and strong maximality among them are analysed. We present a very general theorem which provides sufficient conditions for maximality between logics. As a consequence of this theorem it is shown that $L_n^i$ is maximal w.r.t. CPL whenever n is prime. Concerning strong maximality between the logics $L_n^i$ (that is, maximality w.r.t. rules instead of axioms), we provide a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09815","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":"1803.09815","created_at":"2026-05-18T00:19:32.651966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09815v2","created_at":"2026-05-18T00:19:32.651966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09815","created_at":"2026-05-18T00:19:32.651966+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMBKJTJJEANP","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMBKJTJJEANP6KDJ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMBKJTJJ","created_at":"2026-05-18T12:32:22.470017+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/FMBKJTJJEANP6KDJCELEV334YH","json":"https://pith.science/pith/FMBKJTJJEANP6KDJCELEV334YH.json","graph_json":"https://pith.science/api/pith-number/FMBKJTJJEANP6KDJCELEV334YH/graph.json","events_json":"https://pith.science/api/pith-number/FMBKJTJJEANP6KDJCELEV334YH/events.json","paper":"https://pith.science/paper/FMBKJTJJ"},"agent_actions":{"view_html":"https://pith.science/pith/FMBKJTJJEANP6KDJCELEV334YH","download_json":"https://pith.science/pith/FMBKJTJJEANP6KDJCELEV334YH.json","view_paper":"https://pith.science/paper/FMBKJTJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09815&json=true","fetch_graph":"https://pith.science/api/pith-number/FMBKJTJJEANP6KDJCELEV334YH/graph.json","fetch_events":"https://pith.science/api/pith-number/FMBKJTJJEANP6KDJCELEV334YH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMBKJTJJEANP6KDJCELEV334YH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMBKJTJJEANP6KDJCELEV334YH/action/storage_attestation","attest_author":"https://pith.science/pith/FMBKJTJJEANP6KDJCELEV334YH/action/author_attestation","sign_citation":"https://pith.science/pith/FMBKJTJJEANP6KDJCELEV334YH/action/citation_signature","submit_replication":"https://pith.science/pith/FMBKJTJJEANP6KDJCELEV334YH/action/replication_record"}},"created_at":"2026-05-18T00:19:32.651966+00:00","updated_at":"2026-05-18T00:19:32.651966+00:00"}