{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IXZJHMGTBVZHIIBH6DBSUAHUFW","short_pith_number":"pith:IXZJHMGT","schema_version":"1.0","canonical_sha256":"45f293b0d30d72742027f0c32a00f42db130630e3a857058ca0a5b667d37f48e","source":{"kind":"arxiv","id":"2410.07067","version":2},"attestation_state":"computed","paper":{"title":"Bicompleteness Theorems for Team Logics with the Dual Negation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Aleksi Anttila","submitted_at":"2024-10-09T17:14:00Z","abstract_excerpt":"The dual or game-theoretical negation $\\lnot$ of independence-friendly logic (IF) and dependence logic (D) exhibits an extreme degree of semantic indeterminacy in that for any pair of sentences $\\phi$ and $\\psi$ of IF/D, if $\\phi$ and $\\psi$ are incompatible in the sense that they share no models, there is a sentence $\\theta$ of IF/D such that $\\phi\\equiv \\theta$ and $\\psi\\equiv \\lnot \\theta$ (as shown originally by Burgess in the equivalent context of the prenex fragment of Henkin quantifier logic). We show that by adjusting the notion of incompatibility employed, analogues of this result can"},"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":"2410.07067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2024-10-09T17:14:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"e21db7ec4f945677f56d75e5875f13de02fbe7a99e02d90c512f4de6488a39e7","abstract_canon_sha256":"dfcce9db0f8460f7e71be995f2e8db9e020d0c0939996d9d1e3994ce3e779cfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:26.956175Z","signature_b64":"/6IBeL7mPAcA5ATfw6TGpqzJVGGekpiHiUUIULOPE0SacvZMMjq6x2PNz+JMN5qQjj4SqHlh/5FFdDePAqqGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45f293b0d30d72742027f0c32a00f42db130630e3a857058ca0a5b667d37f48e","last_reissued_at":"2026-06-23T03:14:26.955777Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:26.955777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bicompleteness Theorems for Team Logics with the Dual Negation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Aleksi Anttila","submitted_at":"2024-10-09T17:14:00Z","abstract_excerpt":"The dual or game-theoretical negation $\\lnot$ of independence-friendly logic (IF) and dependence logic (D) exhibits an extreme degree of semantic indeterminacy in that for any pair of sentences $\\phi$ and $\\psi$ of IF/D, if $\\phi$ and $\\psi$ are incompatible in the sense that they share no models, there is a sentence $\\theta$ of IF/D such that $\\phi\\equiv \\theta$ and $\\psi\\equiv \\lnot \\theta$ (as shown originally by Burgess in the equivalent context of the prenex fragment of Henkin quantifier logic). We show that by adjusting the notion of incompatibility employed, analogues of this result can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.07067","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.07067/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2410.07067","created_at":"2026-06-23T03:14:26.955836+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.07067v2","created_at":"2026-06-23T03:14:26.955836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.07067","created_at":"2026-06-23T03:14:26.955836+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXZJHMGTBVZH","created_at":"2026-06-23T03:14:26.955836+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXZJHMGTBVZHIIBH","created_at":"2026-06-23T03:14:26.955836+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXZJHMGT","created_at":"2026-06-23T03:14:26.955836+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.08122","citing_title":"Complexity Results in Team Semantics: Nonemptiness Is Not So Complex","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IXZJHMGTBVZHIIBH6DBSUAHUFW","json":"https://pith.science/pith/IXZJHMGTBVZHIIBH6DBSUAHUFW.json","graph_json":"https://pith.science/api/pith-number/IXZJHMGTBVZHIIBH6DBSUAHUFW/graph.json","events_json":"https://pith.science/api/pith-number/IXZJHMGTBVZHIIBH6DBSUAHUFW/events.json","paper":"https://pith.science/paper/IXZJHMGT"},"agent_actions":{"view_html":"https://pith.science/pith/IXZJHMGTBVZHIIBH6DBSUAHUFW","download_json":"https://pith.science/pith/IXZJHMGTBVZHIIBH6DBSUAHUFW.json","view_paper":"https://pith.science/paper/IXZJHMGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.07067&json=true","fetch_graph":"https://pith.science/api/pith-number/IXZJHMGTBVZHIIBH6DBSUAHUFW/graph.json","fetch_events":"https://pith.science/api/pith-number/IXZJHMGTBVZHIIBH6DBSUAHUFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXZJHMGTBVZHIIBH6DBSUAHUFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXZJHMGTBVZHIIBH6DBSUAHUFW/action/storage_attestation","attest_author":"https://pith.science/pith/IXZJHMGTBVZHIIBH6DBSUAHUFW/action/author_attestation","sign_citation":"https://pith.science/pith/IXZJHMGTBVZHIIBH6DBSUAHUFW/action/citation_signature","submit_replication":"https://pith.science/pith/IXZJHMGTBVZHIIBH6DBSUAHUFW/action/replication_record"}},"created_at":"2026-06-23T03:14:26.955836+00:00","updated_at":"2026-06-23T03:14:26.955836+00:00"}