{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:U6QSMUUOXANLPFM2TDGXILBVLP","short_pith_number":"pith:U6QSMUUO","schema_version":"1.0","canonical_sha256":"a7a126528eb81ab7959a98cd742c355bc92ee3d1219a200f6a55a842db3a3d6c","source":{"kind":"arxiv","id":"1712.05513","version":3},"attestation_state":"computed","paper":{"title":"A Decidable Fragment of Second Order Logic With Applications to Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Mahesh Viswanathan, P. Madhusudan, Shambwaditya Saha, Umang Mathur","submitted_at":"2017-12-15T03:03:11Z","abstract_excerpt":"We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfiability of sentences in this fragment is decidable. EQSMT formulae have an $\\exists^*\\forall^*$ quantifier prefix (over variables, functions and relations) making EQSMT conducive for modeling synthesis problems. Moreover, EQSMT allows reasoning using a combination of background theories provided that they have a decidable satisfiability problem for the $\\exists^*\\forall^*$ FO-fragment (e.g., linear arithmetic). Our decision procedure reduces the satisfiability of EQSMT formulae to satisfiability "},"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":"1712.05513","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-12-15T03:03:11Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"7ed303ae2e91738f1a08a1bd567099e12f14c4b4299c07ad0f7226d673eb97c2","abstract_canon_sha256":"60dff6f2e80a016368074464f5ec24a77a77af58b1543b51f46097007a70e236"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:39.767444Z","signature_b64":"8TEHF3yKwvZoFCC8b/JgShk5rqPY0MmJzuw4OKtaRMAbt/rOBKaNsfFHefQ5sCvm0rrGJ9ZrqO0fD6z7DfgjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7a126528eb81ab7959a98cd742c355bc92ee3d1219a200f6a55a842db3a3d6c","last_reissued_at":"2026-05-18T00:04:39.766968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:39.766968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Decidable Fragment of Second Order Logic With Applications to Synthesis","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Mahesh Viswanathan, P. Madhusudan, Shambwaditya Saha, Umang Mathur","submitted_at":"2017-12-15T03:03:11Z","abstract_excerpt":"We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfiability of sentences in this fragment is decidable. EQSMT formulae have an $\\exists^*\\forall^*$ quantifier prefix (over variables, functions and relations) making EQSMT conducive for modeling synthesis problems. Moreover, EQSMT allows reasoning using a combination of background theories provided that they have a decidable satisfiability problem for the $\\exists^*\\forall^*$ FO-fragment (e.g., linear arithmetic). Our decision procedure reduces the satisfiability of EQSMT formulae to satisfiability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05513","kind":"arxiv","version":3},"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":"1712.05513","created_at":"2026-05-18T00:04:39.767038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05513v3","created_at":"2026-05-18T00:04:39.767038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05513","created_at":"2026-05-18T00:04:39.767038+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6QSMUUOXANL","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6QSMUUOXANLPFM2","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6QSMUUO","created_at":"2026-05-18T12:31:46.661854+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/U6QSMUUOXANLPFM2TDGXILBVLP","json":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP.json","graph_json":"https://pith.science/api/pith-number/U6QSMUUOXANLPFM2TDGXILBVLP/graph.json","events_json":"https://pith.science/api/pith-number/U6QSMUUOXANLPFM2TDGXILBVLP/events.json","paper":"https://pith.science/paper/U6QSMUUO"},"agent_actions":{"view_html":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP","download_json":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP.json","view_paper":"https://pith.science/paper/U6QSMUUO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05513&json=true","fetch_graph":"https://pith.science/api/pith-number/U6QSMUUOXANLPFM2TDGXILBVLP/graph.json","fetch_events":"https://pith.science/api/pith-number/U6QSMUUOXANLPFM2TDGXILBVLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP/action/storage_attestation","attest_author":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP/action/author_attestation","sign_citation":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP/action/citation_signature","submit_replication":"https://pith.science/pith/U6QSMUUOXANLPFM2TDGXILBVLP/action/replication_record"}},"created_at":"2026-05-18T00:04:39.767038+00:00","updated_at":"2026-05-18T00:04:39.767038+00:00"}