{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:C2GOTKRXK6EF5TKSFEUCGVCJ3V","short_pith_number":"pith:C2GOTKRX","schema_version":"1.0","canonical_sha256":"168ce9aa3757885ecd522928235449dd7dec4a6af9b53886bdd7ac53f53a18d2","source":{"kind":"arxiv","id":"1104.3148","version":1},"attestation_state":"computed","paper":{"title":"Complexity of two-variable Dependence Logic and IF-Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Antti Kuusisto, Jonni Virtema, Juha Kontinen, Peter Lohmann","submitted_at":"2011-04-15T20:13:14Z","abstract_excerpt":"We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a constant symbol). This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on L"},"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":"1104.3148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-15T20:13:14Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1c762048c8c74eb9fea59d8d196ece5b709f851e14b6ea16076bd622995d2c9d","abstract_canon_sha256":"98fd7562b92a2d8511d4533494029673486ed2e26cc78796d5ad9e79179ba600"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:05.687206Z","signature_b64":"VjSBCgQEyPPV86a+BwCIR8gjdq2qn8o6JZRtT7CxeORcpvsyKallI2SNmJiq8ijLSbA52rzVCuZgjgnsGWLjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"168ce9aa3757885ecd522928235449dd7dec4a6af9b53886bdd7ac53f53a18d2","last_reissued_at":"2026-05-18T04:24:05.686615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:05.686615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of two-variable Dependence Logic and IF-Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Antti Kuusisto, Jonni Virtema, Juha Kontinen, Peter Lohmann","submitted_at":"2011-04-15T20:13:14Z","abstract_excerpt":"We study the two-variable fragments D^2 and IF^2 of dependence logic and independence-friendly logic. We consider the satisfiability and finite satisfiability problems of these logics and show that for D^2, both problems are NEXPTIME-complete, whereas for IF^2, the problems are undecidable. We also show that D^2 is strictly less expressive than IF^2 and that already in D^2, equicardinality of two unary predicates and infinity can be expressed (the latter in the presence of a constant symbol). This is an extended version of a publication in the proceedings of the 26th Annual IEEE Symposium on L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3148","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":"1104.3148","created_at":"2026-05-18T04:24:05.686709+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3148v1","created_at":"2026-05-18T04:24:05.686709+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3148","created_at":"2026-05-18T04:24:05.686709+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2GOTKRXK6EF","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2GOTKRXK6EF5TKS","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2GOTKRX","created_at":"2026-05-18T12:26:24.575870+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/C2GOTKRXK6EF5TKSFEUCGVCJ3V","json":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V.json","graph_json":"https://pith.science/api/pith-number/C2GOTKRXK6EF5TKSFEUCGVCJ3V/graph.json","events_json":"https://pith.science/api/pith-number/C2GOTKRXK6EF5TKSFEUCGVCJ3V/events.json","paper":"https://pith.science/paper/C2GOTKRX"},"agent_actions":{"view_html":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V","download_json":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V.json","view_paper":"https://pith.science/paper/C2GOTKRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3148&json=true","fetch_graph":"https://pith.science/api/pith-number/C2GOTKRXK6EF5TKSFEUCGVCJ3V/graph.json","fetch_events":"https://pith.science/api/pith-number/C2GOTKRXK6EF5TKSFEUCGVCJ3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/action/storage_attestation","attest_author":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/action/author_attestation","sign_citation":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/action/citation_signature","submit_replication":"https://pith.science/pith/C2GOTKRXK6EF5TKSFEUCGVCJ3V/action/replication_record"}},"created_at":"2026-05-18T04:24:05.686709+00:00","updated_at":"2026-05-18T04:24:05.686709+00:00"}